Sciweavers

510 search results - page 27 / 102
» Sparse probabilistic projections
Sort
View
CVPR
2011
IEEE
13 years 4 months ago
Global Stereo Matching Leveraged by Sparse Ground Control Points
We present a novel global stereo model that makes use of constraints from points with known depths, i.e., the Ground Control Points (GCPs) as referred to in stereo literature. Our...
Liang Wang, Ruigang Yang
ICRA
2010
IEEE
127views Robotics» more  ICRA 2010»
13 years 7 months ago
Probabilistically complete planning with end-effector pose constraints
Abstract— We present a proof for the probabilistic completeness of RRT-based algorithms when planning with constraints on end-effector pose. Pose constraints can induce lowerdime...
Dmitry Berenson, Siddhartha S. Srinivasa
ICPR
2004
IEEE
14 years 9 months ago
A Hierarchical Projection Pursuit Clustering Algorithm
We define a cluster to be characterized by regions of high density separated by regions that are sparse. By observing the downward closure property of density, the search for inte...
Alexei D. Miasnikov, Jayson E. Rome, Robert M. Har...
DGO
2004
112views Education» more  DGO 2004»
13 years 10 months ago
Exploration and Exploitation: Knowledge Sharing in Digital Government Projects
This paper examines knowledge sharing processes in digital government projects (DGPs). Although knowledge sharing processes are a central feature of the functioning of government,...
Maria Christina Binz-Scharf
ICML
2009
IEEE
14 years 9 months ago
Efficient Euclidean projections in linear time
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...
Jun Liu, Jieping Ye