4926 search results - page 149 / 986 » Two Graph Algorithms On an Associative Computing Model |
146
click to vote
JEA
2008
15 years 4 months ago
2008
As more and more genomes are sequenced, evolutionary biologists are becoming increasingly interested in evolution at the level of whole genomes, in scenarios in which the genome e...
145
click to vote
ICIP
1998
IEEE
16 years 6 months ago
1998
IEEE
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...
128
click to vote
GD
2008
Springer
15 years 6 months ago
2008
Springer
We introduce a new force-directed model for computing graph layout. The model bridges the two more popular force directed approaches – the stress and the electrical-spring models...
147
click to vote
WAW
2004
Springer
15 years 10 months ago
2004
Springer
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
141
click to vote
ICCV
2007
IEEE
16 years 7 months ago
2007
IEEE
We propose a novel generative language for shape that is based on the shock graph: given a shock graph topology, we explore constraints on the geometry and dynamics of the shock g...