572 search results - page 90 / 115 » Exponential-Time Approximation of Hard Problems |
153
click to vote
ICRA
2006
IEEE
15 years 8 months ago
2006
IEEE
— Recently, Rao-Blackwellized particle filters have become a popular tool to solve the simultaneous localization and mapping problem. This technique applies a particle filter i...
116
click to vote
RECOMB
2007
Springer
16 years 2 months ago
2007
Springer
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
SODA
2010
ACM
15 years 11 months ago
2010
ACM
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
129
click to vote
ICALP
2004
Springer
15 years 7 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
117
click to vote
ISAAC
2003
Springer
15 years 7 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...