1486 search results - page 159 / 298 » Algorithms for two-box covering |
138
click to vote
ICML
2004
IEEE
16 years 5 months ago
2004
IEEE
This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to fi...
143
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Contextual text mining is concerned with extracting topical themes from a text collection with context information (e.g., time and location) and comparing/analyzing the variations...
229
click to vote
VLDB
2001
ACM
16 years 4 months ago
2001
ACM
Schema matching is a basic problem in many database application domains, such as data integration, Ebusiness, data warehousing, and semantic query processing. In current implementa...
146
click to vote
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
143
click to vote
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
The search for an expressive calculus of datatypes in which canonical algorithms can be easily written and proven correct has proved to be an enduring challenge to the theoretical ...