1391 search results - page 232 / 279 » Complexity Limitations on Quantum Computation |
115
Voted
KDD
2004
ACM
16 years 4 months ago
2004
ACM
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
123
Voted
SIGMOD
2001
ACM
16 years 3 months ago
2001
ACM
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
134
Voted
ALGOSENSORS
2007
Springer
15 years 9 months ago
2007
Springer
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
152
Voted
GW
1999
Springer
15 years 7 months ago
1999
Springer
Following the ecological approach to visual perception, this paper presents a framework that emphasizes the role of vision on referring actions. In particular, affordances are util...
129
Voted
LATIN
1998
Springer
15 years 7 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...