Sciweavers

14121 search results - page 69 / 2825
» Interval Computations in Computer Vision
Sort
View
NETWORKS
2010
13 years 8 months ago
Mixed search number and linear-width of interval and split graphs
We show that the mixed search number and the linear-width of interval graphs and of split graphs can be computed in linear time and in polynomial time, respectively.
Fedor V. Fomin, Pinar Heggernes, Rodica Mihai
CVPR
1997
IEEE
15 years 3 days ago
Recognizing Objects by Matching Oriented Points
Andrew Edie Johnson, Martial Hebert