Sciweavers

11371 search results - page 2182 / 2275
» The network inhibition problem
Sort
View
SIGMOD
1998
ACM
97views Database» more  SIGMOD 1998»
15 years 10 months ago
Cost Based Query Scrambling for Initial Delays
Remote data access from disparate sources across a widearea network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack o...
Tolga Urhan, Michael J. Franklin, Laurent Amsaleg
RANDOM
1998
Springer
15 years 10 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
INFOCOM
1997
IEEE
15 years 10 months ago
VBR over VBR: The Homogeneous, Loss-Free Case
We consider the multiplexing of several variable bit rate (VBR) connections over one variable bit rate connection where the multiplexing uses a multiplexing bu er of size B. The V...
Silvia Giordano, Jean-Yves Le Boudec, Philippe Oec...
153
Voted
PDIS
1994
IEEE
15 years 10 months ago
Achieving Transaction Scaleup on Unix
Constructing scalable high-performance applications on commodity hardware running the Unix operating system is a problem that must be addressed in several application domains. We ...
Marie-Anne Neimat, Donovan A. Schneider
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 10 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
« Prev « First page 2182 / 2275 Last » Next »