Results 1  10
of
8,190
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
–117]. This construction is substantially more complicated than the corresponding construction for classical Turing machines (TMs); in fact, even simple primitives such as looping, branching, and composition are not straightforward in the context of quantum Turing machines. We establish how these familiar primitives can
Action recognition in the premotor cortex
 Brain
, 1996
"... We recorded electrical activity from 532 neurons in the rostral part of inferior area 6 (area F5) of two macaque monkeys. Previous data had shown that neurons of this area discharge during goaldirected hand and mouth movements. We describe here the properties of a newly discovered set of F5 neurons ..."
Abstract

Cited by 671 (47 self)
 Add to MetaCart
neurons (92%) there was a clear relation between the visual action they responded to and the motor response they coded. In30 % of mirror neurons the congruence was very strict and the effective observed and executed actions corresponded both in terms of general action (e.g. grasping) and in terms
Iterative point matching for registration of freeform curves and surfaces
, 1994
"... A heuristic method has been developed for registering two sets of 3D curves obtained by using an edgebased stereo system, or two dense 3D maps obtained by using a correlationbased stereo system. Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in ma ..."
Abstract

Cited by 660 (8 self)
 Add to MetaCart
, in many practical applications, some a priori knowledge exists which considerably simplifies the problem. In visual navigation, for example, the motion between successive positions is usually approximately known. From this initial estimate, our algorithm computes observer motion with very good precision
An Efficient Solution to the FivePoint Relative Pose Problem
, 2004
"... An efficient algorithmic solution to the classical fivepoint relative pose problem is presented. The problem is to find the possible solutions for relative camera pose between two calibrated views given five corresponding points. The algorithm consists of computing the coefficients of a tenth degre ..."
Abstract

Cited by 484 (13 self)
 Add to MetaCart
degree polynomial in closed form and subsequently finding its roots. It is the first algorithm well suited for numerical implementation that also corresponds to the inherent complexity of the problem. We investigate the numerical precision of the algorithm. We also study its performance under noise
A Precise Correspondence Between LiftandProject Cuts, Simple Disjunctive Cuts
 Mathematical Programming B
, 2003
"... Abstract We establish a precise correspondence between liftandproject cuts for mixed 01 programs, simple disjunctive cuts (intersection cuts) and mixedinteger Gomory cuts. The correspondence maps members of one family onto members of the others. It also maps bases of the higherdimensional cut g ..."
Abstract

Cited by 36 (6 self)
 Add to MetaCart
Abstract We establish a precise correspondence between liftandproject cuts for mixed 01 programs, simple disjunctive cuts (intersection cuts) and mixedinteger Gomory cuts. The correspondence maps members of one family onto members of the others. It also maps bases of the higherdimensional cut
Anti de Sitter space and holography
, 1998
"... Recently, it has been proposed by Maldacena that large N limits of certain conformal field theories in d dimensions can be described in terms of supergravity (and string theory) on the product of d+1dimensional AdS space with a compact manifold. Here we elaborate on this idea and propose a precise ..."
Abstract

Cited by 383 (7 self)
 Add to MetaCart
Recently, it has been proposed by Maldacena that large N limits of certain conformal field theories in d dimensions can be described in terms of supergravity (and string theory) on the product of d+1dimensional AdS space with a compact manifold. Here we elaborate on this idea and propose a precise
Black Hole Entropy Function, Attractors and Precision Counting of Microstates
, 2007
"... In these lecture notes we describe recent progress in our understanding of attractor mechanism and entropy of extremal black holes based on the entropy function formalism. We also describe precise computation of the microscopic degeneracy of a class of quarter BPS dyons in N = 4 supersymmetric strin ..."
Abstract

Cited by 324 (28 self)
 Add to MetaCart
In these lecture notes we describe recent progress in our understanding of attractor mechanism and entropy of extremal black holes based on the entropy function formalism. We also describe precise computation of the microscopic degeneracy of a class of quarter BPS dyons in N = 4 supersymmetric
Blobworld: A System for RegionBased Image Indexing and Retrieval
 In Third International Conference on Visual Information Systems
, 1999
"... . Blobworld is a system for image retrieval based on finding coherent image regions which roughly correspond to objects. Each image is automatically segmented into regions ("blobs") with associated color and texture descriptors. Querying is based on the attributes of one or two regions of ..."
Abstract

Cited by 375 (4 self)
 Add to MetaCart
. Blobworld is a system for image retrieval based on finding coherent image regions which roughly correspond to objects. Each image is automatically segmented into regions ("blobs") with associated color and texture descriptors. Querying is based on the attributes of one or two regions
Evaluating Interval Forecasts
 International Economic Review
, 1997
"... This paper is intended to address the deficiency by clearly defining what is meant by a "good" interval forecast, and describing how to test if a given interval forecast deserves the label "good". One of the motivations of Engle's (1982) classic paper was to form dynamic int ..."
Abstract

Cited by 364 (11 self)
 Add to MetaCart
fails to account for higherorder dynamics may be correct on average (have correct unconditional coverage), but in any given period it will have incorrect conditional coverage characterized by clustered outliers. These concepts will be defined precisely below, and tests for correct conditional coverage
Retrieving Collocations from Text: Xtract
 Computational Linguistics
, 1993
"... Natural languages are full of collocations, recurrent combinations of words that cooccur more often than expected by chance and that correspond to arbitrary word usages. Recent work in lexicography indicates that collocations are pervasive in English; apparently, they are common in all types of wri ..."
Abstract

Cited by 353 (1 self)
 Add to MetaCart
Natural languages are full of collocations, recurrent combinations of words that cooccur more often than expected by chance and that correspond to arbitrary word usages. Recent work in lexicography indicates that collocations are pervasive in English; apparently, they are common in all types
Results 1  10
of
8,190