Sciweavers

2745 search results - page 116 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
131
Voted
MOBIHOC
2007
ACM
16 years 3 months ago
The multicast capacity of large multihop wireless networks
We consider wireless ad hoc networks with a large number of users. Subsets of users might be interested in identical information, and so we have a regime in which several multicas...
Srinivas Shakkottai, Xin Liu, R. Srikant
IPPS
2003
IEEE
15 years 9 months ago
Phylogenetic Tree Inference on PC Architectures with AxML/PAxML
Inference of phylogenetic trees comprising hundreds or even thousands of organisms based on the maximum likelihood method is computationally extremely expensive. In previous work,...
Alexandros Stamatakis, Thomas Ludwig 0002
ICRA
2003
IEEE
103views Robotics» more  ICRA 2003»
15 years 9 months ago
Simultaneous localization and mapping with unknown data association using fastSLAM
— The Extended Kalman Filter (EKF) has been the de facto approach to the Simultaneous Localization and Mapping (SLAM) problem for nearly fifteen years. However, the EKF has two ...
Michael Montemerlo, Sebastian Thrun
134
Voted
RECOMB
2006
Springer
16 years 4 months ago
Simple and Fast Inverse Alignment
For as long as biologists have been computing alignments of sequences, the question of what values to use for scoring substitutions and gaps has persisted. While some choices for s...
John D. Kececioglu, Eagu Kim
CODES
2005
IEEE
15 years 9 months ago
High-level synthesis for large bit-width multipliers on FPGAs: a case study
In this paper, we present the analysis, design and implementation of an estimator to realize large bit width unsigned integer multiplier units. Larger multiplier units are require...
Gang Quan, James P. Davis, Siddhaveerasharan Devar...