4850 search results - page 118 / 970 » Approximate Data Structures with Applications |
CIKM
2008
Springer
14 years 12 months ago
2008
Springer
Structured P2P overlays supporting standard database functionalities are a popular choice for building large-scale distributed data management systems. In such systems, estimating...
WETICE
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—DHT systems are structured overlay networks capable of using P2P resources as a scalable platform for very large data storage applications. However, their efficiency ex...
109
click to vote
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
KDD
2010
ACM
14 years 12 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...