Sciweavers

36 search results - page 4 / 8
» Fast Node Overlap Removal
Sort
View
NN
2006
Springer
153views Neural Networks» more  NN 2006»
13 years 7 months ago
An incremental network for on-line unsupervised classification and topology learning
This paper presents an on-line unsupervised learning mechanism for unlabeled data that are polluted by noise. Using a similarity thresholdbased and a local error-based insertion c...
Shen Furao, Osamu Hasegawa
VIS
2009
IEEE
630views Visualization» more  VIS 2009»
14 years 8 months ago
Kd-Jump: a Path-Preserving Stackless Traversal for Faster Isosurface Raytracing on GPUs
Stackless traversal techniques are often used to circumvent memory bottlenecks by avoiding a stack and replacing return traversal with extra computation. This paper addresses wheth...
David M. Hughes, Ik Soo Lim
SC
2009
ACM
14 years 2 months ago
FACT: fast communication trace collection for parallel applications through program slicing
A proper understanding of communication patterns of parallel applications is important to optimize application performance and design better communication subsystems. Communicatio...
Jidong Zhai, Tianwei Sheng, Jiangzhou He, Wenguang...
BROADNETS
2007
IEEE
14 years 1 months ago
DIMPLE: DynamIc Membership ProtocoL for epidemic protocols
—Epidemic protocols assume that information of a random set of nodes is provided at each protocol round. By definition, the random set needs to be chosen uniformly and randomly ...
Jin Sun, Paul J. Weber, Byung Kyu Choi, Roger M. K...
SP
2009
IEEE
144views Security Privacy» more  SP 2009»
14 years 2 months ago
De-anonymizing Social Networks
Operators of online social networks are increasingly sharing potentially sensitive information about users and their relationships with advertisers, application developers, and da...
Arvind Narayanan, Vitaly Shmatikov