نتایج جستجو برای: single cut

تعداد نتایج: 937426  

2006
Jian Sun Weiwei Zhang Xiaoou Tang Harry Shum

In this paper, we introduce background cut, a high quality and realtime foreground layer extraction algorithm. From a single video sequence with a moving foreground object and stationary background, our algorithm combines background subtraction, color and contrast cues to extract a foreground layer accurately and efficiently. The key idea in background cut is background contrast attenuation, wh...

Journal: :International Journal of Innovative Research in Science, Engineering and Technology 2014

2004
Mohammad Ali Khojastepour Ashutosh Sabharwal Behnaam Aazhang

We derive new cut-set bounds on the achievable rates in a general multi-terminal network with finite number of states. Multiple states are common in communication networks in the form of multiple channel and nodes’ states. Our results are broadly applicable and provide much tighter upper bounds than the known single state min-cut max-flow theorem, and hence form an important new tool to bound t...

Abdolah Ayaran Ebrahim Panahpor Fatemeh Noraki, Hasan Rahmani

BACKGROUND: Nitrogen is a basic plant component, playing a decisive role in the intensification of plant production. Bio-fertilizers play a very significant role in improving soil fertility by fixing atmospheric nitrogen, both, in association with plant roots and without it, insoluble soil phosphates and produces plant growth substances in the soil. OBJECTIVES:</s...

2012
E. Tourniaire CAHIER DU Edouard Bonnet Bruno Escoffier Vangelis Th. Paschos Emeric Tourniaire

max (k, n − k)-cut (resp., min (k, n − k)-cut) is a constrained version of max-cut (resp., min-cut) where one has to find a bipartition of the vertex set into two subsets with respectively k and n − k vertices (n being the total number of vertices of the input graph) which maximizes (resp., minimizes) the number of edges going from one subset to the other. In this paper, we investigate the para...

2003
ZOLTAN BARUCH OCTAVIAN CREŢ KALMAN PUSZTAI

Field-Programmable Gate Arrays (FPGAs) are flexible and reusable circuits that can be easily reconfigured by the designer. One of the steps involved in the logic design with FPGA circuits is placement. In this step, the logic functions are assigned to specific cells of the circuit. In this paper we present a placement algorithm for FPGA circuits. In traditional min-cut based placement algorithm...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید