1391 search results - page 232 / 279 » Complexity Limitations on Quantum Computation |
KDD
2004
ACM
14 years 8 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 ...
SIGMOD
2001
ACM
14 years 8 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...
ALGOSENSORS
2007
Springer
14 years 2 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...
GW
1999
Springer
14 years 16 days 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...
LATIN
1998
Springer
14 years 15 days 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...