Sciweavers

4302 search results - page 324 / 861
» Index Pairs Algorithms
Sort
View
STOC
1994
ACM
125views Algorithms» more  STOC 1994»
15 years 8 months ago
A spectral technique for coloring random 3-colorable graphs (preliminary version)
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
Noga Alon, Nabil Kahale
LATA
2010
Springer
16 years 2 months ago
The Inclusion Problem for Regular Expressions
This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automat...
Dag Hovland
TIP
2008
99views more  TIP 2008»
15 years 4 months ago
Using Spanning Graphs for Efficient Image Registration
We provide a detailed analysis of the use of minimal spanning graphs as an alignment method for registering multimodal images. This yields an efficient graph theoretic algorithm th...
Mert R. Sabuncu, Peter J. Ramadge
142
Voted
EOR
2002
125views more  EOR 2002»
15 years 4 months ago
Genetic local search for multi-objective combinatorial optimization
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
Andrzej Jaszkiewicz
153
Voted
ICASSP
2011
IEEE
14 years 8 months ago
Joint disparity and optical flow by correspondence growing
The scene flow in binocular stereo setup is estimated using a seed growing algorithm. A pair of calibrated and synchronized cameras observe a scene and output a sequence of image...
Jan Cech, Radu Horaud