1403 search results - page 175 / 281 » Set cover algorithms for very large datasets |
165
Voted
KDD
2003
ACM
16 years 6 months ago
2003
ACM
In this paper we study the problem of constructing accurate decision tree models from data streams. Data streams are incremental tasks that require incremental, online, and any-ti...
131
click to vote
ICDE
2009
IEEE
16 years 28 days ago
2009
IEEE
— Keyword search on relational databases provides users with insights that they can not easily observe using the traditional RDBMS techniques. Here, an l-keyword query is speciï¬...
173
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
175
Voted
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
We propose an adaptive figure-ground classification algorithm to automatically extract a foreground region using a user-provided bounding-box. The image is first over-segmented wi...
143
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
Indexes for large collections are often divided into shards that are distributed across multiple computers and searched in parallel to provide rapid interactive search. Typically,...