Sciweavers

539 search results - page 30 / 108
» Recurrence relations and fast algorithms
Sort
View
DCC
2004
IEEE
16 years 12 hour ago
Fast Near-Lossless or Lossless Compression of Large 3D Neuro-Anatomical Images
3D neuro-anatomical images and other volumetric data sets are important in many scientific and biomedical fields. Since such sets may be extremely large, a scalable compression me...
Rongkai Zhao, Michael Gabriel, Geneva G. Belford
91
Voted
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
15 years 1 months ago
Absolute convergence: true trees from short sequences
Fast-converging methods for reconstructing phylogenetic trees require that the sequences characterizing the taxa be of only polynomial length, a major asset in practice, since rea...
Tandy Warnow, Bernard M. E. Moret, Katherine St. J...
WAIM
2009
Springer
15 years 5 months ago
Kernel-Based Transductive Learning with Nearest Neighbors
In the k-nearest neighbor (KNN) classifier, nearest neighbors involve only labeled data. That makes it inappropriate for the data set that includes very few labeled data. In this ...
Liangcai Shu, Jinhui Wu, Lei Yu, Weiyi Meng
RECOMB
2008
Springer
16 years 22 days ago
A Fast, Alignment-Free, Conservation-Based Method for Transcription Factor Binding Site Discovery
As an increasing number of eukaryotic genomes are being sequenced, comparative studies aimed at detecting regulatory elements in intergenic sequences are becoming more prevalent. M...
Raluca Gordân, Leelavati Narlikar, Alexander...
ICRA
2006
IEEE
102views Robotics» more  ICRA 2006»
15 years 6 months ago
Fast Iterative Alignment of Pose Graphs with Poor Initial Estimates
— A robot exploring an environment can estimate its own motion and the relative positions of features in the environment. Simultaneous Localization and Mapping (SLAM) algorithms ...
Edwin Olson, John J. Leonard, Seth J. Teller