Sciweavers

1729 search results - page 132 / 346
» Deterministic Expressions in C
Sort
View
CORR
2008
Springer
138views Education» more  CORR 2008»
15 years 4 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
CORR
2010
Springer
65views Education» more  CORR 2010»
15 years 4 months ago
On Unconditionally Secure Computation with Vanishing Communication Cost
We propose a novel distortion-theoretic approach to a secure three-party computation problem. Alice and Bob have deterministic sequences, and Charlie wishes to compute a normalize...
Ye Wang, Shantanu Rane, Wei Sun, Prakash Ishwar
JAIR
2008
93views more  JAIR 2008»
15 years 4 months ago
Spectrum of Variable-Random Trees
In this paper, we show that a continuous spectrum of randomisation exists, in which most existing tree randomisations are only operating around the two ends of the spectrum. That ...
Fei Tony Liu, Kai Ming Ting, Yang Yu, Zhi-Hua Zhou
JLP
2007
89views more  JLP 2007»
15 years 4 months ago
Universality and semicomputability for nondeterministic programming languages over abstract algebras
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
Wei Jiang, Yuan Wang, Jeffery I. Zucker
FSTTCS
1992
Springer
15 years 8 months ago
Structural Average Case Complexity
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
Rainer Schuler, Tomoyuki Yamakami