Sciweavers

6251 search results - page 184 / 1251
» Randomness, Computability, and Density
Sort
View
AP2PS
2009
IEEE
15 years 7 months ago
Algorithm-Based Fault Tolerance Applied to P2P Computing Networks
—P2P computing platforms are subject to a wide range of attacks. In this paper, we propose a generalisation of the previous disk-less checkpointing approach for fault-tolerance i...
Thomas Roche, Mathieu Cunche, Jean-Louis Roch
COMPGEOM
1994
ACM
15 years 8 months ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir
123
Voted
CORR
2010
Springer
126views Education» more  CORR 2010»
15 years 4 months ago
Extending scientific computing system with structural quantum programming capabilities
We present the basic high-level structures used for developing quantum programming languages. The presented structures are commonly used in many existing quantum programming langua...
P. Gawron, Jerzy Klamka, J. A. Miszczak, Ryszard W...
CASES
2001
ACM
15 years 7 months ago
A compiler framework for mapping applications to a coarse-grained reconfigurable computer architecture
The rapid growth of silicon densities has made it feasible to deploy reconfigurable hardware as a highly parallel computing platform. However, in most cases, the application needs...
Girish Venkataramani, Walid A. Najjar, Fadi J. Kur...
ACL
1994
15 years 5 months ago
Optimizing the Computational Lexicalization of Large Grammars
The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filteri...
Christian Jacquemin