Sciweavers

6365 search results - page 411 / 1273
» Fast Local Computation Algorithms
Sort
View
567
Voted
ICA
2012
Springer
14 years 2 months ago
New Online EM Algorithms for General Hidden Markov Models. Application to the SLAM Problem
In this contribution, new online EM algorithms are proposed to perform inference in general hidden Markov models. These algorithms update the parameter at some deterministic times ...
Sylvain Le Corff, Gersende Fort, Eric Moulines
VISSYM
2003
15 years 8 months ago
A Robust Level-Set Algorithm for Centerline Extraction
We present a robust method for extracting 3D centerlines from volumetric datasets. We start from a 2D skeletonization method to locate voxels centered with respect to three orthog...
Alexandru Telea, Anna Vilanova
COR
2008
99views more  COR 2008»
15 years 7 months ago
Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
Over the past few years, several local search algorithms have been proposed for various problems related to multicast routing in the off-line mode. We describe a population-based ...
Mohammed S. Zahrani, Martin J. Loomes, James A. Ma...
MOBIDE
2006
ACM
16 years 24 days ago
GPS-Free node localization in mobile wireless sensor networks
An important problem in mobile ad-hoc wireless sensor networks is the localization of individual nodes, i.e., each node’s awareness of its position relative to the network. In t...
Hüseyin Akcan, Vassil Kriakov, Hervé B...
169
Voted
VLDB
2001
ACM
139views Database» more  VLDB 2001»
15 years 11 months ago
NetCube: A Scalable Tool for Fast Data Mining and Compression
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
Dimitris Margaritis, Christos Faloutsos, Sebastian...