Sciweavers

1450 search results - page 279 / 290
» On the Complexity of Hardness Amplification
Sort
View
MIR
2010
ACM
207views Multimedia» more  MIR 2010»
13 years 6 months ago
Learning to rank for content-based image retrieval
In Content-based Image Retrieval (CBIR), accurately ranking the returned images is of paramount importance, since users consider mostly the topmost results. The typical ranking st...
Fabio F. Faria, Adriano Veloso, Humberto Mossri de...
OOPSLA
2010
Springer
13 years 6 months ago
Cross-language, type-safe, and transparent object sharing for co-located managed runtimes
As software becomes increasingly complex and difficult to analyze, it is more and more common for developers to use high-level, type-safe, object-oriented (OO) programming langua...
Michal Wegiel, Chandra Krintz
OOPSLA
2010
Springer
13 years 6 months ago
An input-centric paradigm for program dynamic optimizations
Accurately predicting program behaviors (e.g., locality, dependency, method calling frequency) is fundamental for program optimizations and runtime adaptations. Despite decades of...
Kai Tian, Yunlian Jiang, Eddy Z. Zhang, Xipeng She...
PVLDB
2010
158views more  PVLDB 2010»
13 years 6 months ago
MEET DB2: Automated Database Migration Evaluation
Commercial databases compete for market share, which is composed of not only net-new sales to those purchasing a database for the first time, but also competitive “win-backs”...
Reynold Xin, Patrick Dantressangle, Sam Lightstone...
SAT
2010
Springer
165views Hardware» more  SAT 2010»
13 years 6 months ago
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
Lukas Kroc, Ashish Sabharwal, Bart Selman