3874 search results - page 375 / 775 » Approximation Algorithms for k-hurdle Problems |
140
click to vote
ICRA
2003
IEEE
15 years 11 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...
134
click to vote
CORR
2008
Springer
15 years 6 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...
178
click to vote
ICALP
2009
Springer
16 years 6 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...
148
click to vote
RECSYS
2009
ACM
16 years 20 days ago
2009
ACM
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
136
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the movie ‘Godfather...