Sciweavers

20066 search results - page 97 / 4014
» T Spaces
Sort
View
STOC
1996
ACM
101views Algorithms» more  STOC 1996»
15 years 2 months ago
The Space Complexity of Approximating the Frequency Moments
The frequency moments of a sequence containing mi elements of type i, for 1 i n, are the numbers Fk = n i=1 mk i . We consider the space complexity of randomized algorithms that...
Noga Alon, Yossi Matias, Mario Szegedy
PLILP
1997
Springer
15 years 2 months ago
Narrowing the Narrowing Space
We introduce a framework for managing as a whole the space of a narrowing computation. The aim of our framework is to find a finite representation of an infinite narrowing space...
Sergio Antoy, Zena M. Ariola
INFOCOM
1994
IEEE
15 years 2 months ago
A Comparative Evaluation of Space Priority Strategies in ATM Networks
Current standards reserve one bit in the ATM cell header to indicate loss priority. When congestion occurs ai a queue lower priority cells can be discarded in order to insure a sm...
Subhash Suri, David Tipper, Gopal Meempat
MFCS
1989
Springer
15 years 2 months ago
Space Bounded Computations: Review And New Separation Results
In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the prominent proof techniques. We show that, for a s...
Juris Hartmanis, Desh Ranjan
FOCS
2007
IEEE
15 years 1 months ago
Inferring Local Homology from Sampled Stratified Spaces
We study the reconstruction of a stratified space from a possibly noisy point sample. Specifically, we use the vineyard of the distance function restricted to a 1-parameter family...
Paul Bendich, David Cohen-Steiner, Herbert Edelsbr...