Sciweavers

7839 search results - page 1287 / 1568
» What's there and what's not
Sort
View
PPOPP
2009
ACM
16 years 2 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...
PODC
2009
ACM
16 years 2 months ago
Load balancing without regret in the bulletin board model
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
Éva Tardos, Georgios Piliouras, Robert D. K...
117
Voted
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
16 years 2 months ago
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...
Yehuda Lindell, Hila Zarosim
122
Voted
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
16 years 2 months ago
Efficiently learning the accuracy of labeling sources for selective sampling
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider
100
Voted
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 2 months ago
Characteristic relational patterns
Research in relational data mining has two major directions: finding global models of a relational database and the discovery of local relational patterns within a database. While...
Arne Koopman, Arno Siebes
« Prev « First page 1287 / 1568 Last » Next »