Sciweavers

1021 search results - page 135 / 205
» Fast Approximate PCPs
Sort
View
CIA
2006
Springer
15 years 7 months ago
Iterative Query-Based Approach to Efficient Task Decomposition and Resource Allocation
Intelligent coordination in complex multi-agent environments requires sophisticated mechanisms for suboptimal task decomposition and efficient resource allocation provided by the t...
Michal Pechoucek, Ondrej Lerch, Jirí B&iacu...
EDBTW
2006
Springer
15 years 7 months ago
Constructing Optimal Wavelet Synopses
The wavelet decomposition is a proven tool for constructing concise synopses of massive data sets and rapid changing data streams, which can be used to obtain fast approximate, wit...
Dimitris Sacharidis
ESA
2006
Springer
130views Algorithms» more  ESA 2006»
15 years 7 months ago
Reporting Flock Patterns
Data representing moving objects is rapidly getting more available, especially in the area of wildlife GPS tracking. It is a central belief that information is hidden in large data...
Marc Benkert, Joachim Gudmundsson, Florian Hü...
AMDO
2010
Springer
15 years 5 months ago
Silhouette Area Based Similarity Measure for Template Matching in Constant Time
Abstract. In this paper, we present a novel, fast, resolution-independent silhouette area-based matching approach. We approximate the silhouette area by a small set of axis-aligned...
Daniel Mohr, Gabriel Zachmann
CG
2008
Springer
15 years 5 months ago
Whole-History Rating: A Bayesian Rating System for Players of Time-Varying Strength
Whole-History Rating (WHR) is a new method to estimate the time-varying strengths of players involved in paired comparisons. Like many variations of the Elo rating system, the whol...
Rémi Coulom