Sciweavers

7303 search results - page 1215 / 1461
» Optimality for dynamic patterns
Sort
View
170
Voted
SIGMOD
1993
ACM
163views Database» more  SIGMOD 1993»
15 years 7 months ago
The LRU-K Page Replacement Algorithm For Database Disk Buffering
This paper introduces a new approach to database disk buffering, called the LRU–K method. The basic idea of LRU–K is to keep track of the times of the last K references to pop...
Elizabeth J. O'Neil, Patrick E. O'Neil, Gerhard We...
151
Voted
CGO
2009
IEEE
15 years 7 months ago
Communication-Sensitive Static Dataflow for Parallel Message Passing Applications
Message passing is a very popular style of parallel programming, used in a wide variety of applications and supported by many APIs, such as BSD sockets, MPI and PVM. Its importance...
Greg Bronevetsky
166
Voted
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 7 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
243
Voted
BIBE
2004
IEEE
160views Bioinformatics» more  BIBE 2004»
15 years 7 months ago
A Time Series Analysis of Microarray Data
As the capture and analysis of single-time-point microarray expression data becomes routine, investigators are turning to time-series expression data to investigate complex gene r...
Selnur Erdal, Ozgur Ozturk, David L. Armbruster, H...
145
Voted
CC
2006
Springer
124views System Software» more  CC 2006»
15 years 7 months ago
Polyhedral Code Generation in the Real World
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...
Nicolas Vasilache, Cédric Bastoul, Albert C...
« Prev « First page 1215 / 1461 Last » Next »