1091 search results - page 123 / 219 » Approximation in Databases |
152
click to vote
ALMOB
2006
15 years 6 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
163
click to vote
CIKM
2005
Springer
15 years 11 months ago
2005
Springer
Accurately and efficiently estimating the number of distinct values for some attribute(s) or sets of attributes in a data set is of critical importance to many database operation...
185
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
144
click to vote
ICIAR
2005
Springer
15 years 11 months ago
2005
Springer
In this study, we propose two algorithms for measuring the distance between shape boundaries. In the algorithms, shape boundary is represented by the Beam Angle Statistics (BAS), w...
163
click to vote
ICML
2000
IEEE
16 years 7 months ago
2000
IEEE
The proliferation of hypertext and the popularity of Kleinberg's HITS algorithm have brought about an increased interest in link analysis. While HITS and its older relatives ...