Sciweavers

526 search results - page 65 / 106
» Increments of Random Partitions
Sort
View
MICCAI
2007
Springer
14 years 9 months ago
Robust Computation of Mutual Information Using Spatially Adaptive Meshes
Abstract. We present a new method for the fast and robust computation of information theoretic similarity measures for alignment of multi-modality medical images. The proposed meth...
Hari Sundar, Dinggang Shen, George Biros, Chenyang...
SIGMOD
2005
ACM
128views Database» more  SIGMOD 2005»
14 years 8 months ago
Privacy Preserving OLAP
We present techniques for privacy-preserving computation of multidimensional aggregates on data partitioned across multiple clients. Data from different clients is perturbed (rand...
Rakesh Agrawal, Ramakrishnan Srikant, Dilys Thomas
DCC
2005
IEEE
14 years 8 months ago
Coding the Wavelet Spatial Orientation Tree with Low Computational Complexity
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
Yushin Cho, Amir Said, William A. Pearlman
ALGOSENSORS
2007
Springer
14 years 2 months ago
Asynchronous Training in Wireless Sensor Networks
Scalable energy-efficient training protocols are proposed for massively-deployed sensor networks, where sensors are initially anonymous and unaware of their location. The protocol...
Ferruccio Barsi, Alan A. Bertossi, Francesco Betti...
PKDD
2007
Springer
132views Data Mining» more  PKDD 2007»
14 years 2 months ago
An Algorithm to Find Overlapping Community Structure in Networks
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...
Steve Gregory