Sciweavers

231 search results - page 40 / 47
» Stochastic Optimization is (Almost) as easy as Deterministic...
Sort
View
COLT
2005
Springer
14 years 1 months ago
Generalization Error Bounds Using Unlabeled Data
We present two new methods for obtaining generalization error bounds in a semi-supervised setting. Both methods are based on approximating the disagreement probability of pairs of ...
Matti Kääriäinen
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
14 years 7 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
HPCC
2007
Springer
14 years 1 months ago
Performance Evaluation of View-Oriented Parallel Programming on Cluster of Computers
Abstract. View-Oriented Parallel Programming(VOPP) is a novel programming style based on Distributed Shared Memory, which is friendly and easy for programmers to use. In this paper...
Haifeng Shang, Jiaqi Zhang, Wenguang Chen, Weimin ...
GLVLSI
2005
IEEE
85views VLSI» more  GLVLSI 2005»
14 years 1 months ago
VLSI CAD tool protection by birthmarking design solutions
Many techniques have been proposed in the past for the protection of VLSI design IPs (intellectual property). CAD tools and algorithms are intensively used in all phases of modern...
Lin Yuan, Gang Qu, Ankur Srivastava
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
13 years 9 months ago
Are approximation algorithms for consensus clustering worthwhile?
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
Michael Bertolacci, Anthony Wirth