Sciweavers

688 search results - page 106 / 138
» Comparison of Conceptual Graphs
Sort
View
LATIN
2004
Springer
15 years 3 months ago
Embracing the Giant Component
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
IPPS
2002
IEEE
15 years 2 months ago
A Recursion-Based Broadcast Paradigm in Wormhole Routed Mesh/Torus Networks
: A novel broadcast technique for wormhole-routed mesh and torus parallel computers based on recursion is presented in this paper. It works by partitioning the graph into several s...
Xiaotong Zhuang, Vincenzo Liberatore
98
Voted
MICCAI
2009
Springer
15 years 2 months ago
Bayesian Maximal Paths for Coronary Artery Segmentation from 3D CT Angiograms
We propose a recursive Bayesian model for the delineation of coronary arteries from 3D CT angiograms (cardiac CTA) and discuss the use of discrete minimal path techniques as an eļ¬...
David Lesage, Elsa D. Angelini, Isabelle Bloch, Ga...
ICCD
2000
IEEE
120views Hardware» more  ICCD 2000»
15 years 2 months ago
Equivalence Checking Combining a Structural SAT-Solver, BDDs, and Simulation
This paper presents a verification technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight...
Viresh Paruthi, Andreas Kuehlmann
107
Voted
BIBM
2008
IEEE
106views Bioinformatics» more  BIBM 2008»
14 years 11 months ago
Uncovering Genomic Reassortments among Influenza Strains by Enumerating Maximal Bicliques
The evolutionary histories of viral genomes have received significant recent attention due to their importance in understanding virulence and the corresponding ramifications to pu...
Niranjan Nagarajan, Carl Kingsford