3894 search results - page 382 / 779 » Approximation Algorithms for Biclustering Problems |
147
click to vote
ECRTS
2006
IEEE
15 years 11 months ago
2006
IEEE
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduli...
143
click to vote
CAIP
2005
Springer
15 years 10 months ago
2005
Springer
We consider simple cube-curves in the orthogonal 3D grid. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded set. The c...
121
click to vote
ICRA
2003
IEEE
15 years 10 months ago
2003
IEEE
— We present a novel plane tracking algorithm based on the direct update of surface parameters from two stereo images. The plane tracking algorithm is posed as an optimization pr...
111
Voted
CORR
2008
Springer
15 years 5 months ago
2008
Springer
Compressive sampling offers a new paradigm for acquiring signals that are compressible with respect to an orthonormal basis. The major algorithmic challenge in compressive sampling...
158
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...