Sciweavers

3690 search results - page 179 / 738
» Computation with classical sequents
Sort
View
97
Voted
CIKM
2004
Springer
15 years 6 months ago
Processing search queries in a distributed environment
Endeca’s approach to processing search queries in a distributed computing environment is predicated on concerns of correctness, scalability, and flexibility in deployment. Using...
Frederick Knabe, Daniel Tunkelang
100
Voted
EUROCRYPT
2001
Springer
15 years 5 months ago
How to Convert the Flavor of a Quantum Bit Commitment
In this paper we show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealin...
Claude Crépeau, Frédéric L&ea...
110
Voted
HOA
1993
15 years 4 months ago
Theory Interpretation in Simple Type Theory
Theory interpretation is a logical technique for relating one axiomatic theory to another with important applications in mathematics and computer science as well as in logic itself...
William M. Farmer
74
Voted
BIRTHDAY
2010
Springer
15 years 1 months ago
Three Paths to Effectiveness
Over the past two decades, Gurevich and his colleagues have developed axiomatic foundations for the notion of algorithm, be it classical, interactive, or parallel, and formalized t...
Udi Boker, Nachum Dershowitz
ICASSP
2010
IEEE
15 years 24 days ago
Distance-based discretization of parametric signal manifolds
The characterization of signals and images in manifolds often lead to efficient dimensionality reduction algorithms based on manifold distance computation for analysis or classi...
Elif Vural, Pascal Frossard