Sciweavers

6110 search results - page 245 / 1222
» Approximate Computing
Sort
View
SDM
2012
SIAM
285views Data Mining» more  SDM 2012»
13 years 9 months ago
A Novel Approximation to Dynamic Time Warping allows Anytime Clustering of Massive Time Series Datasets
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
Qiang Zhu 0002, Gustavo E. A. P. A. Batista, Thana...
FOCS
2008
IEEE
16 years 1 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
SAGT
2010
Springer
164views Game Theory» more  SAGT 2010»
15 years 5 months ago
On Nash-Equilibria of Approximation-Stable Games
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
Pranjal Awasthi, Maria-Florina Balcan, Avrim Blum,...
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
16 years 4 months ago
Differentially Private Approximation Algorithms
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
WWW
2008
ACM
16 years 7 months ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan