Sciweavers

2107 search results - page 303 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
ICDM
2008
IEEE
137views Data Mining» more  ICDM 2008»
14 years 3 months ago
Stream Sequential Pattern Mining with Precise Error Bounds
Sequential pattern mining is an interesting data mining problem with many real-world applications. This problem has been studied extensively in static databases. However, in recen...
Luiz F. Mendes, Bolin Ding, Jiawei Han
LCTRTS
2001
Springer
14 years 1 months ago
A Dynamic Programming Approach to Optimal Integrated Code Generation
Phase-decoupled methods for code generation are the state of the art in compilers for standard processors but generally produce code of poor quality for irregular target architect...
Christoph W. Keßler, Andrzej Bednarski
COMPGEOM
2007
ACM
14 years 1 months ago
On approximate halfspace range counting and relative epsilon-approximations
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
Boris Aronov, Sariel Har-Peled, Micha Sharir
SODA
2010
ACM
213views Algorithms» more  SODA 2010»
14 years 6 months ago
Regular Expression Matching with Multi-Strings
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
Philip Bille, Mikkel Thorup
WWW
2004
ACM
14 years 9 months ago
Sic transit gloria telae: towards an understanding of the web's decay
The rapid growth of the web has been noted and tracked extensively. Recent studies have however documented the dual phenomenon: web pages have small half lives, and thus the web e...
Ziv Bar-Yossef, Andrei Z. Broder, Ravi Kumar, Andr...