Sciweavers

356 search results - page 34 / 72
» Robust and efficient algorithms for rank join evaluation
Sort
View
ICML
2000
IEEE
15 years 10 months ago
Eligibility Traces for Off-Policy Policy Evaluation
Eligibility traces have been shown to speed reinforcement learning, to make it more robust to hidden states, and to provide a link between Monte Carlo and temporal-difference meth...
Doina Precup, Richard S. Sutton, Satinder P. Singh
GECCO
2009
Springer
137views Optimization» more  GECCO 2009»
15 years 1 months ago
Efficient natural evolution strategies
Efficient Natural Evolution Strategies (eNES) is a novel alternative to conventional evolutionary algorithms, using the natural gradient to adapt the mutation distribution. Unlike...
Yi Sun, Daan Wierstra, Tom Schaul, Jürgen Sch...
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
14 years 7 months ago
Efficient two-sided error-tolerant search
We consider fast two-sided error-tolerant search that is robust against errors both on the query side (type alogrithm, find documents with algorithm) as well as on the document si...
Hannah Bast, Marjan Celikik
KDD
2006
ACM
123views Data Mining» more  KDD 2006»
15 years 10 months ago
Mining rank-correlated sets of numerical attributes
We study the mining of interesting patterns in the presence of numerical attributes. Instead of the usual discretization methods, we propose the use of rank based measures to scor...
Toon Calders, Bart Goethals, Szymon Jaroszewicz
CVPR
2006
IEEE
15 years 11 months ago
Shape Topics: A Compact Representation and New Algorithms for 3D Partial Shape Retrieval
This paper develops an efficient new method for 3D partial shape retrieval. First, a Monte Carlo sampling strategy is employed to extract local shape signatures from each 3D model...
Yi Liu, Hongbin Zha, Hong Qin