Sciweavers

1818 search results - page 190 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
138
Voted
TIT
2008
72views more  TIT 2008»
15 years 3 months ago
On the Construction of (Explicit) Khodak's Code and Its Analysis
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
Yann Bugeaud, Michael Drmota, Wojciech Szpankowski
132
Voted
JSS
2007
105views more  JSS 2007»
15 years 3 months ago
Composing pattern-based components and verifying correctness
Designing large software systems out of reusable components has become increasingly popular. Although liberal composition of reusable components saves time and expense, many exper...
Jing Dong, Paulo S. C. Alencar, Donald D. Cowan, S...
129
Voted
CJTCS
1999
133views more  CJTCS 1999»
15 years 3 months ago
The Permanent Requires Large Uniform Threshold Circuits
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
Eric Allender
140
Voted
MOC
1998
175views more  MOC 1998»
15 years 3 months ago
Convergence of a non-stiff boundary integral method for interfacial flows with surface tension
Boundary integral methods to simulate interfacial flows are very sensitive to numerical instabilities. In addition, surface tension introduces nonlinear terms with high order spat...
Héctor D. Ceniceros, Thomas Y. Hou
250
Voted
EUROPKI
2009
Springer
15 years 1 months ago
Automatic Generation of Sigma-Protocols
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
Endre Bangerter, Thomas Briner, Wilko Henecka, Ste...