Sciweavers

152 search results - page 20 / 31
» Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use
Sort
View
79
Voted
ICDCS
2007
IEEE
15 years 6 months ago
Combating Double-Spending Using Cooperative P2P Systems
An electronic cash system allows users to withdraw coins, represented as bit strings, from a bank or broker, and spend those coins anonymously at participating merchants, so that ...
Ivan Osipkov, Eugene Y. Vasserman, Nicholas Hopper...
ENTCS
2008
85views more  ENTCS 2008»
15 years 16 days ago
Connectivity Properties of Dimension Level Sets
This paper initiates the study of sets in Euclidean space Rn (n 2) that are defined in terms of the dimensions of their elements. Specifically, given an interval I [0, 1], we ar...
Jack H. Lutz, Klaus Weihrauch
FOCS
2006
IEEE
15 years 6 months ago
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
Xiaoming Sun, Andrew Chi-Chih Yao
FOCS
2007
IEEE
15 years 6 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
90
Voted
ICDAR
2009
IEEE
15 years 7 months ago
An RDF-Based Blackboard Architecture for Improving Table Analysis
Table analysis is a complex problem, involving searching solutions from a large search space. Studies show that finding the most credible answers to complex problems often requir...
Vanessa Long