Sciweavers

347 search results - page 23 / 70
» Computable Versions of Basic Theorems in Functional Analysis
Sort
View
VTC
2007
IEEE
127views Communications» more  VTC 2007»
15 years 6 months ago
Delay Distribution Analysis of IEEE 802.11 with Variable Packet Length
—The distribution of the delay is a very important measure to determine the performance of a WLAN. Indeed, realtime applications typically require that their packets reach their ...
Paschalis Raptis, Vasileios Vitsas, Albert Banchs,...
TKDE
2010
159views more  TKDE 2010»
14 years 10 months ago
The Tiled Bitmap Forensic Analysis Algorithm
— Tampering of a database can be detected through the use of cryptographically-strong hash functions. Subsequently-applied forensic analysis algorithms can help determine when, w...
Kyriacos E. Pavlou, Richard T. Snodgrass
FOCS
2000
IEEE
15 years 4 months ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk
STOC
2005
ACM
142views Algorithms» more  STOC 2005»
16 years 3 days ago
Market equilibrium via the excess demand function
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
Bruno Codenotti, Benton McCune, Kasturi R. Varadar...
ECCC
2000
158views more  ECCC 2000»
14 years 11 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass