Results 1  10
of
46,583
A Fast Quantum Mechanical Algorithm for Database Search
 ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
, 1996
"... Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a supe ..."
Abstract

Cited by 1135 (10 self)
 Add to MetaCart
Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a
Publickey cryptosystems based on composite degree residuosity classes
 IN ADVANCES IN CRYPTOLOGY — EUROCRYPT 1999
, 1999
"... This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to publickey cryptography. We propose a new trapdoor mechanism and derive from this technique three encryption schemes: a trapdoor permutation and two homomorphic probabilist ..."
Abstract

Cited by 1009 (4 self)
 Add to MetaCart
This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to publickey cryptography. We propose a new trapdoor mechanism and derive from this technique three encryption schemes: a trapdoor permutation and two homomorphic
Practical network support for IP traceback
, 2000
"... This paper describes a technique for tracing anonymous packet flooding attacks in the Internet back towards their source. This work is motivated by the increased frequency and sophistication of denialofservice attacks and by the difficulty in tracing packets with incorrect, or “spoofed”, source ad ..."
Abstract

Cited by 678 (13 self)
 Add to MetaCart
addresses. In this paper we describe a general purpose traceback mechanism based on probabilistic packet marking in the network. Our approach allows a victim to identify the network path(s) traversed by attack traffic without requiring interactive operational support from Internet Service Providers (ISPs
Quantum complexity theory
 in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM
, 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract

Cited by 574 (5 self)
 Add to MetaCart
be implemented and introduce some new, purely quantum mechanical primitives, such as changing the computational basis and carrying out an arbitrary unitary transformation of polynomially bounded dimension. We also consider the precision to which the transition amplitudes of a quantum Turing machine need
A SocialWelfare Optimal Probabilistic Mechanism for
, 2012
"... We provide an optimal probabilistic mechanism for maximizing social welfare in singlegood auctions when each player does not know his true valuation for the good, but only a set of valuations that is guaranteed to include his true one. 1 ..."
Abstract
 Add to MetaCart
We provide an optimal probabilistic mechanism for maximizing social welfare in singlegood auctions when each player does not know his true valuation for the good, but only a set of valuations that is guaranteed to include his true one. 1
Threedimensional object recognition from single twodimensional images
 Artificial Intelligence
, 1987
"... A computer vision system has been implemented that can recognize threedimensional objects from unknown viewpoints in single grayscale images. Unlike most other approaches, the recognition is accomplished without any attempt to reconstruct depth information bottomup from the visual input. Instead, ..."
Abstract

Cited by 484 (7 self)
 Add to MetaCart
, three other mechanisms are used that can bridge the gap between the twodimensional image and knowledge of threedimensional objects. First, a process of perceptual organization is used to form groupings and structures in the image that are likely to be invariant over a wide range of viewpoints. Second
Quantum mechanics helps in searching for a needle in a haystack
, 1997
"... Quantum mechanics can speed up a range of search applications over unsorted data. For example imagine a phone directory containing N names arranged in completely random order. To find someone's phone number with a probability of 50 % , any classical algorithm (whether deterministic or probabili ..."
Abstract

Cited by 434 (10 self)
 Add to MetaCart
or probabilistic) will need to access the database a minimum of 0.5N times. Quantum mechanical systems can be in a superposition of states and simultaneously examine multiple names. By properly adjusting the phases of various operations, successful computations reinforce each other while others interfere randomly
Probabilistic mechanics of selfane cracks in paper sheets
"... Crack mechanics in singlenotched sheets of paper is analysed by an approach that combines the concept of virtual crack trajectory ensemble with selfane crack mechanics formalism. The crack initiation criterion is determined for three kinds of paper. The probability distributions of crack roughness ..."
Abstract
 Add to MetaCart
Crack mechanics in singlenotched sheets of paper is analysed by an approach that combines the concept of virtual crack trajectory ensemble with selfane crack mechanics formalism. The crack initiation criterion is determined for three kinds of paper. The probability distributions of crack
An elementfree Galerkin method for probabilistic mechanics and reliability
, 2001
"... A stochastic elementfree Galerkin method was developed for reliability analysis of linearelastic structures with spatially varying random material properties. A random field representing material properties was discretized into a set of random variables with statistical properties obtained from th ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
the statistical properties of random field. In conjunction with meshless formulations, the firstorder reliability method was employed to predict the full probabilistic characteristics of a structural response. Unlike the stochastic finite element method, the stochastic meshfree method does not require a
PROFES PROBABILISITC FINITE ELEMENT SYSTEM BRINGING PROBABILISTIC MECHANICS TO THE DESKTOP
"... ProFES is a probabilistic finite element analysis system that allows designers to perform probabilistic finite element analysis in a 3D graphical environment that is completely familiar and similar to modern deterministic FEA. ProFES is built on an innovative datadriven software architecture that s ..."
Abstract
 Add to MetaCart
that seamlessly integrates stateoftheart probabilistic mechanics techniques with commercial CAD and CAE software to make it practical and feasible to execute probabilistic analysis of complex structural components. This capability allows engineers to use powerful probabilistic techniques to solve challenging
Results 1  10
of
46,583