447 search results - page 81 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
121
click to vote
COMPGEOM
2007
ACM
15 years 7 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
111
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In this paper we revisit the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurement...
116
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract— Robustness and reliability are critical issues in network management. To provide resiliency, a popular protection scheme against network failures is the simultaneous ro...
112
click to vote
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
Abstract. Variational problems, which are commonly used to solve lowlevel vision tasks, are typically minimized via a local, iterative optimization strategy, e.g. gradient descent....
103
click to vote
DAC
2005
ACM
16 years 4 months ago
2005
ACM
Placement migration is the movement of cells within an existing placement to address a variety of post-placement design closure issues, such as timing, routing congestion, signal ...