Sciweavers

522 search results - page 81 / 105
» The 3-Steiner Root Problem
Sort
View
MFCS
2004
Springer
14 years 2 months ago
The Bidimensional Theory of Bounded-Genus Graphs
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitr...
CVPR
2005
IEEE
14 years 10 months ago
Tracking Non-Stationary Appearances and Dynamic Feature Selection
Since the appearance changes of the target jeopardize visual measurements and often lead to tracking failure in practice, trackers need to be adaptive to non-stationary appearance...
Ming Yang, Ying Wu
ICML
2009
IEEE
14 years 9 months ago
Efficient Euclidean projections in linear time
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...
Jun Liu, Jieping Ye
SODA
2010
ACM
135views Algorithms» more  SODA 2010»
14 years 6 months ago
Probabilistic Analysis of the Semidefinite Relaxation Detector in Digital Communications
We consider the problem of detecting a vector of symbols that is being transmitted over a fading multiple?input multiple?output (MIMO) channel, where each symbol is an ?th root of...
Anthony Man-Cho So
ESA
2007
Springer
125views Algorithms» more  ESA 2007»
14 years 2 months ago
Pricing Tree Access Networks with Connected Backbones
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. R...