1413 search results - page 83 / 283 » Efficient Learning of Semi-structured Data from Queries |
269
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Data availability, collection and storage have increased dramatically in recent years, raising new technological and algorithmic challenges for database design and data management...
194
click to vote
COMGEO
2008
ACM
15 years 6 months ago
2008
ACM
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
190
click to vote
KDD
1998
ACM
15 years 10 months ago
1998
ACM
This paper presents an algorithm for discovering conjunction rules with high reliability from data sets. The discovery of conjunction rules, each of which is a restricted form of ...
165
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
156
Voted
ECML
2006
Springer
15 years 9 months ago
2006
Springer
Recently, stability-based techniques have emerged as a very promising solution to the problem of cluster validation. An inherent drawback of these approaches is the computational c...