16404 search results - page 2892 / 3281 » A set coverage problem |
330
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
312
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
In recent years, the data management community has begun to consider situations in which data access is closely tied to network routing and distributed acquisition: examples includ...
163
click to vote
ICIP
2004
IEEE
16 years 8 months ago
2004
IEEE
Image-based rendering data sets, such as light fields, require efficient compression due to their large data size, but also easy random access when rendering from the data set. Ef...
204
click to vote
ICIP
2003
IEEE
16 years 8 months ago
2003
IEEE
We present algorithms for automatic feature selection for unsupervised structure discovery from video sequences. Feature selection in this scenario is hard because of the absence ...
296
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...