Sciweavers

1763 search results - page 330 / 353
» Dependent random choice
Sort
View
WWW
2004
ACM
14 years 8 months ago
A smart hill-climbing algorithm for application server configuration
The overwhelming success of the Web as a mechanism for facilitating information retrieval and for conducting business transactions has led to an increase in the deployment of comp...
Bowei Xi, Zhen Liu, Mukund Raghavachari, Cathy H. ...
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
14 years 8 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
KDD
2009
ACM
172views Data Mining» more  KDD 2009»
14 years 8 months ago
Towards combining web classification and web information extraction: a case study
: ? Towards Combining Web Classification and Web Information Extraction: a Case Study Ping Luo, Fen Lin, Yuhong Xiong, Yong Zhao, Zhongzhi Shi HP Laboratories HPL-2009-86 Classific...
Ping Luo, Fen Lin, Yuhong Xiong, Yong Zhao, Zhongz...
KDD
2008
ACM
259views Data Mining» more  KDD 2008»
14 years 8 months ago
Using ghost edges for classification in sparsely labeled networks
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
Brian Gallagher, Hanghang Tong, Tina Eliassi-Rad, ...
KDD
2008
ACM
134views Data Mining» more  KDD 2008»
14 years 8 months ago
Privacy-preserving cox regression for survival analysis
Privacy-preserving data mining (PPDM) is an emergent research area that addresses the incorporation of privacy preserving concerns to data mining techniques. In this paper we prop...
Shipeng Yu, Glenn Fung, Rómer Rosales, Srir...