2095 search results - page 212 / 419 » Improved pebbling bounds |
268
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
We consider the problem of speeding up Entity Recognition systems that exploit existing large databases of structured entities to improve extraction accuracy. These systems requir...
167
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Correlated or discriminative pattern mining is concerned with finding the highest scoring patterns w.r.t. a correlation measure (such as information gain). By reinterpreting corre...
193
click to vote
KDD
2003
ACM
16 years 7 months ago
2003
ACM
Decision tree construction is a well studied problem in data mining. Recently, there has been much interest in mining streaming data. Domingos and Hulten have presented a one-pass...
161
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
169
click to vote
PODS
2004
ACM
16 years 6 months ago
2004
ACM
We consider the problem of maintaining approximate counts and quantiles over fixed- and variablesize sliding windows in limited space. For quantiles, we present deterministic algo...