Sciweavers

5606 search results - page 383 / 1122
» Randomization Techniques for Graphs.
Sort
View
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
15 years 6 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
165
Voted
CVPR
2004
IEEE
16 years 8 months ago
Segment-Based Stereo Matching Using Graph Cuts
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
Li Hong, George Chen
ICCV
2007
IEEE
16 years 8 months ago
Optimization Algorithms for Labeling Brain Sulci Based on Graph Matching
Graph matching techniques are widely used in pattern recognition problems such as scene description, finger print identification, or face recognition. In this paper, we put forwar...
Faguo Yang, Frithjof Kruggel
CSMR
2006
IEEE
16 years 22 days ago
Dynamic Object Process Graphs
A trace is a record of the execution of a computer program, showing the sequence of operations executed. A trace may be obtained through static or dynamic analysis. An object trac...
Jochen Quante, Rainer Koschke
EMMCVPR
2005
Springer
16 years 6 days ago
Retrieving Articulated 3-D Models Using Medial Surfaces and Their Graph Spectra
We consider the use of medial surfaces to represent symmetries of cts. This allows for a qualitative abstraction based on a directed acyclic graph of components and also a degree o...
Juan Zhang, Kaleem Siddiqi, Diego Macrini, Ali Sho...