Sciweavers

14 search results - page 2 / 3
» Pattern Matching for 321-Avoiding Permutations
Sort
View
CPM
2009
Springer
189views Combinatorics» more  CPM 2009»
13 years 11 months ago
Average-Case Analysis of Perfect Sorting by Reversals
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
Mathilde Bouvel, Cedric Chauve, Marni Mishna, Domi...
DATE
2006
IEEE
145views Hardware» more  DATE 2006»
13 years 10 months ago
Building a better Boolean matcher and symmetry detector
Boolean matching is a powerful technique that has been used in technology mapping to overcome the limitations of structural pattern matching. The current basis for performing Bool...
Donald Chai, Andreas Kuehlmann
ICASSP
2011
IEEE
12 years 8 months ago
Azimuth-elevation direction finding using power measurements from single antenna
This paper considers the problem of extending the single antenna power measurements based direction finding to the two-dimensional (2D) case, and proposes a method to estimate th...
Joni Polili Lie, Thierry Blu, Chong Meng Samson Se...
CCGRID
2007
IEEE
13 years 10 months ago
Analysis and Synthesis of Pseudo-Periodic Job Arrivals in Grids: A Matching Pursuit Approach
Pseudo-periodicity is one of the basic job arrival patterns on data-intensive clusters and Grids. In this paper, a signal decomposition methodology called matching pursuit is appl...
Hui Li, Richard Heusdens, Michael Muskulus, Lex Wo...
VLSISP
2008
173views more  VLSISP 2008»
13 years 4 months ago
Fast Bit Gather, Bit Scatter and Bit Permutation Instructions for Commodity Microprocessors
Advanced bit manipulation operations are not efficiently supported by commodity word-oriented microprocessors. Programming tricks are typically devised to shorten the long sequence...
Yedidya Hilewitz, Ruby B. Lee