Sciweavers

458 search results - page 64 / 92
» Distance graphs: from random geometric graphs to Bernoulli g...
Sort
View
ICRA
2002
IEEE
92views Robotics» more  ICRA 2002»
14 years 1 months ago
Resolution Complete Rapidly-Exploring Random Trees
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
Peng Cheng, Steven M. LaValle
ECCV
2002
Springer
14 years 10 months ago
Factorial Markov Random Fields
In this paper we propose an extension to the standard Markov Random Field (MRF) model in order to handle layers. Our extension, which we call a Factorial MRF (FMRF), is analogous t...
Junhwan Kim, Ramin Zabih
ICML
2006
IEEE
14 years 9 months ago
A new approach to data driven clustering
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
Arik Azran, Zoubin Ghahramani
ICDAR
2009
IEEE
14 years 3 months ago
2D CAD Data Mining Based on Spatial Relation
In this research, we propose CAD data mining technique to obtain semantic elements without prior knowledge about plans being designed. Our method consists of two steps. The first ...
Hiroaki Kizu, Junko Yamamoto, Takeshi Takeda, Keij...
ICDM
2005
IEEE
165views Data Mining» more  ICDM 2005»
14 years 2 months ago
Orthogonal Neighborhood Preserving Projections
— Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the ...
Effrosini Kokiopoulou, Yousef Saad