Sciweavers

2880 search results - page 144 / 576
» Approximate Range Searching
Sort
View
160
Voted
AI
2011
Springer
14 years 10 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
216
Voted
SDM
2012
SIAM
285views Data Mining» more  SDM 2012»
13 years 6 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...
138
Voted
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
15 years 3 months ago
On Binary Searching with Nonuniform Costs
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...
3DOR
2009
15 years 4 months ago
SHREC 2009 - Shape Retrieval Contest
The objective of the Shape Retrieval Contest '09 (SHREC'09) of Partial Models is to compare the performances of algorithms that accept a range image as the query and ret...
Remco C. Veltkamp, Frank B. ter Haar
140
Voted
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
15 years 10 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...