Sciweavers

1677 search results - page 59 / 336
» On the Completeness of Quantum Computation Models
Sort
View
AFRIGRAPH
2006
ACM
15 years 7 months ago
Free-form modelling for surface inpainting
In this paper, we describe a novel approach to 3D shape modelling, targeting at the reconstruction and repair of digitised models – a task that is frequently encountered in part...
Gerhard H. Bendels, Michael Guthe, Reinhard Klein
AFRIGRAPH
2007
ACM
15 years 5 months ago
Generic computation of bulletin boards into geometric kernels
Nowadays, many commercial CAD systems are built on proprietary geometric kernels which provide an API containing a set of high level geometric operations (boolean operations, slot...
Mehdi Baba-ali, David Marcheix, Xavier Skapin, Yve...
ASIACRYPT
2000
Springer
15 years 5 months ago
Unconditionally Secure Digital Signature Schemes Admitting Transferability
A potentially serious problem with current digital signature schemes is that their underlying hard problems from number theory may be solved by an innovative technique or a new gen...
Goichiro Hanaoka, Junji Shikata, Yuliang Zheng, Hi...
CORR
2012
Springer
183views Education» more  CORR 2012»
13 years 9 months ago
Learning Determinantal Point Processes
Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among...
Alex Kulesza, Ben Taskar
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 1 months ago
Metric Structures and Probabilistic Computation
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
Wesley Calvert