Sciweavers

591 search results - page 35 / 119
» An Efficient Algorithm for Local Distance Metric Learning
Sort
View
ICML
2005
IEEE
15 years 10 months ago
A theoretical analysis of Model-Based Interval Estimation
Several algorithms for learning near-optimal policies in Markov Decision Processes have been analyzed and proven efficient. Empirical results have suggested that Model-based Inter...
Alexander L. Strehl, Michael L. Littman
TELSYS
2002
73views more  TELSYS 2002»
14 years 9 months ago
Avoiding Counting to Infinity in Distance Vector Routing
The Routing Information Protocol (RIP) may introduce misleading routing information into the routing table, due to network topology changes such as link or router failures. This is...
Andreas Schmid, Christoph Steigner
62
Voted
PIMRC
2008
IEEE
15 years 4 months ago
A distributed extended information filter for Self-Localization in Sensor Networks
—In this paper the Self-Localization problem for Sensor Networks is addressed. Given a set of nodes deployed in an environment, self-localization consists of finding out the loc...
Andrea Gasparri, Federica Pascucci, Giovanni Ulivi
BMCBI
2011
14 years 1 months ago
Clustering gene expression data with a penalized graph-based metric
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
Ariel E. Bayá, Pablo M. Granitto
CSB
2004
IEEE
149views Bioinformatics» more  CSB 2004»
15 years 1 months ago
Weighting Features to Recognize 3D Patterns of Electron Density in X-Ray Protein Crystallography
Feature selection and weighting are central problems in pattern recognition and instance-based learning. In this work, we discuss the challenges of constructing and weighting feat...
Kreshna Gopal, Tod D. Romo, James C. Sacchettini, ...