Sciweavers

1024 search results - page 65 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
IJCGA
2010
155views more  IJCGA 2010»
14 years 8 months ago
Competitive Complexity of Mobile Robot on-Line Motion Planning Problems
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
Yoav Gabriely, Elon Rimon
JSAC
2010
131views more  JSAC 2010»
14 years 8 months ago
Joint synchronization and localization using TOAs: A linearization based WLS solution
—Joint synchronization and localization using time of arrival (TOA) measurements is a very important research topic for many wireless ad hoc sensor network applications. For such...
Shouhong Zhu, Zhiguo Ding
MFCS
2010
Springer
14 years 8 months ago
Solving minones-2-sat as Fast as vertex cover
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
Neeldhara Misra, N. S. Narayanaswamy, Venkatesh Ra...
CDC
2010
IEEE
167views Control Systems» more  CDC 2010»
14 years 4 months ago
Numerical methods for the optimization of nonlinear stochastic delay systems, and an application to internet regulation
The Markov chain approximation method is an effective and widely used approach for computing optimal values and controls for stochastic systems. It was extended to nonlinear (and p...
Harold J. Kushner
PAMI
2011
14 years 4 months ago
Rigid and Articulated Point Registration with Expectation Conditional Maximization
—This paper addresses the issue of matching rigid and articulated shapes through probabilistic point registration. The problem is recast into a missing data framework where unkno...
Radu Horaud, Florence Forbes, Manuel Yguel, Guilla...