Sciweavers

4926 search results - page 8 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
CVPR
2008
IEEE
14 years 2 months ago
Global data association for multi-object tracking using network flows
We propose a network flow based optimization method for data association needed for multiple object tracking. The maximum-a-posteriori (MAP) data association problem is mapped in...
Li Zhang, Yuan Li, Ramakant Nevatia
ICS
1993
Tsinghua U.
13 years 11 months ago
Graph Contraction for Physical Optimization Methods: A Quality-Cost Tradeoff for Mapping Data on Parallel Computers
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
Nashat Mansour, Ravi Ponnusamy, Alok N. Choudhary,...
LICS
2005
IEEE
14 years 1 months ago
Model-Checking Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Markus Lohrey
ECCV
2010
Springer
14 years 26 days ago
Reweighted Random Walks for Graph Matching
Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching al...
Minsu Cho (Seoul National University), Jungmin Lee...
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan