496 search results - page 50 / 100 » Machine models and lower bounds for query processing |
109
click to vote
WDAG
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
COLT
1992
Springer
15 years 1 months ago
1992
Springer
We consider learning in situations where the function used to classify examples may switch back and forth between a small number of different concepts during the course of learnin...
108
click to vote
CORR
2010
Springer
14 years 4 months ago
2010
Springer
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
VLDB
1997
ACM
15 years 1 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...
COMPLEX
2009
Springer
15 years 1 months ago
2009
Springer
The causal states of computational mechanics define the minimal sufficient (prescient) memory for a given stationary stochastic process. They induce the -machine which is a hidden...