Sciweavers

81 search results - page 12 / 17
» Trading computing power with ReGTime
Sort
View
SIGGRAPH
2010
ACM
13 years 12 months ago
Star-contours for efficient hierarchical self-collision detection
Collision detection is a problem that has often been addressed efficiently with the use of hierarchical culling data structures. In the subproblem of self-collision detection for ...
Sara C. Schvartzman, Álvaro G. Pérez, Miguel A. ...
SEC
2001
13 years 9 months ago
Communication-Efficient Group Key Agreement
Abstract Traditionally, research in secure group key agreement focuses on minimizing the computational overhead for cryptographic operations, and minimizing the communication overh...
Yongdae Kim, Adrian Perrig, Gene Tsudik
DCC
2007
IEEE
14 years 7 months ago
Multiple-Description Coding by Dithered Delta-Sigma Quantization
We address the connection between the multiple-description (MD) problem and Delta-Sigma quantization. The inherent redundancy due to oversampling in Delta-Sigma quantization, and ...
Jan Østergaard, Ram Zamir
SC
2003
ACM
14 years 1 months ago
SCALLOP: A Highly Scalable Parallel Poisson Solver in Three Dimensions
SCALLOP is a highly scalable solver and library for elliptic partial differential equations on regular block-structured domains. SCALLOP avoids high communication overheads algor...
Gregory T. Balls, Scott B. Baden, Phillip Colella
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
14 years 21 days ago
Automated market-making in the large: the gates hillman prediction market
We designed and built the Gates Hillman Prediction Market (GHPM) to predict the opening day of the Gates and Hillman Centers, the new computer science buildings at Carnegie Mellon...
Abraham Othman, Tuomas Sandholm