Sciweavers

5169 search results - page 13 / 1034
» Locality approximation using time
Sort
View
EDBT
2002
ACM
188views Database» more  EDBT 2002»
14 years 6 months ago
Approximate Processing of Multiway Spatial Joins in Very Large Databases
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
Dimitris Papadias, Dinos Arkoumanis
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
13 years 11 months ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick
FSTTCS
2001
Springer
13 years 11 months ago
Semidefinite Programming Based Approximation Algorithms
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
Uri Zwick
JMLR
2012
11 years 9 months ago
Approximate Inference in Additive Factorial HMMs with Application to Energy Disaggregation
This paper considers additive factorial hidden Markov models, an extension to HMMs where the state factors into multiple independent chains, and the output is an additive function...
J. Zico Kolter, Tommi Jaakkola
ICA
2012
Springer
12 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