10988 search results - page 1675 / 2198 » Algorithmic Folding Complexity |
187
Voted
JACM
2006
15 years 7 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
207
Voted
JRTIP
2008
15 years 7 months ago
2008
Abstract In an effort to achieve lower bandwidth requirements, video compression algorithms have become increasingly complex. Consequently, the deployment of these algorithms on Fi...
219
click to vote
JSAC
2006
15 years 7 months ago
2006
Recently, the notion that a logical next step towards future mobile radio networks is to introduce multihop relaying into cellular networks, has gained wide acceptance. Nevertheles...
202
Voted
TCOM
2008
15 years 7 months ago
2008
Abstract-- In this paper, closed-form expressions for the uncoded bit error probability of closed-loop transmit diversity (CLTD) algorithms with two transmit and one receive antenn...
206
Voted
JALC
2007
15 years 7 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...