Sciweavers

866 search results - page 108 / 174
» Algorithms for Comparing Pedigree Graphs
Sort
View
ICALP
2007
Springer
14 years 3 months ago
Low Distortion Spanners
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
Seth Pettie
SYNASC
2006
IEEE
106views Algorithms» more  SYNASC 2006»
14 years 3 months ago
A Quality Measure for Multi-Level Community Structure
Mining relational data often boils down to computing clusters, that is finding sub-communities of data elements forming cohesive sub-units, while being well separated from one an...
Maylis Delest, Jean-Marc Fedou, Guy Melanço...
IWCMC
2006
ACM
14 years 3 months ago
Performance of Taroko: a cluster-based addressing and routing scheme for self-organized networks
Self-Organized Networks (SONs) are a general description of autonomous networks without infrastructure, of which Ad Hoc, Sensor and Mesh networks are special cases. We had previou...
Julien Ridoux, Meriem Kassar, Mathias Boc, Anne Fl...
ICCAD
2003
IEEE
193views Hardware» more  ICCAD 2003»
14 years 2 months ago
FROSTY: A Fast Hierarchy Extractor for Industrial CMOS Circuits
: This paper presents FROSTY, a computer program for automatically extracting the hierarchy of a large-scale digital CMOS circuit from its transistor-level netlist description and ...
Lei Yang, C.-J. Richard Shi
ICCAD
1999
IEEE
125views Hardware» more  ICCAD 1999»
14 years 1 months ago
Direct synthesis of timed asynchronous circuits
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
Sung Tae Jung, Chris J. Myers