3341 search results - page 186 / 669 » On Bounded Queries and Approximation |
138
click to vote
DAWAK
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
143
click to vote
VISSYM
2003
15 years 6 months ago
2003
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...
142
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
151
Voted
IM
2007
15 years 4 months ago
2007
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
131
click to vote
MOC
2000
15 years 4 months ago
2000
How close are Galerkin eigenvectors to the best approximation available out of the trial subspace? Under a variety of conditions the Galerkin method gives an approximate eigenvecto...