3875 search results - page 615 / 775 » Approximation algorithms for the 0-extension problem |
189
click to vote
CVPR
2009
IEEE
17 years 25 days ago
2009
IEEE
Graph-based methods form a main category of semisupervised
learning, offering flexibility and easy implementation
in many applications. However, the performance of
these methods...
124
click to vote
ARITH
2007
IEEE
15 years 12 months ago
2007
IEEE
One considers the problem of finding hard to round cases of a periodic function for large floating-point inputs, more precisely when the function cannot be efficiently approxim...
143
click to vote
SSDBM
2007
IEEE
15 years 12 months ago
2007
IEEE
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...
149
Voted
WADS
2005
Springer
15 years 11 months ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
158
click to vote
EUROPAR
2008
Springer
15 years 7 months ago
2008
Springer
Chip multiprocessors designed for streaming applications such as Cell BE offer impressive peak performance but suffer from limited bandwidth to offchip main memory. As the number o...