Sciweavers

2168 search results - page 246 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
136
Voted
CHI
2010
ACM
15 years 10 months ago
Graphemes: self-organizing shape-based clustered structures for network visualisations
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
Ross Shannon, Aaron J. Quigley, Paddy Nixon
108
Voted
CGF
2000
106views more  CGF 2000»
15 years 3 months ago
Constructive Volume Geometry
: Having evolved from volume visualisation, volume graphics is emerging as an important sub-field of computer graphics. This paper focuses on a fundamental aspect of volume graphic...
Min Chen, J. V. Tucker
103
Voted
SIVP
2010
118views more  SIVP 2010»
15 years 2 months ago
Self-organization of sensor networks for detection of pervasive faults
Resource aware operation of sensor networks requires adaptive re-organization to dynamically adapt to the operational environment. A complex dynamical system of interacting compone...
Abhishek Srivastav, Asok Ray
141
Voted
SACRYPT
2007
Springer
141views Cryptology» more  SACRYPT 2007»
15 years 9 months ago
Analysis of Countermeasures Against Access Driven Cache Attacks on AES
Cache attacks on implementations of cryptographic algorithms have turned out to be very powerful. Progress in processor design, e.g., like hyperthreading, requires to adapt models ...
Johannes Blömer, Volker Krummel
117
Voted
KDD
2004
ACM
211views Data Mining» more  KDD 2004»
16 years 4 months ago
Towards parameter-free data mining
Most data mining algorithms require the setting of many input parameters. Two main dangers of working with parameter-laden algorithms are the following. First, incorrect settings ...
Eamonn J. Keogh, Stefano Lonardi, Chotirat (Ann) R...