Sciweavers

1391 search results - page 112 / 279
» Complexity Limitations on Quantum Computation
Sort
View
ICANNGA
2009
Springer
145views Algorithms» more  ICANNGA 2009»
14 years 2 months ago
Supporting Scalable Bayesian Networks Using Configurable Discretizer Actuators
We propose a generalized model with configurable discretizer actuators as a solution to the problem of the discretization of massive numerical datasets. Our solution is based on a ...
Isaac Olusegun Osunmakinde, Antoine B. Bagula
MFCS
2009
Springer
14 years 2 months ago
Synthesis for Structure Rewriting Systems
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...
Lukasz Kaiser
RT
1999
Springer
14 years 5 days ago
Decoupling Polygon Rendering from Geometry using Rasterization Hardware
The dramatically increasing size of polygonal models resulting from 3D scanning devices and advanced modeling techniques requires new approaches to reduce the load of geometry tran...
Rüdiger Westermann, Ove Sommer, Thomas Ertl
CORR
2008
Springer
166views Education» more  CORR 2008»
13 years 8 months ago
Information-Theoretically Secure Voting Without an Honest Majority
We present three voting protocols with unconditional privacy and information-theoretic correctness, without assuming any bound on the number of corrupt voters or voting authorities...
Anne Broadbent, Alain Tapp
PVM
2010
Springer
13 years 5 months ago
Efficient MPI Support for Advanced Hybrid Programming Models
The number of multithreaded Message Passing Interface (MPI) implementations and applications is increasing rapidly. We discuss how multithreaded applications can receive messages o...
Torsten Hoefler, Greg Bronevetsky, Brian Barrett, ...