1100 search results - page 6 / 220 » Approximate distance oracles |
ECML
2007
Springer
14 years 2 months ago
2007
Springer
When facing the question of learning languages in realistic settings, one has to tackle several problems that do not admit simple solutions. On the one hand, languages are usually...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
FOCS
1993
IEEE
14 years 17 days ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...