Sciweavers

291 search results - page 51 / 59
» The Convergence of Contrastive Divergences
Sort
View
3DIM
2003
IEEE
15 years 9 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
NIPS
2007
15 years 7 months ago
The Price of Bandit Information for Online Optimization
In the online linear optimization problem, a learner must choose, in each round, a decision from a set D ⊂ Rn in order to minimize an (unknown and changing) linear cost function...
Varsha Dani, Thomas P. Hayes, Sham Kakade
JSAC
2006
96views more  JSAC 2006»
15 years 6 months ago
Price-based distributed algorithms for rate-reliability tradeoff in network utility maximization
Abstract--The current framework of network utility maximization for rate allocation and its price-based algorithms assumes that each link provides a fixed-size transmission "p...
Jang-Won Lee, Mung Chiang, A. Robert Calderbank
ML
2002
ACM
167views Machine Learning» more  ML 2002»
15 years 5 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...
BIOINFORMATICS
2011
15 years 1 months ago
Inverse perturbation for optimal intervention in gene regulatory networks
Motivation: Analysis and intervention in the dynamics of gene regulatory networks is at the heart of emerging efforts in the development of modern treatment of numerous ailments i...
Nidhal Bouaynaya, Roman Shterenberg, Dan Schonfeld