1813 search results - page 197 / 363 » Calculi of Approximation Spaces |
220
click to vote
ICDM
2006
IEEE
16 years 16 days ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
157
click to vote
COMPGEOM
2006
ACM
16 years 14 days ago
2006
ACM
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
151
click to vote
DOLAP
2006
ACM
16 years 14 days ago
2006
ACM
Motivated by the increasing need to analyze complex, uncertain multidimensional data this paper proposes probabilistic OLAP queries that are computed using probability distributio...
162
click to vote
ENC
2005
IEEE
16 years 3 days ago
2005
IEEE
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
170
click to vote
ICRA
2005
IEEE
16 years 3 days ago
2005
IEEE
— This paper presents the novel insight that the SLAM information matrix is exactly sparse in a delayedstate framework. Such a framework is used in view-based representations of ...