Sciweavers

273 search results - page 32 / 55
» Can Pure Cutting Plane Algorithms Work
Sort
View
PAMI
2007
169views more  PAMI 2007»
13 years 7 months ago
Estimating Optimal Parameters for MRF Stereo from a Single Image Pair
—This paper presents a novel approach for estimating the parameters for MRF-based stereo algorithms. This approach is based on a new formulation of stereo as a maximum a posterio...
Li Zhang, Steven M. Seitz
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 8 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
EDCC
2005
Springer
14 years 1 months ago
Structure-Based Resilience Metrics for Service-Oriented Networks
Many governmental agencies and businesses organizations use networked systems to provide a number of services. Such a service-oriented network can be implemented as an overlay on ...
Daniel J. Rosenkrantz, Sanjay Goel, S. S. Ravi, Ja...
TROB
2008
154views more  TROB 2008»
13 years 6 months ago
Large-Scale SLAM Building Conditionally Independent Local Maps: Application to Monocular Vision
SLAM algorithms based on local maps have been demonstrated to be well suited for mapping large environments as they reduce the computational cost and improve the consistency of the...
Pedro Pinies, Juan D. Tardós
ICRA
2008
IEEE
205views Robotics» more  ICRA 2008»
14 years 2 months ago
Minimum time point assignment for coverage by two constrained robots
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen