Sciweavers

16188 search results - page 20 / 3238
» The Optimal PAC Algorithm
Sort
View
ICML
2006
IEEE
14 years 8 months ago
Experience-efficient learning in associative bandit problems
We formalize the associative bandit problem framework introduced by Kaelbling as a learning-theory problem. The learning environment is modeled as a k-armed bandit where arm payof...
Alexander L. Strehl, Chris Mesterharm, Michael L. ...
CPHYSICS
2006
95views more  CPHYSICS 2006»
13 years 7 months ago
Multibillion-atom molecular dynamics simulation: Design considerations for vector-parallel processing
Progress in adapting molecular dynamics algorithms for systems with short-range interactions to utilize the features of modern supercomputers is described. Efficient utilization o...
D. C. Rapaport
CVGIP
2006
121views more  CVGIP 2006»
13 years 7 months ago
Tetrahedral and hexahedral invertible finite elements
We review an algorithm for the finite element simulation of elastoplastic solids which is capable of robustly and efficiently handling arbitrarily large deformation. In fact, the ...
Geoffrey Irving, Joseph Teran, Ronald Fedkiw
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
13 years 11 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
DBPL
2007
Springer
101views Database» more  DBPL 2007»
13 years 11 months ago
Efficient Inclusion for a Class of XML Types with Interleaving and Counting
Inclusion between XML types is important but expensive, and is much more expensive when unordered types are considered. We prove here that inclusion for XML types with interleavin...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani