2576 search results - page 149 / 516 » The Complexity of Zero Knowledge |
141
Voted
SODA
1993
ACM
15 years 6 months ago
1993
ACM
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...
119
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
151
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
This paper presents a hierarchical Bayesian model to reconstruct sparse images when the observations are obtained from linear transformations and corrupted by an additive white Gau...
137
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
129
Voted
CCE
2007
15 years 5 months ago
2007
The understanding of the dynamic behavior of distillation columns has received considerable attention due to the fact that distillation is one of the most widely used unit operati...