Sciweavers

2228 search results - page 276 / 446
» Distributed Data Clustering Can Be Efficient and Exact
Sort
View
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
16 years 4 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
VLDB
2004
ACM
127views Database» more  VLDB 2004»
16 years 4 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
ICIP
1995
IEEE
15 years 8 months ago
Multigrid adaptive image processing
We consider a general weighted least squares approximation problem with a membrane spline regularization term. The key parameters in this formulation are the weighting factors whi...
Michael Unser
CLOUD
2010
ACM
15 years 9 months ago
Lithium: virtual machine storage for the cloud
To address the limitations of centralized shared storage for cloud computing, we are building Lithium, a distributed storage system designed specifically for virtualization workl...
Jacob Gorm Hansen, Eric Jul
ICDE
2005
IEEE
240views Database» more  ICDE 2005»
16 years 5 months ago
Adaptive Processing of Top-K Queries in XML
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
Amélie Marian, Divesh Srivastava, Nick Koud...