Sciweavers

2745 search results - page 148 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
ADMA
2010
Springer
271views Data Mining» more  ADMA 2010»
14 years 11 months ago
Exploiting Concept Clumping for Efficient Incremental E-Mail Categorization
We introduce a novel approach to incremental e-mail categorization based on identifying and exploiting "clumps" of messages that are classified similarly. Clumping reflec...
Alfred Krzywicki, Wayne Wobcke
127
Voted
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
16 years 4 months ago
Spatial scan statistics: approximations and performance study
Spatial scan statistics are used to determine hotspots in spatial data, and are widely used in epidemiology and biosurveillance. In recent years, there has been much effort invest...
Deepak Agarwal, Andrew McGregor, Jeff M. Phillips,...
178
Voted
PCI
2001
Springer
15 years 8 months ago
An Experimental Evaluation of a Monte-Carlo Algorithm for Singular Value Decomposition
We demonstrate that an algorithm proposed by Drineas et. al. in [7] to approximate the singular vectors/values of a matrix A, is not only of theoretical interest but also a fast, v...
Petros Drineas, Eleni Drinea, Patrick S. Huggins
127
Voted
ASIACRYPT
2001
Springer
15 years 7 months ago
Efficient Traitor Tracing Algorithms Using List Decoding
Abstract. We use powerful new techniques for list decoding errorcorrecting codes to efficiently trace traitors. Although much work has focused on constructing traceability schemes,...
Alice Silverberg, Jessica Staddon, Judy L. Walker
FIMI
2004
239views Data Mining» more  FIMI 2004»
15 years 5 months ago
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
Takeaki Uno, Masashi Kiyomi, Hiroki Arimura