Sciweavers

132 search results - page 13 / 27
» On Optimally Partitioning a Text to Improve Its Compression
Sort
View
3DOR
2008
13 years 10 months ago
Markov Random Fields for Improving 3D Mesh Analysis and Segmentation
Mesh analysis and clustering have became important issues in order to improve the efficiency of common processing operations like compression, watermarking or simplification. In t...
Guillaume Lavoué, Christian Wolf
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
13 years 8 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
IM
2007
13 years 8 months ago
Using PageRank to Locally Partition a Graph
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
Reid Andersen, Fan R. K. Chung, Kevin J. Lang
DCC
2000
IEEE
14 years 25 days ago
RD-Optimization of Hierarchical Structured Adaptive Vector Quantization for Video Coding
This paper contains two contributions to very-low-bitrate video coding. First, we show that in contrast to common practice incremental techniques for rate-distortion optimization ...
Marcel Wagner, Dietmar Saupe
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
14 years 9 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...