Sciweavers

1439 search results - page 72 / 288
» Fast approximation of centrality
Sort
View
123
Voted
SIGMETRICS
2000
ACM
105views Hardware» more  SIGMETRICS 2000»
15 years 5 months ago
Using the exact state space of a Markov model to compute approximate stationary measures
We present a new approximation algorithm based on an exact representation of the state space S, using decision diagrams, and of the transition rate matrix R, using Kronecker algeb...
Andrew S. Miner, Gianfranco Ciardo, Susanna Donate...
104
Voted
SGP
2003
15 years 2 months ago
Approximating and Intersecting Surfaces from Points
Point sets become an increasingly popular shape representation. Most shape processing and rendering tasks require the approximation of a continuous surface from the point data. We...
Anders Adamson, Marc Alexa
CVPR
2004
IEEE
16 years 2 months ago
BoostMap: A Method for Efficient Approximate Similarity Rankings
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
103
Voted
CVPR
2008
IEEE
16 years 2 months ago
Approximate earth mover's distance in linear time
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
Sameer Shirdhonkar, David W. Jacobs
SIGMOD
2003
ACM
161views Database» more  SIGMOD 2003»
16 years 25 days ago
Approximate Join Processing Over Data Streams
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
Abhinandan Das, Johannes Gehrke, Mirek Riedewald