Sciweavers

2593 search results - page 302 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
176
Voted
VRCAI
2006
ACM
16 years 1 months ago
Kinetic bounding volume hierarchies for deformable objects
We present novel algorithms for updating bounding volume hierarchies of objects undergoing arbitrary deformations. Therefore, we introduce two new data structures, the kinetic AAB...
Gabriel Zachmann, Rene Weller
SAC
2004
ACM
16 years 16 days ago
Self-maintained distributed tuples for field-based coordination in dynamic networks
Field-based coordination is a very promising approach for a wide range of application scenarios in modern dynamic networks. To implement such an approach, one can rely on distribu...
Marco Mamei, Franco Zambonelli
AINA
2007
IEEE
16 years 1 months ago
A Class-Based Search System in Unstructured P2P Networks
— Efficient searching is one of the important design issues in peer-to-peer (P2P) networks. Among various searching techniques, semantic-based searching has drawn significant a...
Juncheng Huang, Xiuqi Li, Jie Wu
ADC
2009
Springer
175views Database» more  ADC 2009»
16 years 1 months ago
Conditional Purpose Based Access Control Model for Privacy Protection
This paper presents a model for privacy preserving access control which is based on variety of purposes. Conditional purpose is applied along with allowed purpose and prohibited p...
Md. Enamul Kabir, Hua Wang
184
Voted
IJCNN
2007
IEEE
16 years 1 months ago
Spectral Clustering of Synchronous Spike Trains
— In this paper a clustering algorithm that learns the groups of synchronized spike trains directly from data is proposed. Clustering of spike trains based on the presence of syn...
António R. C. Paiva, Sudhir Rao, Il Park, J...