Sciweavers

338 search results - page 18 / 68
» Perfect simulation from the Quicksort limit distribution
Sort
View
HPDC
2005
IEEE
14 years 2 months ago
Generosity and gluttony in GEMS: grid enabled molecular simulations
Biomolecular simulations produce more output data than can be managed effectively by traditional computing systems. Researchers need distributed systems that allow the pooling of...
Justin M. Wozniak, Paul Brenner, Douglas Thain, Aa...
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
13 years 9 months ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger
HPCA
2008
IEEE
14 years 8 months ago
Gaining insights into multicore cache partitioning: Bridging the gap between simulation and real systems
Cache partitioning and sharing is critical to the effective utilization of multicore processors. However, almost all existing studies have been evaluated by simulation that often ...
Jiang Lin, Qingda Lu, Xiaoning Ding, Zhao Zhang, X...
LREC
2010
173views Education» more  LREC 2010»
13 years 10 months ago
Transcriber Driving Strategies for Transcription Aid System
Speech recognition technology suffers from a lack of robustness which limits its usability for fully automated speech-to-text transcription, and manual correction is generally req...
Grégory Senay, Georges Linares, Benjamin Le...
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
13 years 3 months ago
A distributed Newton method for Network Utility Maximization
Most existing work uses dual decomposition and subgradient methods to solve Network Utility Maximization (NUM) problems in a distributed manner, which suffer from slow rate of con...
Ermin Wei, Asuman E. Ozdaglar, Ali Jadbabaie