3874 search results - page 516 / 775 » Approximation Algorithms for k-hurdle Problems |
119
click to vote
APPROX
2007
Springer
15 years 11 months ago
2007
Springer
abstract Manor Mendel1 and Assaf Naor2 1 The Open University of Israel 2 Courant Institute Let (X, dX ) be an n-point metric space. We show that there exists a distribution D over ...
133
click to vote
SAC
2005
ACM
15 years 10 months ago
2005
ACM
We investigate the problem of evaluating the performance of text processing algorithms on inputs that contain errors as a result of optical character recognition. A new hierarchic...
148
Voted
AAIM
2005
Springer
15 years 10 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
130
click to vote
DGCI
2005
Springer
15 years 10 months ago
2005
Springer
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
141
click to vote
ICRA
2003
IEEE
15 years 10 months ago
2003
IEEE
— One of the most difficult aspects of dealing with illumination effects in computer vision is accounting for specularity in the images of real objects. The specular regions in ...