Sciweavers

1567 search results - page 121 / 314
» Compressing Relations and Indexes
Sort
View
ICALP
2003
Springer
14 years 2 months ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
VISUALIZATION
2002
IEEE
14 years 2 months ago
BLIC: Bi-Level Isosurface Compression
In this paper we introduce a new and simple algorithm to compress isosurface data. This is the data extracted by isosurface algorithms from scalar functions defined on volume gri...
Gabriel Taubin
EXPCS
2007
14 years 1 months ago
An analysis of XML compression efficiency
XML simplifies data exchange among heterogeneous computers, but it is notoriously verbose and has spawned the development of many XML-specific compressors and binary formats. We p...
Christopher J. Augeri, Dursun A. Bulutoglu, Barry ...
IC
2003
13 years 10 months ago
Improving the Performance of Grid-Enabled MPI by Intelligent Message Compression
In the Grid computing, one of the most important issues related to the Message Passing Interface (MPI) is to guarantee the expected performance in the wide area networks. To achie...
Hwang-Jik Lee, Kyung-Lang Park, Kwang-Won Koh, Oh-...
JAIR
2007
107views more  JAIR 2007»
13 years 9 months ago
Compressed Pattern Databases
A pattern database (PDB) is a heuristic function implemented as a lookup table that stores the lengths of optimal solutions for subproblem instances. Standard PDBs have a distinct...
Ariel Felner, Richard E. Korf, Ram Meshulam, Rober...