2911 search results - page 327 / 583 » A Logic of Graph Constraints |
203
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
211
click to vote
FSTTCS
2009
Springer
16 years 4 days ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
193
click to vote
ICSE
2001
IEEE-ACM
15 years 12 months ago
2001
IEEE-ACM
Mocha is a model checker based on the theme of exploiting design modularity: instead of manipulating unstructured state-transition graphs, it supports the hierarchical modeling fra...
263
click to vote
PPDP
1999
Springer
15 years 11 months ago
1999
Springer
hemical abstract machine Shinya Sato Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Ian Mackie LIX, CNRS UMR 7161, ´Ecole...
207
click to vote
ICCAD
1994
IEEE
15 years 11 months ago
1994
IEEE
In this paper we present a power dissipation model considering the charging/discharging of capacitance at the gate output node as well as internal nodes, and capacitance feedthrou...