Sciweavers

604 search results - page 88 / 121
» On the Complexity of the Maximum Cut Problem
Sort
View
CIMAGING
2009
265views Hardware» more  CIMAGING 2009»
15 years 28 days ago
Multi-object segmentation using coupled nonparametric shape and relative pose priors
We present a new method for multi-object segmentation in a maximum a posteriori estimation framework. Our method is motivated by the observation that neighboring or coupling objec...
Mustafa Gökhan Uzunbas, Octavian Soldea, M&uu...
CORR
2008
Springer
108views Education» more  CORR 2008»
14 years 12 months ago
Linear Processing and Sum Throughput in the Multiuser MIMO Downlink
We consider linear precoding and decoding in the downlink of a multiuser multiple-input, multipleoutput (MIMO) system, wherein each user may receive more than one data stream. We ...
Adam J. Tenenbaum, Raviraj S. Adve
INFOCOM
2009
IEEE
15 years 6 months ago
Minimizing the Cost of Mine Selection Via Sensor Networks
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
Changlei Liu, Guohong Cao
IPPS
2009
IEEE
15 years 6 months ago
Competitive buffer management with packet dependencies
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
Alexander Kesselman, Boaz Patt-Shamir, Gabriel Sca...
WG
2004
Springer
15 years 5 months ago
Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
Zhi-Zhong Chen, Tatsuie Tsukiji