Sciweavers

9 search results - page 2 / 2
» Enumerating Rooted Graphs with Reflectional Block Structures
Sort
View
BMCBI
2010
189views more  BMCBI 2010»
13 years 7 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...
ICCAD
2008
IEEE
150views Hardware» more  ICCAD 2008»
14 years 4 months ago
Performance estimation and slack matching for pipelined asynchronous architectures with choice
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
Gennette Gill, Vishal Gupta, Montek Singh
OWLED
2008
13 years 8 months ago
Representing Product Designs Using a Description Graph Extension to OWL 2
Product development requires the ability to check design consistency, to verify design properties, and to answer questions about a design's possible implementations. These tas...
Henson Graves
CORR
2004
Springer
113views Education» more  CORR 2004»
13 years 7 months ago
Pattern Reification as the Basis for Description-Driven Systems
One of the main factors driving object-oriented software development for information systems is the requirement for systems to be tolerant to change. To address this issue in desig...
Florida Estrella, Zsolt Kovacs, Jean-Marie Le Goff...