Sciweavers

463 search results - page 80 / 93
» The Most Reliable Subgraph Problem
Sort
View
POPL
2010
ACM
14 years 4 months ago
Automatically Generating Instruction Selectors Using Declarative Machine Descriptions
Despite years of work on retargetable compilers, creating a good, reliable back end for an optimizing compiler still entails a lot of hard work. Moreover, a critical component of ...
João Dias, Norman Ramsey
SYSTOR
2009
ACM
14 years 1 months ago
DHIS: discriminating hierarchical storage
A typical storage hierarchy comprises of components with varying performance and cost characteristics, providing multiple options for data placement. We propose and evaluate a hie...
Chaitanya Yalamanchili, Kiron Vijayasankar, Erez Z...
ICCV
2001
IEEE
14 years 9 months ago
The Variable Bandwidth Mean Shift and Data-Driven Scale Selection
We present two solutions for the scale selection problem in computer vision. The rst one is completely nonparametric and is based on the the adaptive estimation of the normalized ...
Dorin Comaniciu, Visvanathan Ramesh, Peter Meer
STOC
2001
ACM
104views Algorithms» more  STOC 2001»
14 years 7 months ago
Spatial gossip and resource location protocols
The dynamic behavior of a network in which information is changing continuously over time requires robust and efficient mechanisms for keeping nodes updated about new information. ...
David Kempe, Jon M. Kleinberg, Alan J. Demers
IPPS
2006
IEEE
14 years 1 months ago
Techniques and tools for dynamic optimization
Traditional code optimizers have produced significant performance improvements over the past forty years. While promising avenues of research still exist, traditional static and p...
Jason Hiser, Naveen Kumar, Min Zhao, Shukang Zhou,...