Sciweavers

71 search results - page 14 / 15
» Compressing Large Signature Trees
Sort
View
PKC
2010
Springer
150views Cryptology» more  PKC 2010»
14 years 11 days ago
Security of Encryption Schemes in Weakened Random Oracle Models
Liskov proposed several weakened versions of the random oracle model, called weakened random oracle models (WROMs), to capture the vulnerability of ideal compression functions, wh...
Akinori Kawachi, Akira Numayama, Keisuke Tanaka, K...
CHI
2006
ACM
14 years 8 months ago
An evaluation of pan & zoom and rubber sheet navigation with and without an overview
We present a study that evaluates conventional Pan and Zoom Navigation and Rubber Sheet Navigation, a rectilinear Focus+Context technique. Each of the two navigation techniques wa...
Dmitry Nekrasovski, Adam Bodnar, Joanna McGrenere,...
GIS
2004
ACM
14 years 9 months ago
Object-relational management of complex geographical objects
Modern database applications including computer-aided design, multimedia information systems, medical imaging, molecular biology, or geographical information systems impose new re...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
NOMS
2006
IEEE
146views Communications» more  NOMS 2006»
14 years 2 months ago
BGP-Inspect - Extracting Information from Raw BGP Data
— While BGP routing datasets, consisting of raw routing data, are freely available and easy to obtain, extracting any useful information is tedious. Currently, researcher and net...
Dionysus Blazakis, Manish Karir, John S. Baras
TIT
2008
72views more  TIT 2008»
13 years 8 months ago
On the Construction of (Explicit) Khodak's Code and Its Analysis
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
Yann Bugeaud, Michael Drmota, Wojciech Szpankowski