Sciweavers

7006 search results - page 1042 / 1402
» Approximation Algorithms
Sort
View
WWW
2007
ACM
16 years 7 months ago
Cantina: a content-based approach to detecting phishing web sites
Phishing is a significant problem involving fraudulent email and web sites that trick unsuspecting users into revealing private information. In this paper, we present the design, ...
Jason I. Hong, Lorrie Faith Cranor, Yue Zhang 0002
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
16 years 7 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
KDD
2006
ACM
163views Data Mining» more  KDD 2006»
16 years 7 months ago
New EM derived from Kullback-Leibler divergence
We introduce a new EM framework in which it is possible not only to optimize the model parameters but also the number of model components. A key feature of our approach is that we...
Longin Jan Latecki, Marc Sobel, Rolf Lakämper
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
16 years 7 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...
SODA
2010
ACM
177views Algorithms» more  SODA 2010»
16 years 4 months ago
On the Exact Space Complexity of Sketching and Streaming Small Norms
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
« Prev « First page 1042 / 1402 Last » Next »