Sciweavers

2219 search results - page 353 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
132
Voted
AICCSA
2007
IEEE
124views Hardware» more  AICCSA 2007»
15 years 9 months ago
The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
Faisal N. Abu-Khzam, Nagiza F. Samatova, Mohamad A...
127
Voted
ECCV
2006
Springer
15 years 6 months ago
Tracking of Multiple Objects Using Optical Flow Based Multiscale Elastic Matching
Abstract. A novel hybrid region-based and contour-based multiple object tracking model using optical flow based elastic matching is proposed. The proposed elastic matching model is...
Xingzhi Luo, Suchendra M. Bhandarkar
ICASSP
2011
IEEE
14 years 6 months ago
Median filter with absolute value norm spatial regularization
We provide a novel formulation for computing median filter with spatial regularization as minimizing a cost function composed of absolute value norms. We turn this cost minimizat...
Nilanjan Ray
CCCG
2003
15 years 3 months ago
Network Design Subject to Facility Location
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
Laxmi Gewali, Joy Bhadury, Ramaswamy Chandrasekara...
92
Voted
IPPS
2006
IEEE
15 years 8 months ago
Tree-based overlay networks for scalable applications
The increasing availability of high-performance computing systems with thousands, tens of thousands, and even hundreds of thousands of computational nodes is driving the demand fo...
Dorian C. Arnold, G. D. Pack, Barton P. Miller