Sciweavers

45 search results - page 3 / 9
» Fast k-Means Algorithms with Constant Approximation
Sort
View
JCC
2002
61views more  JCC 2002»
13 years 5 months ago
A fast pairwise evaluation of molecular surface area
: A fast and general analytical approach was developed for the calculation of the approximate van der Waals and solvent-accessible surface areas. The method is based on three basic...
Vladislav Vasilyev, Enrico O. Purisima
PODS
2004
ACM
109views Database» more  PODS 2004»
14 years 5 months ago
On the Complexity of Optimal K-Anonymity
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...
Adam Meyerson, Ryan Williams
GLOBECOM
2009
IEEE
14 years 1 days ago
Semi-Blind Gradient-Newton CMA and SDD Algorithm for MIMO Space-Time Equalisation
— Semi-blind space-time equalisation is considered for dispersive multiple-input multiple-output systems that employ high-throughput quadrature amplitude modulation signalling. A...
S. Chen, Lajos Hanzo, H.-T. Cheng
ARCS
2006
Springer
13 years 9 months ago
Power-Aware Collective Tree Exploration
An n-node tree has to be explored by a group of k mobile robots deployed initially at the root. Robots traverse the edges of the tree until all nodes are visited. We would like to ...
Miroslaw Dynia, Miroslaw Korzeniowski, Christian S...
MOBIHOC
2008
ACM
14 years 4 months ago
Fast and quality-guaranteed data streaming in resource-constrained sensor networks
In many emerging applications, data streams are monitored in a network environment. Due to limited communication bandwidth and other resource constraints, a critical and practical...
Emad Soroush, Kui Wu, Jian Pei