2899 search results - page 81 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
205
click to vote
ICDT
2009
ACM
16 years 2 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...
107
click to vote
CLUSTER
2008
IEEE
15 years 8 months ago
2008
IEEE
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
Sampling conditions for recovering the homology of a set using topological persistence are much weaker than sampling conditions required by any known algorithm for producing a top...
126
click to vote
ATAL
2007
Springer
15 years 7 months ago
2007
Springer
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...