Sciweavers

3122 search results - page 570 / 625
» A Theory of Network Equivalence
Sort
View
FOCS
1998
IEEE
15 years 10 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
TPHOL
1998
IEEE
15 years 10 months ago
The Village Telephone System: A Case Study in Formal Software Engineering
In this paper we illustrate the use of formal methods in the development of a benchmark application we call the Village Telephone System which is characteristic of a class of netwo...
Karthikeyan Bhargavan, Carl A. Gunter, Elsa L. Gun...
HYBRID
1998
Springer
15 years 10 months ago
A Connectionist Simulation of the Empirical Acquisition of Grammatical Relations
Abstract. This paper proposes an account of the acquisition of grammatical relations using the basic concepts of connectionism and a construction-based theory of grammar. Many prev...
William C. Morris, Garrison W. Cottrell, Jeffrey L...
FOCS
1997
IEEE
15 years 10 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
ICC
1997
IEEE
108views Communications» more  ICC 1997»
15 years 10 months ago
Overflow Probability in an ATM Queue with Self-Similar Input Traffic
Real measurements in high-speed communications networks have recently shown that traffic may demonstrate properties of long-range dependency peculiar to self-similar stochastic pr...
Boris Tsybakov, Nicolas D. Georganas