Sciweavers

3154 search results - page 44 / 631
» Computing Closed Skycubes
Sort
View
GCC
2003
Springer
14 years 2 months ago
Grid Computing for the Masses: An Overview
Abstract. The common goals of the Grid and peer-to-peer communities have brought them in close proximity. Both the technologies overlay a collaborative resource-sharing infrastruct...
Kaizar Amin, Gregor von Laszewski, Armin R. Mikler
CRYPTO
2001
Springer
144views Cryptology» more  CRYPTO 2001»
14 years 1 months ago
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
In this paper we show that any two-party functionality can be securely computed in a constant number of rounds, where security is obtained against malicious adversaries that may ar...
Yehuda Lindell
IWVF
2001
Springer
14 years 1 months ago
Computational Surface Flattening: A Voxel-Based Approach
ÐA voxel-based method for flattening a surface in 3D space into 2D while best preserving distances is presented. Triangulation or polyhedral approximation of the voxel data are no...
Ruth Grossmann, Nahum Kiryati, Ron Kimmel
UAI
2001
13 years 10 months ago
Iterative Markov Chain Monte Carlo Computation of Reference Priors and Minimax Risk
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
John D. Lafferty, Larry A. Wasserman
IANDC
2010
67views more  IANDC 2010»
13 years 7 months ago
Parameterized computational complexity of Dodgson and Young elections
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...
Nadja Betzler, Jiong Guo, Rolf Niedermeier