1439 search results - page 183 / 288 » Fast approximation of centrality |
94
Voted
EDBTW
2006
Springer
15 years 4 months ago
2006
Springer
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...
114
Voted
AMDO
2010
Springer
15 years 3 months ago
2010
Springer
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...
98
Voted
CG
2008
Springer
15 years 2 months ago
2008
Springer
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...
103
Voted
EDBT
2006
ACM
15 years 2 months ago
2006
ACM
Random sampling is a well-known technique for approximate processing of large datasets. We introduce a set of algorithms for incremental maintenance of large random samples on seco...
102
click to vote
ACL
2008
15 years 2 months ago
2008
In lexicalized grammatical formalisms, it is possible to separate lexical category assignment from the combinatory processes that make use of such categories, such as parsing and ...