613 search results - page 25 / 123 » Query Evaluation on a Database Given by a Random Graph |
157
click to vote
ICDT
2011
ACM
14 years 5 months ago
2011
ACM
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...
107
Voted
VLDB
1990
ACM
15 years 6 months ago
1990
ACM
In applications such as vision and molecular biology, a common problem is to find the similar objects to a given target (according to some distance measure) in a large database. T...
209
click to vote
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
161
click to vote
ESA
2007
Springer
15 years 8 months ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
128
click to vote
ALENEX
2003
15 years 3 months ago
2003
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...