Sciweavers

725 search results - page 52 / 145
» A General Greedy Approximation Algorithm with Applications
Sort
View
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
16 years 2 months ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
128
Voted
SDM
2009
SIAM
331views Data Mining» more  SDM 2009»
15 years 11 months ago
Privacy Preservation in Social Networks with Sensitive Edge Weights.
With the development of emerging social networks, such as Facebook and MySpace, security and privacy threats arising from social network analysis bring a risk of disclosure of con...
Jie Wang, Jinze Liu, Jun Zhang, Lian Liu
JMLR
2006
145views more  JMLR 2006»
15 years 2 months ago
Ensemble Pruning Via Semi-definite Programming
An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead t...
Yi Zhang 0006, Samuel Burer, W. Nick Street
SIGMOD
2001
ACM
160views Database» more  SIGMOD 2001»
16 years 2 months ago
Adaptive Precision Setting for Cached Approximate Values
Caching approximate values instead of exact values presents an opportunity for performance gains in exchange for decreased precision. To maximize the performance improvement, cach...
Chris Olston, Boon Thau Loo, Jennifer Widom
INFOCOM
2010
IEEE
15 years 28 days ago
Markov Approximation for Combinatorial Network Optimization
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
Minghua Chen, Soung Chang Liew, Ziyu Shao, Caihong...