Sciweavers

1100 search results - page 120 / 220
» Approximate distance oracles
Sort
View
IS
2008
14 years 10 months ago
A dimensionality reduction technique for efficient time series similarity analysis
We propose a dimensionality reduction technique for time series analysis that significantly improves the efficiency and accuracy of similarity searches. In contrast to piecewise c...
Qiang Wang, Vasileios Megalooikonomou
COMPUTING
2007
81views more  COMPUTING 2007»
14 years 10 months ago
Hybrid curve fitting
We consider a parameterized family of closed planar curves and introduce an evolution process for identifying a member of the family that approximates a given unorganized point cl...
Martin Aigner, Bert Jüttler
ICASSP
2011
IEEE
14 years 1 months ago
Gaussian mixture modeling for source localization
Exploiting prior knowledge, we use Bayesian estimation to localize a source heard by a fixed sensor network. The method has two main aspects: Firstly, the probability density fun...
John T. Flåm, Joakim Jalden, Saikat Chatterj...
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
14 years 11 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
88
Voted
CORR
2010
Springer
93views Education» more  CORR 2010»
14 years 10 months ago
Parallelized Solution to Semidefinite Programmings in Quantum Complexity Theory
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale's thesis [K...
Xiaodi Wu