Sciweavers

4498 search results - page 433 / 900
» How to Invent Functions
Sort
View
COMPGEOM
2009
ACM
16 years 1 months ago
Proximity of persistence modules and their diagrams
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
Frédéric Chazal, David Cohen-Steiner...
ICC
2007
IEEE
129views Communications» more  ICC 2007»
16 years 1 months ago
Time Sharing Policy in Wireless Networks for Variable Rate Transmission
— For most of wireless services with variable rate transmission, both average rate and rate oscillation are important performance metrics. One often needs to decide how much rate...
Xiaolu Zhang, Meixia Tao, Chun Sum Ng
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
16 years 1 months ago
A New Interactive Hashing Theorem
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
Iftach Haitner, Omer Reingold
MLG
2007
Springer
16 years 1 months ago
Learning Graph Matching
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
Alex J. Smola
FOCS
2005
IEEE
16 years 16 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