1554 search results - page 93 / 311 » Parameterized Complexity and Approximation Algorithms |
131
click to vote
FOCS
2004
IEEE
15 years 6 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
133
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
159
click to vote
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
Given a continuous function f : X â IR on a topological space X, its level set fâ1 (a) changes continuously as the real value a changes. Consequently, the connected components...
205
click to vote
Publication
Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schem...
115
click to vote
IROS
2007
IEEE
15 years 9 months ago
2007
IEEE
â Smoothing and optimization approaches are an effective means for solving the simultaneous localization and mapping (SLAM) problem. Most of the existing techniques focus mainly ...