Sciweavers

17366 search results - page 3286 / 3474
» New Revision Algorithms
Sort
View
KDD
2002
ACM
155views Data Mining» more  KDD 2002»
16 years 6 months ago
SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets
We propose a new clustering algorithm, called SyMP, which is based on synchronization of pulse-coupled oscillators. SyMP represents each data point by an Integrate-and-Fire oscill...
Hichem Frigui
KDD
2002
ACM
157views Data Mining» more  KDD 2002»
16 years 6 months ago
Learning nonstationary models of normal network traffic for detecting novel attacks
Traditional intrusion detection systems (IDS) detect attacks by comparing current behavior to signatures of known attacks. One main drawback is the inability of detecting new atta...
Matthew V. Mahoney, Philip K. Chan
CHI
2004
ACM
16 years 6 months ago
Combining 2D and 3D views for orientation and relative position tasks
We compare 2D/3D combination displays to displays with 2D and 3D views alone. Combination displays we consider are: orientation icon (i.e., side-by-side), in-place methods (e.g., ...
Melanie Tory, Torsten Möller, M. Stella Atkin...
CHI
2002
ACM
16 years 6 months ago
Quantitative analysis of scrolling techniques
We propose a formal experimental paradigm designed to help evaluate scrolling interaction techniques. Such a method is needed by interaction designers to quantify scrolling perfor...
Ken Hinckley, Edward Cutrell, Steve Bathiche, Tim ...
POPL
2007
ACM
16 years 5 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
« Prev « First page 3286 / 3474 Last » Next »