Sciweavers

617 search results - page 17 / 124
» Patterns for decoupling data structures and algorithms
Sort
View
LISP
2008
104views more  LISP 2008»
13 years 7 months ago
Flattening tuples in an SSA intermediate representation
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
Lukasz Ziarek, Stephen Weeks, Suresh Jagannathan
MICRO
2006
IEEE
145views Hardware» more  MICRO 2006»
14 years 1 months ago
Virtually Pipelined Network Memory
We introduce virtually-pipelined memory, an architectural technique that efficiently supports high-bandwidth, uniform latency memory accesses, and high-confidence throughput eve...
Banit Agrawal, Timothy Sherwood
BMCBI
2005
151views more  BMCBI 2005»
13 years 7 months ago
stam - a Bioconductor compliant R package for structured analysis of microarray data
Background: Genome wide microarray studies have the potential to unveil novel disease entities. Clinically homogeneous groups of patients can have diverse gene expression profiles...
Claudio Lottaz, Rainer Spang
DASFAA
2010
IEEE
225views Database» more  DASFAA 2010»
13 years 7 months ago
Mining Regular Patterns in Data Streams
Discovering interesting patterns from high-speed data streams is a challenging problem in data mining. Recently, the support metric-based frequent pattern mining from data stream h...
Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed,...
ACMSE
2009
ACM
14 years 2 months ago
A hybrid approach to mining frequent sequential patterns
The mining of frequent sequential patterns has been a hot and well studied area—under the broad umbrella of research known as KDD (Knowledge Discovery and Data Mining)— for we...
Erich Allen Peterson, Peiyi Tang