Sciweavers

828 search results - page 38 / 166
» Simplicial Powers of Graphs
Sort
View
MICCAI
2009
Springer
14 years 6 months ago
Multiple Sclerosis Lesion Segmentation Using an Automatic Multimodal Graph Cuts
Abstract. Graph Cuts have been shown as a powerful interactive segmentation technique in several medical domains. We propose to automate the Graph Cuts in order to automatically se...
Daniel García-Lorenzo, Jérémy...
JGAA
2007
135views more  JGAA 2007»
13 years 8 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
SIPS
2006
IEEE
14 years 2 months ago
Configuration and Representation of Large-Scale Dataflow Graphs using the Dataflow Interchange Format
—A wide variety of DSP design tools have been developed that incorporate dataflow graph representations into their GUI-based design environments. However, as the complexity of ap...
Ivan Corretjer, Chia-Jui Hsu, Shuvra S. Bhattachar...
COMBINATORICS
1998
79views more  COMBINATORICS 1998»
13 years 8 months ago
A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for ap...
Ljiljana Brankovic, Mirka Miller, Ján Plesn...
APCSAC
2003
IEEE
14 years 1 months ago
Mapping Applications to a Coarse Grain Reconfigurable System
This paper introduces a method which can be used to map applications written in a high level source language program, like C, to a coarse grain reconfigurable architecture, MONTIU...
Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Mi...