47 search results - page 4 / 10 » Worst-Case Complexity of the Optimal LLL Algorithm |
112
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
111
Voted
APWEB
2010
Springer
15 years 1 months ago
2010
Springer
SimRank has been proposed to rank web documents based on a graph model on hyperlinks. The existing techniques for conducting SimRank computation adopt an iteration computation para...
123
Voted
UAI
2000
15 years 2 months ago
2000
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
169
Voted
APBC
2004
15 years 2 months ago
2004
Pseudoknots are widely occurring structural motifs in RNA. Pseudoknots have been shown to be functionally important in different RNAs which play regulatory, catalytic, or structur...
90
Voted
IEICET
2008
15 years 1 months ago
2008
Abstract-In this paper, we improve the idea of the near-optimal alignments. Though the near optimal alignments increase the possibility to find the correct alignment, too many of t...