477 search results - page 21 / 96 » Complexity Considerations, cSAT Problem Lower Bound |
110
click to vote
APAL
2004
15 years 1 months ago
2004
The model-checking problem for a logic L on a class C of structures asks whether a given L-sentence holds in a given structure in C. In this paper, we give super-exponential lower...
126
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
108
click to vote
VLDB
1997
ACM
15 years 5 months ago
1997
ACM
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
100
click to vote
FOCS
2005
IEEE
15 years 7 months ago
2005
IEEE
We consider the problem of storing a large file on a remote and unreliable server. To verify that the file has not been corrupted, a user could store a small private (randomized...
103
click to vote
PKDD
2010
Springer
14 years 11 months ago
2010
Springer
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...