3341 search results - page 330 / 669 » On Bounded Queries and Approximation |
178
click to vote
ICALP
2004
Springer
16 years 4 days ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
188
click to vote
DBISP2P
2003
Springer
16 years 1 hour ago
2003
Springer
In this paper we give a robust logical and computational characterisation of peer-to-peer (p2p) database systems. We first define a precise model-theoretic semantics of a p2p sys...
162
click to vote
DLOG
2007
15 years 9 months ago
2007
We now know that the addition of a concept constructor called a Path Functional Dependency (PFD) to the Boolean-complete description logic DLF leads to undecidability of ABox consi...
164
click to vote
PODS
2004
ACM
16 years 6 months ago
2004
ACM
The problem of disk declustering is to distribute data among multiple disks to reduce query response times through parallel I/O. A strictly optimal declustering technique is one t...
220
Voted
SIGMOD
2001
ACM
16 years 7 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....