1421 search results - page 138 / 285 » Algorithms for subsequence combinatorics |
126
Voted
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract— A power optimal scheduling algorithm that guarantees desired throughput and bounded delay to each user is developed for fading multi-access multi-band channels that can...
129
click to vote
JCSS
2008
15 years 4 months ago
2008
We study the problem of sorting binary sequences and permutations by length-weighted reversals. We consider a wide class of cost functions, namely f( ) = for all 0, where is the...
116
Voted
SCP
2008
15 years 4 months ago
2008
This paper shows that program algebra (PGA) [8] offers a mathematical and systematic framework for reasoning about correctness and equivalence of algorithms and transformation rul...
141
click to vote
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
In many signal processing problems, it may be fruitful to represent the signal under study in a redundant linear decomposition called a frame. If a probabilistic approach is adopt...
135
Voted
IPL
2010
15 years 3 months ago
2010
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...