Sciweavers

1949 search results - page 226 / 390
» Random graphs on surfaces
Sort
View
ICALP
2004
Springer
15 years 11 months ago
Simple Permutations Mix Well
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
Shlomo Hoory, Avner Magen, Steven Myers, Charles R...
167
Voted
SIGCOMM
2006
ACM
16 years 12 hour ago
Systematic topology analysis and generation using degree correlations
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
Priya Mahadevan, Dmitri V. Krioukov, Kevin R. Fall...
MICCAI
2004
Springer
16 years 7 months ago
Automatic Heart Peripheral Vessels Segmentation Based on a Normal MIP Ray Casting Technique
This paper introduces a new technique to detect the coronary arteries as well as other heart's peripheral vessels. After finding the location of the myocardium through a graph...
Charles Florin, Romain Moreau-Gobard, James Willia...
JCDCG
2000
Springer
15 years 9 months ago
Volume Queries in Polyhedra
We present a simple and practical data structure for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron, determine the volume...
John Iacono, Stefan Langerman
WEA
2009
Springer
139views Algorithms» more  WEA 2009»
16 years 25 days ago
Fast Algorithm for Graph Isomorphism Testing
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
José Luis López-Presa, Antonio Fern&...