180 search results - page 3 / 36 » Fast and Near-Optimal Algorithms for Approximating Distribut... |
STOC
2002
ACM
14 years 6 months ago
2002
ACM
ICDE
2002
IEEE
14 years 7 months ago
2002
IEEE
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
DC
2010
13 years 6 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
ICIAP
2007
ACM
14 years 6 months ago
2007
ACM
Real-time histogram specification methods aims to find a continuous function that transforms a source image to match a target distribution with the highest possible degree of accu...
CIKM
2009
Springer
14 years 25 days ago
2009
Springer
Histogram construction or sequence segmentation is a basic task with applications in database systems, information retrieval, and knowledge management. Its aim is to approximate a...