Sciweavers

180 search results - page 2 / 36
» How Thorough Is Thorough Enough
Sort
View
SSDBM
2008
IEEE
177views Database» more  SSDBM 2008»
14 years 1 months ago
ELKI: A Software System for Evaluation of Subspace Clustering Algorithms
In order to establish consolidated standards in novel data mining areas, newly proposed algorithms need to be evaluated thoroughly. Many publications compare a new proposition – ...
Elke Achtert, Hans-Peter Kriegel, Arthur Zimek
ISCC
2000
IEEE
13 years 11 months ago
An Efficient and Flexible Late Join Algorithm for Interactive Shared Whiteboards
In this paper we propose a novel late join algorithm for distributed applications with a fully replicated architecture (e.g. shared whiteboards). The term `late join algorithm'...
Werner Geyer, Jürgen Vogel, Martin Mauve
WSC
1994
13 years 8 months ago
Inside simulation software: how it works and why it matters
ABSTRACT This paper provides beginning and intermediate simulation practitioners and interested simulation consumers with a grounding in how discrete-event simulation software work...
Thomas J. Schriber, Daniel T. Brunner
IWPC
2006
IEEE
14 years 1 months ago
How Webmining and Coupling Metrics Improve Early Program Comprehension
During initial program comprehension, software engineers could benefit from knowing the most need-to-beunderstood classes in the system under study in order to kick-start their s...
Andy Zaidman, Bart Du Bois, Serge Demeyer
CONTEXT
2007
Springer
14 years 1 months ago
A Qualitative Look at Eye-tracking for Implicit Relevance Feedback
Our goal in this study was to explore the potentials of extracting features from eye-tracking data that have the potential to improve performance in implicit relevance feedback. We...
Kirsten Kirkegaard Moe, Jeanette M. Jensen, Birger...