126 search results - page 22 / 26 » Query answering exploiting structural properties |
ICDM
2006
IEEE
14 years 3 months 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...
PKDD
2005
Springer
14 years 3 months ago
2005
Springer
In many classification and data-mining applications the user does not know a priori which distance measure is the most appropriate for the task at hand without examining the produ...
PODS
2006
ACM
14 years 10 months ago
2006
ACM
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
JAR
2000
13 years 9 months ago
2000
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
SIGGRAPH
2000
ACM
14 years 2 months ago
2000
ACM
Visibility determination is a key requirement in a wide range of graphics algorithms. This paper introduces a new approach to the computation of volume visibility, the detection o...