Sciweavers

220 search results - page 33 / 44
» New degree bounds for polynomial threshold functions
Sort
View
ICDM
2007
IEEE
183views Data Mining» more  ICDM 2007»
14 years 1 months ago
Depth-Based Novelty Detection and Its Application to Taxonomic Research
It is estimated that less than 10 percent of the world’s species have been described, yet species are being lost daily due to human destruction of natural habitats. The job of d...
Yixin Chen, Henry L. Bart Jr., Xin Dang, Hanxiang ...
KDD
2001
ACM
118views Data Mining» more  KDD 2001»
14 years 8 months ago
Infominer: mining surprising periodic patterns
In this paper, we focus on mining surprising periodic patterns in a sequence of events. In many applications, e.g., computational biology, an infrequent pattern is still considere...
Jiong Yang, Wei Wang 0010, Philip S. Yu
COLT
2000
Springer
13 years 12 months ago
PAC Analogues of Perceptron and Winnow via Boosting the Margin
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
Rocco A. Servedio
SIGECOM
2009
ACM
102views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
On the price of mediation
We study the relationship between the social cost of correlated equilibria and the social cost of Nash equilibria. In contrast to previous work focusing on the possible benefits ...
Milan Bradonjic, Gunes Ercal-Ozkaya, Adam Meyerson...
EUROCRYPT
2003
Springer
14 years 23 days ago
Algebraic Attacks on Stream Ciphers with Linear Feedback
A classical construction of stream ciphers is to combine several LFSRs and a highly non-linear Boolean function f. Their security is usually analysed in terms of correlation attack...
Nicolas Courtois, Willi Meier