Sciweavers

178 search results - page 20 / 36
» Improving Computational and Memory Requirements of Simultane...
Sort
View
IM
2007
13 years 7 months ago
Approximating Personalized PageRank with Minimal Use of Web Graph Data
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
David Gleich, Marzia Polito
BMCBI
2005
87views more  BMCBI 2005»
13 years 7 months ago
Efficient decoding algorithms for generalized hidden Markov model gene finders
Background: The Generalized Hidden Markov Model (GHMM) has proven a useful framework for the task of computational gene prediction in eukaryotic genomes, due to its flexibility an...
William H. Majoros, Mihaela Pertea, Arthur L. Delc...
IROS
2009
IEEE
199views Robotics» more  IROS 2009»
14 years 2 months ago
Multiswarm Particle Filter for vision based SLAM
Abstract— Particle Filters have been widely used as a powerful optimization tool for nonlinear, non-Gaussian dynamic models such as Simultaneous Localization and Mapping (SLAM) a...
Hee Seok Lee, Kyoung Mu Lee
ITNG
2010
IEEE
14 years 22 days ago
A Fast and Stable Incremental Clustering Algorithm
— Clustering is a pivotal building block in many data mining applications and in machine learning in general. Most clustering algorithms in the literature pertain to off-line (or...
Steven Young, Itamar Arel, Thomas P. Karnowski, De...
SPAA
1996
ACM
13 years 11 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick