Sciweavers

2219 search results - page 1 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
PAMI
2011
12 years 11 months ago
Dynamic Programming and Graph Algorithms in Computer Vision
Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization ...
Pedro F. Felzenszwalb, Ramin Zabih
MVA
1998
230views Computer Vision» more  MVA 1998»
13 years 5 months ago
An Efficient Matching Algorithm for Segment-Based Stereo Vision Using Dynamic Programming Technique
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
Toshio Ueshiba, Yoshihiro Kawai, Yasushi Sumi, Fum...
ICPR
2006
IEEE
14 years 5 months ago
An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...
Hiroaki Sakoe, Seiichi Uchida, Wenjie Cai
IJICT
2007
143views more  IJICT 2007»
13 years 4 months ago
A parallel algorithm for dynamic slicing of distributed Java programs in non-DSM systems
We propose a parallel algorithm for dynamic slicing of distributed Java programs. Given a distributed Java program, we first construct an intermediate representation in the form o...
Durga Prasad Mohapatra, Rajib Mall, Rajeev Kumar
PLDI
2004
ACM
13 years 9 months ago
Cost effective dynamic program slicing
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...
Xiangyu Zhang, Rajiv Gupta