1403 search results - page 19 / 281 » Set cover algorithms for very large datasets |
KI
2007
Springer
14 years 2 months ago
2007
Springer
We introduce a novel stochastic local search algorithm for the vertex cover problem. Compared to current exhaustive search techniques, our algorithm achieves excellent performance ...
AMR
2006
Springer
14 years 5 days ago
2006
Springer
An original task of structuring and labeling large television streams is tackled in this paper. Emphasis is put on simple and efficient methods to detect precise boundaries of prog...
DATE
2004
IEEE
14 years 5 days ago
2004
IEEE
A distributed sensor network (DSN) designed to cover a given region R, is said to be alive if there is at least one subset of sensors that can collectively cover (sense) the regio...
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
ICDE
2011
IEEE
13 years 4 days ago
2011
IEEE
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...