Sciweavers

4403 search results - page 397 / 881
» Galois Theory of Algorithms
Sort
View
DCC
2006
IEEE
16 years 6 months ago
Optimal Index Assignment for Multiple Description Lattice Vector Quantization
Optimal index assignment of multiple description lattice vector quantizer (MDLVQ) can be posed as a large-scale linear assignment problem. But is this expensive algorithmic approa...
Xiang Huang, Xiaolin Wu
DCC
2005
IEEE
16 years 6 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
WSDM
2010
ACM
199views Data Mining» more  WSDM 2010»
16 years 4 months ago
A Sketch-Based Distance Oracle for Web-Scale Graphs
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
Atish Das Sarma, Sreenivas Gollapudi, Marc Najork,...
SDM
2009
SIAM
112views Data Mining» more  SDM 2009»
16 years 4 months ago
A Re-evaluation of the Over-Searching Phenomenon in Inductive Rule Learning.
Most commonly used inductive rule learning algorithms employ a hill-climbing search, whereas local pattern discovery algorithms employ exhaustive search. In this paper, we evaluat...
Frederik Janssen, Johannes Fürnkranz
LATA
2009
Springer
16 years 1 months ago
Counting Parameterized Border Arrays for a Binary Alphabet
The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a text when there exists a renaming bijection on the alp...
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayu...