Sciweavers

18204 search results - page 3406 / 3641
» Distributed Video Presentations
Sort
View
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
16 years 4 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
CCS
2009
ACM
16 years 4 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
SIGCSE
2009
ACM
135views Education» more  SIGCSE 2009»
16 years 4 months ago
Methodology for successful undergraduate recruiting in computer science at comprehensive public universities
This paper presents a methodology for increasing undergraduate Computer Science (CS) major enrollment at comprehensive public universities, particularly those that have first gene...
Patricia Morreale, Stan Kurkovsky, George Chang
PPOPP
2009
ACM
16 years 4 months ago
Idempotent work stealing
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a key component of many applications and parallelizing runtimes. Work-stealing is ...
Maged M. Michael, Martin T. Vechev, Vijay A. Saras...
PPOPP
2009
ACM
16 years 4 months ago
A comprehensive strategy for contention management in software transactional memory
In Software Transactional Memory (STM), contention management refers to the mechanisms used to ensure forward progress-to avoid livelock and starvation, and to promote throughput ...
Michael F. Spear, Luke Dalessandro, Virendra J. Ma...
« Prev « First page 3406 / 3641 Last » Next »