Sciweavers

137 search results - page 15 / 28
» On the number of local minima for the multidimensional assig...
Sort
View
ICIP
1995
IEEE
13 years 11 months ago
A harmonic retrieval framework for discontinuous motion estimation
Abstract— Motion discontinuities arise when there are occlusions or multiple moving objects in the scene that is imaged. Conventional regularization techniques use smoothness con...
Wei-Ge Chen, Georgios B. Giannakis, N. Nandhakumar
CVPR
2011
IEEE
13 years 3 months ago
Discrete-Continuous Optimization for Large-scale Structure from Motion
Recent work in structure from motion (SfM) has successfully built 3D models from large unstructured collections of images downloaded from the Internet. Most approaches use increme...
David Crandall, Andrew Owens, Noah Snavely, Daniel...
PVM
2004
Springer
14 years 1 months ago
Neighborhood Composition: A Parallelization of Local Search Algorithms
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Mas...
IPPS
1998
IEEE
13 years 12 months ago
Fault-Tolerant Message Routing for Multiprocessors
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
Lev Zakrevski, Mark G. Karpovsky
AAAI
1996
13 years 9 months ago
A Graph-Based Method for Improving GSAT
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
Kalev Kask, Rina Dechter