Sciweavers

5752 search results - page 879 / 1151
» Informative Labeling Schemes
Sort
View
142
Voted
VISUALIZATION
1996
IEEE
15 years 8 months ago
Real-time Slicing of Data Space
This can be a costly operation. When the data is arranged according to its three-dimensional coordinates, calculating the contour surfaces requires examining each data cell. Avoidi...
Roger Crawfis
MOBICOM
1996
ACM
15 years 8 months ago
Low-Loss TCP/IP Header Compression for Wireless Networks
Wireless is becoming a popular way to connect mobile computers to the Internet and other networks. The bandwidth of wireless links will probably always be limited due to propertie...
Mikael Degermark, Mathias Engan, Björn Nordgr...
CRYPTO
1993
Springer
137views Cryptology» more  CRYPTO 1993»
15 years 8 months ago
Broadcast Encryption
A broadcast encryption scheme allows the sender to securely distribute data to a dynamically changing set of users over an insecure channel. One of the most challenging settings fo...
Amos Fiat, Moni Naor
188
Voted
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 8 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
154
Voted
ICWN
2008
15 years 6 months ago
Progressive Content-Sensitive Data Retrieval in Sensor Networks
: Problem statement: For a sensor network comprising autonomous and self-organizing data sources, efficient similarity-based search for semantic-rich resources (such as video data)...
Bo Yang, Mareboyana Manohar, Shaoying Kou