Sciweavers

1763 search results - page 216 / 353
» Dependent random choice
Sort
View
IR
2007
13 years 8 months ago
Lightweight natural language text compression
Variants of Huffman codes where words are taken as the source symbols are currently the most attractive choices to compress natural language text databases. In particular, Tagged...
Nieves R. Brisaboa, Antonio Fariña, Gonzalo...
MST
2002
128views more  MST 2002»
13 years 7 months ago
A Simple and Efficient Parallel Disk Mergesort
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
Rakesh D. Barve, Jeffrey Scott Vitter
TPDS
2010
109views more  TPDS 2010»
13 years 6 months ago
Distributed Network Formation for n-Way Broadcast Applications
—In an n-way broadcast application, each one of n overlay nodes wants to push its own distinct large data file to all other n À 1 destinations as well as download their respecti...
Georgios Smaragdakis, Nikolaos Laoutaris, Pietro M...
PKC
2011
Springer
185views Cryptology» more  PKC 2011»
12 years 11 months ago
Signatures on Randomizable Ciphertexts
xtended abstract which appears in the 2011 International Conference on Theory and Practice in Public Key Cryptography PKC 2011 (6–9 march 2011, Taormina, Italy) D. Catalano, N. F...
Olivier Blazy, Georg Fuchsbauer, David Pointcheval...
SIGMOD
2011
ACM
299views Database» more  SIGMOD 2011»
12 years 11 months ago
Processing theta-joins using MapReduce
Joins are essential for many data analysis tasks, but are not supported directly by the MapReduce paradigm. While there has been progress on equi-joins, implementation of join alg...
Alper Okcan, Mirek Riedewald