650 search results - page 29 / 130 » Positive graphs |
ICIP
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we present a local graph matching based method for tracking cells and cell divisions in noisy images. We work with plant cells, where the cells are tightly clustere...
89
Voted
TRECVID
2008
14 years 11 months ago
2008
We studied a method using support vector machines (SVMs) with walk-based graph kernels for the high-level feature extraction (HLF) task. In this method, each image is first segmen...
SIAMDM
2010
14 years 8 months ago
2010
Let s < t be two fixed positive integers. We study what are the minimum degree conditions for a bipartite graph G, with both color classes of size n = k(s + t), which ensure t...
SODA
1993
ACM
14 years 11 months ago
1993
ACM
We consider the performance of a simple greedy matching algorithm MINGREEDY when applied to random cubic graphs. We show that if λn is the expected number of vertices not matched...
110
click to vote
WAW
2010
Springer
14 years 7 months ago
2010
Springer
We give an improved algorithm for computing personalized PageRank vectors with tight error bounds which can be as small as (n-p ) for any fixed positive integer p. The improved Pag...