3553 search results - page 502 / 711 » Association Computation for Information Access |
172
click to vote
CLUSTER
1999
IEEE
15 years 6 months ago
1999
IEEE
Three protocols for gossip-based failure detection services in large-scale heterogeneous clusters are analyzed and compared. The basic gossip protocol provides a means by which fai...
163
click to vote
SAC
2002
ACM
15 years 6 months ago
2002
ACM
The Peano Count Tree (P-tree) is a quadrant-based lossless tree representation of the original spatial data. The idea of P-tree is to recursively divide the entire spatial data, s...
180
click to vote
SIGKDD
2002
15 years 6 months ago
2002
The primary aim of most data mining algorithms is to facilitate the discovery of concise and interpretable information from large amounts of data. However, many of the current for...
166
click to vote
HVEI
2010
15 years 5 months ago
2010
This paper presents the results of two psychophysical experiments and an associated computational analysis designed to quantify the relationship between visual salience and visual...
196
click to vote
ISVC
2010
Springer
15 years 5 months ago
2010
Springer
We extend our previous work on the exploration of static metabolic networks to evolving, and therefore dynamic, pathways. We apply our visualization software to data from a simulat...