3368 search results - page 12 / 674 » The Complexity of Query Reliability |
SSDBM
2007
IEEE
14 years 1 months ago
2007
IEEE
High energy physics scientists analyze large amounts of data looking for interesting events when particles collide. These analyses are easily expressed using complex queries that ...
ALT
2002
Springer
14 years 4 months ago
2002
Springer
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...
SODA
2000
ACM
13 years 8 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...