Sciweavers

5536 search results - page 1019 / 1108
» Programming Languages for Distributed Applications
Sort
View
BMCBI
2010
132views more  BMCBI 2010»
13 years 10 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...
CN
1999
100views more  CN 1999»
13 years 10 months ago
Testing protocols modeled as FSMs with timing parameters
An optimization method is introduced for generating minimum-length test sequences taking into account timing constraints for FSM models of communication protocols. Due to active t...
M. Ümit Uyar, Mariusz A. Fecko, Adarshpal S. ...
PPOPP
2009
ACM
14 years 10 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
SAS
2009
Springer
162views Formal Methods» more  SAS 2009»
14 years 10 months ago
Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
Polyhedra: An Abstract Domain to Infer Interval Linear Relationships Liqian Chen1,2 , Antoine Min?e2,3 , Ji Wang1 , and Patrick Cousot2,4 1 National Laboratory for Parallel and Dis...
Antoine Miné, Ji Wang, Liqian Chen, Patrick...
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
14 years 10 months ago
A multinomial clustering model for fast simulation of computer architecture designs
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
Kaushal Sanghai, Ting Su, Jennifer G. Dy, David R....
« Prev « First page 1019 / 1108 Last » Next »