Sciweavers

2767 search results - page 147 / 554
» Universal Exponentiation Algorithm
Sort
View
ECCC
2010
103views more  ECCC 2010»
14 years 10 months ago
Time-Space Efficient Simulations of Quantum Computations
We give two time- and space-efficient simulations of quantum computations with intermediate measurements, one by classical randomized computations with unbounded error and the oth...
Dieter van Melkebeek, Thomas Watson
CVPR
2009
IEEE
16 years 5 months ago
Isometric Registration of Ambiguous and Partial Data
This paper introduces a new shape matching algorithm for computing correspondences between 3D surfaces that have undergone (approximately) isometric deformations. The new approach ...
Art Tevs (Max Planck Institute Informatik), Martin...
CONCUR
2008
Springer
14 years 12 months ago
Dynamic Partial Order Reduction Using Probe Sets
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
Harmen Kastenberg, Arend Rensink
ESOP
2008
Springer
14 years 12 months ago
Ranking Abstractions
Abstractions Aziem Chawdhary1 , Byron Cook2 , Sumit Gulwani2 , Mooly Sagiv3 , and Hongseok Yang1 1 Queen Mary, University of London 2 Microsoft Research 3 Tel Aviv University Abstr...
Aziem Chawdhary, Byron Cook, Sumit Gulwani, Mooly ...
151
Voted
DC
2011
13 years 10 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young