721 search results - page 24 / 145 » Almost universal graphs |
70
Voted
GBRPR
2007
Springer
15 years 7 months ago
2007
Springer
D Images at Multiple Abstraction Levels Rodrigo Moreno∗, Miguel Angel Garcia∗∗ and Domenec Puig∗ (∗)Intelligent Robotics and Computer Vision Group, Rovira i Virgili Unive...
214
Voted
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching al...
99
Voted
JGT
2010
14 years 11 months ago
2010
While finite cop-win finite graphs possess a good structural characterization, none is known for infinite cop-win graphs. As evidence that such a characterization might not exis...
70
Voted
RECOMB
2003
Springer
16 years 1 months ago
2003
Springer
We study a design and optimization problem that occurs, for example, when single nucleotide polymorphisms (SNPs) are to be genotyped using a universal DNA tag array. The problem o...
127
Voted
INFOCOM
2012
IEEE
13 years 3 months ago
2012
IEEE
—Recently, the existence of considerable amount of redundancy in the Internet traffic has stimulated the deployment of several redundancy elimination techniques within the netwo...