Sciweavers

2031 search results - page 394 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
CSB
2005
IEEE
137views Bioinformatics» more  CSB 2005»
14 years 3 months ago
A Learned Comparative Expression Measure for Affymetrix GeneChip DNA Microarrays
Perhaps the most common question that a microarray study can ask is, “Between two given biological conditions, which genes exhibit changed expression levels?” Existing methods...
Will Sheffler, Eli Upfal, John Sedivy, William Sta...
FOCS
2005
IEEE
14 years 3 months ago
Truthful and Near-Optimal Mechanism Design via Linear Programming
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
Ron Lavi, Chaitanya Swamy
IPPS
2005
IEEE
14 years 3 months ago
Self-Adaptive Scheduler Parameterization via Online Simulation
High-end parallel systems present a tremendous research challenge on how to best allocate their resources to match dynamic workload characteristics and user habits that are often ...
Barry Lawson, Evgenia Smirni
RTAS
2005
IEEE
14 years 3 months ago
Bounding Worst-Case Data Cache Behavior by Analytically Deriving Cache Reference Patterns
While caches have become invaluable for higher-end architectures due to their ability to hide, in part, the gap between processor speed and memory access times, caches (and partic...
Harini Ramaprasad, Frank Mueller
ANCS
2005
ACM
14 years 3 months ago
Framework for supporting multi-service edge packet processing on network processors
Network edge packet-processing systems, as are commonly implemented on network processor platforms, are increasingly required to support a rich set of services. These multi-servic...
Arun Raghunath, Aaron R. Kunze, Erik J. Johnson, V...