447 search results - page 81 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
81
Voted
COMPGEOM
2007
ACM
15 years 1 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 ...
CORR
2010
Springer
14 years 9 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...
75
Voted
INFOCOM
2010
IEEE
14 years 8 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...
74
Voted
ECCV
2008
Springer
15 years 11 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....
DAC
2005
ACM
15 years 10 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 ...