Sciweavers

909 search results - page 26 / 182
» Performance Evaluation of the VF Graph Matching Algorithm
Sort
View
IJCV
2002
148views more  IJCV 2002»
15 years 28 days ago
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
Stereo matching is one of the most active research areas in computer vision. While a large number of algorithms for stereo correspondence have been developed, relatively little wo...
Daniel Scharstein, Richard Szeliski
ASPLOS
1992
ACM
15 years 5 months ago
Design and Evaluation of a Compiler Algorithm for Prefetching
Software-controlled data prefetching is a promising technique for improving the performance of the memory subsystem to match today's high-performance processors. While prefet...
Todd C. Mowry, Monica S. Lam, Anoop Gupta
HPCC
2005
Springer
15 years 6 months ago
High Performance Subgraph Mining in Molecular Compounds
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
Giuseppe Di Fatta, Michael R. Berthold
SODA
1998
ACM
144views Algorithms» more  SODA 1998»
15 years 2 months ago
Analysis of Random Processes via And-Or Tree Evaluation
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
CVPR
2007
IEEE
16 years 3 months ago
Feasibility Boundary in Dense and Semi-Dense Stereo Matching
In stereo literature, there is no standard method for evaluating algorithms for semi-dense stereo matching. Moreover, existing evaluations for dense methods require a fixed parame...
Jan Cech, Jana Kostlivá, Radim Sára