Sciweavers

1060 search results - page 124 / 212
» On the Discovery of Random Trees
Sort
View
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 7 months ago
Maximum Entropy Rate of Markov Sources for Systems With Non-regular Constraints
Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained sy...
Georg Böcherer, Valdemar Cardoso da Rocha Jr....
CVPR
2007
IEEE
16 years 9 months ago
Learning Visual Similarity Measures for Comparing Never Seen Objects
In this paper we propose and evaluate an algorithm that learns a similarity measure for comparing never seen objects. The measure is learned from pairs of training images labeled ...
Eric Nowak, Frédéric Jurie
ECCV
2008
Springer
16 years 8 months ago
Keypoint Signatures for Fast Learning and Recognition
Abstract. Statistical learning techniques have been used to dramatically speed-up keypoint matching by training a classifier to recognize a specific set of keypoints. However, the ...
Michael Calonder, Vincent Lepetit, Pascal Fua
ICAS
2009
IEEE
139views Robotics» more  ICAS 2009»
16 years 1 months ago
Predicting Web Server Crashes: A Case Study in Comparing Prediction Algorithms
Abstract—Traditionally, performance has been the most important metrics when evaluating a system. However, in the last decades industry and academia have been paying increasing a...
Javier Alonso, Jordi Torres, Ricard Gavaldà
ICRA
2009
IEEE
169views Robotics» more  ICRA 2009»
16 years 1 months ago
Manipulation planning with Workspace Goal Regions
— We present an approach to path planning for manipulators that uses Workspace Goal Regions (WGRs) to specify goal end-effector poses. Instead of specifying a discrete set of goa...
Dmitry Berenson, Siddhartha S. Srinivasa, Dave Fer...