1439 search results - page 123 / 288 » Fast approximation of centrality |
113
Voted
ICDT
2001
ACM
15 years 5 months ago
2001
ACM
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
152
click to vote
PCI
2001
Springer
15 years 5 months ago
2001
Springer
We demonstrate that an algorithm proposed by Drineas et. al. in [7] to approximate the singular vectors/values of a matrix A, is not only of theoretical interest but also a fast, v...
KR
1992
Springer
15 years 4 months ago
1992
Springer
Converting complex equations into simpler, more tractable equations usually involves approximation. Approximation is usually done by identifying and removing insignificant terms, ...
CVPR
2006
IEEE
16 years 2 months ago
2006
IEEE
In this paper we present a generative model and learning procedure for unsupervised video clustering into scenes. The work addresses two important problems: realistic modeling of ...
194
Voted
ICDE
2007
IEEE
16 years 2 months ago
2007
IEEE
This paper introduces a fast data dissemination method for structured peer-to-peer networks. The work is motivated on one side by the increase in non-volatile memory available on ...