Sciweavers

3373 search results - page 642 / 675
» Linear transformations on codes
Sort
View
SBCCI
2009
ACM
187views VLSI» more  SBCCI 2009»
15 years 2 months ago
Design of low complexity digital FIR filters
The multiplication of a variable by multiple constants, i.e., the multiple constant multiplications (MCM), has been a central operation and performance bottleneck in many applicat...
Levent Aksoy, Diego Jaccottet, Eduardo Costa
ICALP
2001
Springer
15 years 2 months ago
Permutation Editing and Matching via Embeddings
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
Graham Cormode, S. Muthukrishnan, Süleyman Ce...
ECCV
2000
Springer
15 years 2 months ago
Anti-Faces for Detection
This paper offers a novel detection method, which works well even in the case of a complicated image collection – for instance, a frontal face under a large class of linear tran...
Daniel Keren, Margarita Osadchy, Craig Gotsman
SIGMOD
1998
ACM
117views Database» more  SIGMOD 1998»
15 years 2 months ago
The Pyramid-Technique: Towards Breaking the Curse of Dimensionality
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
STACS
1992
Springer
15 years 1 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...