Sciweavers

439 search results - page 75 / 88
» An Improved Analysis of Linear Mergers
Sort
View
73
Voted
BMCBI
2005
107views more  BMCBI 2005»
14 years 11 months ago
Identifying differential expression in multiple SAGE libraries: an overdispersed log-linear model approach
Background: In testing for differential gene expression involving multiple serial analysis of gene expression (SAGE) libraries, it is critical to account for both between and with...
Jun Lu, John K. Tomfohr, Thomas B. Kepler
SAS
2009
Springer
281views Formal Methods» more  SAS 2009»
15 years 11 months ago
A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination
The Java programming language requires that out-of-bounds array accesses produce runtime exceptions. In general, this requires a dynamic bounds check each time an array element is...
David Niedzielski, Jeffery von Ronne, Andreas Gamp...
STACS
2005
Springer
15 years 4 months ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney
ASPLOS
2004
ACM
15 years 4 months ago
Formal online methods for voltage/frequency control in multiple clock domain microprocessors
Multiple Clock Domain (MCD) processors are a promising future alternative to today’s fully synchronous designs. Dynamic Voltage and Frequency Scaling (DVFS) in an MCD processor ...
Qiang Wu, Philo Juang, Margaret Martonosi, Douglas...
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
15 years 4 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen