Sciweavers

1021 search results - page 104 / 205
» Fast Approximate PCPs
Sort
View
ICDT
2001
ACM
153views Database» more  ICDT 2001»
15 years 7 months ago
Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach
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...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...
PCI
2001
Springer
15 years 7 months ago
An Experimental Evaluation of a Monte-Carlo Algorithm for Singular Value Decomposition
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...
Petros Drineas, Eleni Drinea, Patrick S. Huggins
KR
1992
Springer
15 years 7 months ago
Order of Magnitude Reasoning using Logarithms
Converting complex equations into simpler, more tractable equations usually involves approximation. Approximation is usually done by identifying and removing insignificant terms, ...
P. Pandurang Nayak
INFOCOM
2012
IEEE
13 years 5 months ago
Fair background data transfers of minimal delay impact
—In this paper we present a methodology for the design of congestion control protocols for background data transfers that have a minimal delay impact on short TCP transfers and c...
Costas Courcoubetis, Antonis Dimakis
CVPR
2006
IEEE
16 years 5 months ago
Recursive estimation of generative models of video
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 ...
Nemanja Petrovic, Aleksandar Ivanovic, Nebojsa Joj...