2612 search results - page 199 / 523 » Assemblies as Graph Processes |
170
click to vote
SODA
2010
ACM
15 years 5 months ago
2010
ACM
We consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a ran...
175
click to vote
ICIP
2006
IEEE
16 years 8 months ago
2006
IEEE
A novel procedure for in-silico (virtual) craniofacial reconstruction of human mandibles with multiple fractures from a sequence of Computed Tomography (CT) images is presented. T...
169
click to vote
ICIAP
2003
ACM
16 years 6 months ago
2003
ACM
Segmentation of 3D human body is a very challenging problem in applications exploiting human scan data. To tackle this problem, this paper proposes a topological approach based on...
199
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
146
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Let G = (V, E) be an undirected loopless graph with possible parallel edges and s, t V . Assume that s is labelled at the initial time step and that every labelled vertex copies i...