Sciweavers

521 search results - page 48 / 105
» Sparse probabilistic classifiers
Sort
View
MLG
2007
Springer
14 years 1 months ago
Inferring Vertex Properties from Topology in Large Networks
: Network topology not only tells about tightly-connected “communities,” but also gives cues on more subtle properties of the vertices. We introduce a simple probabilistic late...
Janne Sinkkonen, Janne Aukia, Samuel Kaski
ICRA
2003
IEEE
119views Robotics» more  ICRA 2003»
14 years 28 days ago
HPRM: a hierarchical PRM
— We introduce a hierarchical variant of the probabilistic roadmap method for motion planning. By recursively refining an initially sparse sampling in neighborhoods of the C-obs...
Anne D. Collins, Pankaj K. Agarwal, John Harer
AAAI
2000
13 years 9 months ago
Unsupervised Learning and Interactive Jazz/Blues Improvisation
We present a new domain for unsupervised learning: automatically customizing the computer to a specific melodic performer by merely listening to them improvise. We also describe B...
Belinda Thom
IJRR
2010
132views more  IJRR 2010»
13 years 4 months ago
LQR-trees: Feedback Motion Planning via Sums-of-Squares Verification
Advances in the direct computation of Lyapunov functions using convex optimization make it possible to efficiently evaluate regions of attraction for smooth nonlinear systems. Her...
Russ Tedrake, Ian R. Manchester, Mark Tobenkin, Jo...
IJCAI
2003
13 years 9 months ago
Semi-Supervised Learning with Explicit Misclassification Modeling
This paper investigates a new approach for training discriminant classifiers when only a small set of labeled data is available together with a large set of unlabeled data. This a...
Massih-Reza Amini, Patrick Gallinari