Sciweavers

2520 search results - page 57 / 504
» The complexity of approximating entropy
Sort
View
COLT
2003
Springer
15 years 3 months ago
Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
Shie Mannor, John N. Tsitsiklis
DATE
1999
IEEE
101views Hardware» more  DATE 1999»
15 years 2 months ago
Polynomial Methods for Allocating Complex Components
Methods for performing component matching by expressing an arithmetic specification and a bit-level description of an implementation as word-level polynomials have been demonstrat...
James Smith, Giovanni De Micheli
GRAPHICSINTERFACE
1997
14 years 11 months ago
Multiresolution Rendering of Complex Botanical Scenes
This paper presents a system for rendering very large collections of randomly parameterized plants while generating manageable scene geometries for rendering. A given botanical de...
Dana Marshall, Donald S. Fussell, A. T. Campbell I...
ENTCS
2008
91views more  ENTCS 2008»
14 years 10 months ago
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
Prashant Batra
ICDM
2003
IEEE
134views Data Mining» more  ICDM 2003»
15 years 3 months ago
Probabilistic User Behavior Models
We present a mixture model based approach for learning individualized behavior models for the Web users. We investigate the use of maximum entropy and Markov mixture models for ge...
Eren Manavoglu, Dmitry Pavlov, C. Lee Giles