87 search results - page 8 / 18 » Limits of dense graph sequences |
114
click to vote
ICIP
2008
IEEE
15 years 11 months ago
2008
IEEE
Graph cuts have proven to be powerful tools in image segmentation. Previous graph cut research has proposed methods for cutting across large graphs constructed from multiple layer...
STACS
2005
Springer
15 years 3 months ago
2005
Springer
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...
118
click to vote
GD
1998
Springer
15 years 1 months ago
1998
Springer
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
102
click to vote
BMCBI
2005
14 years 9 months ago
2005
Background: Several problems exist with current methods used to align DNA sequences for comparative sequence analysis. Most dynamic programming algorithms assume that conserved se...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
We propose in this paper a robust multi-resolution technique to estimate dense velocity field from image sequences. It couples a Gaussian pyramidal down-sampling decomposition to...