1677 search results - page 325 / 336 » On the Completeness of Quantum Computation Models |
91
Voted
PKC
2009
Springer
16 years 6 days ago
2009
Springer
We explore the security of blind signatures under aborts where the user or the signer may stop the interactive signature issue protocol prematurely. Several works on blind signatur...
STOC
2004
ACM
15 years 12 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
100
click to vote
ISPASS
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract—We generate and provide miniature synthetic benchmark clones for modern workloads to solve two pre-silicon design challenges, namely: 1) huge simulation time (weeks to m...
IROS
2009
IEEE
15 years 6 months ago
2009
IEEE
— The problem of accurate 6-DoF pose estimation of 3D objects based on their shape has so far been solved only for specific object geometries. Edge-based recognition and trackin...
145
click to vote
WADS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...