Sciweavers

2219 search results - page 97 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
110
Voted
CVPR
2007
IEEE
16 years 4 months ago
Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
Carl Olsson, Anders P. Eriksson, Fredrik Kahl
118
Voted
ECCV
2004
Springer
16 years 4 months ago
Synthesizing Dynamic Texture with Closed-Loop Linear Dynamic System
Dynamic texture can be defined as a temporally continuous and infinitely varying stream of images that exhibit certain temporal statistics. Linear dynamic system (LDS) represented ...
Lu Yuan, Fang Wen, Ce Liu, Heung-Yeung Shum
101
Voted
ICPR
2000
IEEE
16 years 3 months ago
Tandem Fusion of Nearest Neighbor Editing and Condensing Algorithms - Data Dimensionality Effects
In this paper, the effect of the dimensionality of data sets on the exploitation of synergy among known nearest neighbor (NN) editing and condensing tools is analyzed using a synt...
Belur V. Dasarathy, José Salvador Sá...
101
Voted
CVPR
2005
IEEE
16 years 4 months ago
Asymmetrical Occlusion Handling Using Graph Cut for Multi-View Stereo
Occlusion is usually modelled in two images symmetrically in previous stereo algorithms which cannot work for multi-view stereo efficiently. In this paper, we present a novel form...
Yichen Wei, Long Quan
ATAL
2007
Springer
15 years 6 months ago
Workflow coordination for service-oriented multiagent systems
From a multiagent viewpoint, a workflow is a dynamic set of tasks performed by a set of agents to reach a shared goal. We show herein that commitments among agents can be used to ...
Jiangbo Dang, Jingshan Huang, Michael N. Huhns