Sciweavers

312 search results - page 13 / 63
» Iterative compression and exact algorithms
Sort
View
SIGIR
1998
ACM
14 years 2 months ago
Fast Searching on Compressed Text Allowing Errors
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
INFORMATICALT
2007
75views more  INFORMATICALT 2007»
13 years 9 months ago
An Effective Method for Initialization of Lloyd-Max's Algorithm of Optimal Scalar Quantization for Laplacian Source
Abstract. In this paper an exact and complete analysis of the Lloyd–Max’s algorithm and its initialization is carried out. An effective method for initialization of Lloyd–Max...
Zoran Peric, Jelena Nikolic
FUIN
2008
112views more  FUIN 2008»
13 years 10 months ago
A New Probabilistic Approach for Fractal Based Image Compression
Abstract. Approximation of an image by the attractor evolved through iterations of a set of contractive maps is usually known as fractal image compression. The set of maps is calle...
Suman K. Mitra, Malay Kumar Kundu, C. A. Murthy, B...
ICCAD
2006
IEEE
152views Hardware» more  ICCAD 2006»
14 years 6 months ago
Fast and robust quadratic placement combined with an exact linear net model
— This paper presents a robust quadratic placement approach, which offers both high-quality placements and excellent computational efficiency. The additional force which distrib...
Peter Spindler, Frank M. Johannes
ICMLA
2008
13 years 11 months ago
Multi-stage Learning of Linear Algebra Algorithms
In evolving applications, there is a need for the dynamic selection of algorithms or algorithm parameters. Such selection is hardly ever governed by exact theory, so intelligent r...
Victor Eijkhout, Erika Fuentes