Sciweavers

1084 search results - page 38 / 217
» Optimal worm-scanning method using vulnerable-host distribut...
Sort
View
MICCAI
2004
Springer
14 years 1 months ago
Registration Using Segment Intensity Remapping and Mutual Information
A method for processing images prior to normalized mutual information based registration and an enhancement of the registration measure are presented. The method relies on k-means ...
Zeger F. Knops, J. B. Antoine Maintz, Max A. Vierg...
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 7 months ago
Polynomial Filtering for Fast Convergence in Distributed Consensus
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
Effrosini Kokiopoulou, Pascal Frossard
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 6 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang
VRML
2000
ACM
14 years 2 days ago
A spatial hierarchical compression method for 3D streaming animation
When distributing 3D contents real-time over a network with a narrow bandwidth such as a telephone line, methods for streaming and data compression can be considered indispensable...
Toshiki Hijiri, Kazuhiro Nishitani, Tim Cornish, T...
CORR
2006
Springer
110views Education» more  CORR 2006»
13 years 7 months ago
Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters
The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds...
Christophe Cérin, Jean-Christophe Dubacq, J...