Sciweavers

2638 search results - page 188 / 528
» Random Geometric Complexes
Sort
View
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
16 years 6 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
FOCS
2005
IEEE
16 years 3 days ago
The Complexity of Online Memory Checking
We consider the problem of storing a large file on a remote and unreliable server. To verify that the file has not been corrupted, a user could store a small private (randomized...
Moni Naor, Guy N. Rothblum
IACR
2011
135views more  IACR 2011»
14 years 6 months ago
Algebraic Complexity Reduction and Cryptanalysis of GOST
Abstract. GOST 28147-89 is a well-known block cipher and the official encryption standard of the Russian Federation. Its large key size of 256 bits at a particularly low implementa...
Nicolas Courtois
SENSYS
2006
ACM
16 years 13 days ago
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
Nisheeth Shrivastava, Raghuraman Mudumbai, Upamany...
CGF
2010
156views more  CGF 2010»
15 years 6 months ago
Mixed Finite Elements for Variational Surface Modeling
Many problems in geometric modeling can be described using variational formulations that define the smoothness of the shape and its behavior w.r.t. the posed modeling constraints....
Alec Jacobson, Elif Tosun, Olga Sorkine, Denis Zor...