Sciweavers

90 search results - page 6 / 18
» Detecting interleaving
Sort
View
NIPS
2007
15 years 17 days ago
Nearest-Neighbor-Based Active Learning for Rare Category Detection
Rare category detection is an open challenge for active learning, especially in the de-novo case (no labeled examples), but of significant practical importance for data mining - ...
Jingrui He, Jaime G. Carbonell
RV
2010
Springer
152views Hardware» more  RV 2010»
14 years 9 months ago
Efficient Data Race Detection for Async-Finish Parallelism
One of the major productivity hurdles for parallel programming is non-determinism -- a parallel program may yield different results on different executions with the same input, dep...
Raghavan Raman, Jisheng Zhao, Vivek Sarkar, Martin...
CIKM
2011
Springer
13 years 11 months ago
A probabilistic method for inferring preferences from clicks
Evaluating rankers using implicit feedback, such as clicks on documents in a result list, is an increasingly popular alternative to traditional evaluation methods based on explici...
Katja Hofmann, Shimon Whiteson, Maarten de Rijke
PPOPP
2009
ACM
15 years 11 months ago
Detecting and tolerating asymmetric races
Because data races represent a hard-to-manage class of errors in concurrent programs, numerous approaches to detect them have been proposed and evaluated. We specifically consider...
Paruj Ratanaworabhan, Martin Burtscher, Darko Kiro...
ISCA
2008
IEEE
139views Hardware» more  ISCA 2008»
15 years 5 months ago
Atom-Aid: Detecting and Surviving Atomicity Violations
Writing shared-memory parallel programs is error-prone. Among the concurrency errors that programmers often face are atomicity violations, which are especially challenging. They h...
Brandon Lucia, Joseph Devietti, Karin Strauss, Lui...