Sciweavers

591 search results - page 39 / 119
» An Efficient Algorithm for Local Distance Metric Learning
Sort
View
FPGA
2008
ACM
174views FPGA» more  FPGA 2008»
14 years 11 months ago
Pattern-based behavior synthesis for FPGA resource reduction
Pattern-based synthesis has drawn wide interest from researchers who tried to utilize the regularity in applications for design optimizations. In this paper we present a general p...
Jason Cong, Wei Jiang
TWC
2008
155views more  TWC 2008»
14 years 9 months ago
Distributed sensor network localization using SOCP relaxation
The goal of the sensor network localization problem is to determine positions of all sensor nodes in a network given certain pairwise noisy distance measurements and some anchor no...
Seshan Srirangarajan, Ahmed H. Tewfik, Zhi-Quan Lu...
IJCAI
1997
14 years 11 months ago
Learning Topological Maps with Weak Local Odometric Information
cal maps provide a useful abstraction for robotic navigation and planning. Although stochastic mapscan theoreticallybe learned using the Baum-Welch algorithm,without strong prior ...
Hagit Shatkay, Leslie Pack Kaelbling
NIPS
2004
14 years 11 months ago
Neighbourhood Components Analysis
In this paper we propose a novel method for learning a Mahalanobis distance measure to be used in the KNN classification algorithm. The algorithm directly maximizes a stochastic v...
Jacob Goldberger, Sam T. Roweis, Geoffrey E. Hinto...
AUSAI
2006
Springer
15 years 1 months ago
Learning Hybrid Bayesian Networks by MML
Abstract. We use a Markov Chain Monte Carlo (MCMC) MML algorithm to learn hybrid Bayesian networks from observational data. Hybrid networks represent local structure, using conditi...
Rodney T. O'Donnell, Lloyd Allison, Kevin B. Korb