2168 search results - page 7 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
FOCS
2008
IEEE
13 years 7 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—This paper presents Cramér-Rao bound-like inequalities for pose tracking, which is defined as the problem of recovering the robot displacement given two successive rea...
NCA
2005
IEEE
14 years 1 months ago
2005
IEEE
The fair bandwidth allocations can isolate flows and protect well-behaved flows from ill-behaved ones. CSFQ (Core Stateless Fair Queueing) achieves the approximate fairness by d...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
CPM
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...