9842 search results - page 1608 / 1969 » The Complexity of the Matching-Cut Problem |
289
Voted
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Keyword search enables web users to easily access XML data without the need to learn a structured query language and to study possibly complex data schemas. Existing work has addr...
276
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
In recent years there has been considerable research on automated selection of physical design in database systems. In current solutions, candidate access paths are heuristically ...
157
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
Duplicate detection is the problem of detecting different entries in a data source representing the same real-world entity. While research abounds in the realm of duplicate detect...
170
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
We consider the problem of mapping data in peer-topeer data-sharing systems. Such systems often rely on the use of mapping tables listing pairs of corresponding values to search f...
179
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
The outlier detection problem has important applications in the eld of fraud detection, network robustness analysis, and intrusion detection. Most such applications are high dimen...