2412 search results - page 206 / 483 » Which Problems Have Strongly Exponential Complexity |
141
Voted
DIALM
2010
ACM
15 years 1 months ago
2010
ACM
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
121
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
We introduce a new theoretical derivation, evaluation methods, and extensive empirical analysis for an automatic query expansion framework in which model estimation is cast as a r...
133
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
117
Voted
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
: We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic q...
127
Voted
TIT
2002
15 years 3 months ago
2002
The problem of optimal sequential decision for individual sequences, relative to a class of competing o -line reference strategies, is studied for general loss functions with memo...