Sciweavers

455 search results - page 4 / 91
» Distributed Processes on Tree Hash
Sort
View
DASFAA
2007
IEEE
135views Database» more  DASFAA 2007»
14 years 1 months ago
A Development of Hash-Lookup Trees to Support Querying Streaming XML
Abstract. The rapid growth in the amount of XML data and the development of publish-subscribe systems have led to great interest in processing streaming XML data. We propose the Qs...
James Cheng, Wilfred Ng
C5
2008
IEEE
14 years 2 months ago
MediaDART: A Decentralized Framework for Sharing Multimedia Content
This paper provides an overview of MediaDART, a framework for building online services for distributing and sharing digital media. Inspired by the participative model of Web 2.0, ...
Maurizio Agelli, Orlando Murru
COMPGEOM
2004
ACM
14 years 29 days ago
Locality-sensitive hashing scheme based on p-stable distributions
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab ...
VLDB
1990
ACM
118views Database» more  VLDB 1990»
13 years 11 months ago
Distributed Linear Hashing and Parallel Projection in Main Memory Databases
This paper extends the conceptsof the distributed linear hashedmain memory file system with the objective of supportinghigher level parallel dambaseoperations. The basicdistribute...
Charles Severance, Sakti Pramanik, P. Wolberg
CHES
2007
Springer
111views Cryptology» more  CHES 2007»
14 years 1 months ago
TEC-Tree: A Low-Cost, Parallelizable Tree for Efficient Defense Against Memory Replay Attacks
Replay attacks are often the most costly attacks to thwart when dealing with off-chip memory integrity. With a trusted System-on-Chip, the existing countermeasures against replay r...
Reouven Elbaz, David Champagne, Ruby B. Lee, Lione...