Sciweavers

454 search results - page 75 / 91
» An EDSL approach to high performance Haskell programming
Sort
View
TLDI
2009
ACM
155views Formal Methods» more  TLDI 2009»
15 years 7 months ago
Opis: reliable distributed systems in OCaml
The importance of distributed systems is growing as computing devices become ubiquitous and bandwidth becomes plentiful. Concurrency and distribution pose algorithmic and implemen...
Pierre-Évariste Dagand, Dejan Kostic, Vikto...
BMCBI
2010
164views more  BMCBI 2010»
14 years 7 months ago
Merged consensus clustering to assess and improve class discovery with microarray data
Background: One of the most commonly performed tasks when analysing high throughput gene expression data is to use clustering methods to classify the data into groups. There are a...
T. Ian Simpson, J. Douglas Armstrong, Andrew P. Ja...
AOSD
2005
ACM
15 years 4 months ago
An expressive aspect language for system applications with Arachne
C applications, in particular those using operating system level services, frequently comprise multiple crosscutting concerns: network protocols and security are typical examples ...
Rémi Douence, Thomas Fritz, Nicolas Loriant...
CPM
2006
Springer
95views Combinatorics» more  CPM 2006»
15 years 2 months ago
New Bounds for Motif Finding in Strong Instances
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
Brona Brejová, Daniel G. Brown, Ian M. Harr...
91
Voted
FPL
2008
Springer
178views Hardware» more  FPL 2008»
14 years 12 months ago
High-speed regular expression matching engine using multi-character NFA
An approach is presented for high throughput matching of regular expressions (regexes) by first converting them into corresponding Non-deterministic Finite Automata (NFAs) which a...
Norio Yamagaki, Reetinder P. S. Sidhu, Satoshi Kam...