11213 search results - page 322 / 2243 » Low-contention data structures |
185
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: When conducting multiple hypothesis tests, it is important to control the number of false positives, or the False Discovery Rate (FDR). However, there is a tradeoff be...
162
click to vote
DATAMINE
1999
15 years 6 months ago
1999
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...
163
click to vote
PKDD
2010
Springer
15 years 5 months ago
2010
Springer
We present a tool for interactive exploration of graphs that integrates advanced graph mining methods in an interactive visualization framework. The tool enables efficient explorat...
209
click to vote
HICSS
2009
IEEE
15 years 4 months ago
2009
IEEE
We propose a benchmarking technique that is combined with customer's cognitive structures. Customer's cognitive structures are determined using a multi-dimensional scali...
187
click to vote
CGA
2010
15 years 3 months ago
2010
Developing visualization applications is non-trivial and poses special challenges. This is due to the fact that typical visualization software processes a large amount of data res...