Sciweavers

2027 search results - page 156 / 406
» When is it best to best-respond
Sort
View
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
16 years 1 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
PPOPP
2010
ACM
15 years 10 months ago
Scheduling support for transactional memory contention management
Transactional Memory (TM) is considered as one of the most promising paradigms for developing concurrent applications. TM has been shown to scale well on multiple cores when the d...
Walther Maldonado, Patrick Marlier, Pascal Felber,...
ISBRA
2009
Springer
15 years 8 months ago
Imputation-Based Local Ancestry Inference in Admixed Populations
Abstract. Accurate inference of local ancestry from whole-genome genetic variation data is critical for understanding the history of admixed human populations and detecting SNPs as...
Bogdan Pasaniuc, Justin Kennedy, Ion I. Mandoiu
FOCS
2009
IEEE
15 years 8 months ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans
IPPS
2009
IEEE
15 years 8 months ago
Phaser accumulators: A new reduction construct for dynamic parallelism
A reduction is a computation in which a common operation, such as a sum, is to be performed across multiple pieces of data, each supplied by a separate task. We introduce phaser a...
Jun Shirako, David M. Peixotto, Vivek Sarkar, Will...