Sciweavers

3823 search results - page 546 / 765
» Experiments with Random Projection
Sort
View
117
Voted
NIPS
2004
15 years 4 months ago
Worst-Case Analysis of Selective Sampling for Linear-Threshold Algorithms
We provide a worst-case analysis of selective sampling algorithms for learning linear threshold functions. The algorithms considered in this paper are Perceptron-like algorithms, ...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...
NIPS
2004
15 years 4 months ago
Common-Frame Model for Object Recognition
A generative probabilistic model for objects in images is presented. An object consists of a constellation of features. Feature appearance and pose are modeled probabilistically. ...
Pierre Moreels, Pietro Perona
NIPS
2001
15 years 4 months ago
Model-Free Least-Squares Policy Iteration
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...
Michail G. Lagoudakis, Ronald Parr
NIPS
2001
15 years 4 months ago
The Intelligent surfer: Probabilistic Combination of Link and Content Information in PageRank
The PageRank algorithm, used in the Google search engine, greatly improves the results of Web search by taking into account the link structure of the Web. PageRank assigns to a pa...
Matthew Richardson, Pedro Domingos
SODA
2004
ACM
110views Algorithms» more  SODA 2004»
15 years 4 months ago
Probabilistic analysis of knapsack core algorithms
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
René Beier, Berthold Vöcking