Sciweavers

580 search results - page 53 / 116
» Choosing a random peer
Sort
View
CSDA
2008
84views more  CSDA 2008»
14 years 12 months ago
Bayesian spatial prediction of the site index in the study of the Missouri Ozark Forest Ecosystem Project
This paper presents a Bayesian spatial method for analysing the site index data from the Missouri Ozark Forest Ecosystem Project (MOFEP). Based on ecological background and availa...
Xiaoqian Sun, Zhuoqiong He, John Kabrick
ENTCS
2008
120views more  ENTCS 2008»
14 years 12 months ago
Complementarity of Error Detection Techniques
We study explicit techniques for detection of safety errors, e.g., depth-first search, directed search, random walk, and bitstate hashing. We argue that it is not important to fin...
Radek Pelánek, Václav Rosecký...
PRL
2007
150views more  PRL 2007»
14 years 11 months ago
A method for initialising the K-means clustering algorithm using kd-trees
We present a method for initialising the K-means clustering algorithm. Our method hinges on the use of a kd-tree to perform a density estimation of the data at various locations. ...
Stephen J. Redmond, Conor Heneghan
IPCV
2007
15 years 1 months ago
Quantization Based Blind Watermarking Algorithm Using DWT
- In this paper a Discrete Wavelet Transform based blind watermarking algorithm is proposed for embedding a grayscale watermark into a grayscale image. A new approach of choosing t...
Shikha Tripathi, Sai Krishnan Ramachandran, Vijay ...
OPODIS
2007
15 years 1 months ago
Self-stabilizing and Byzantine-Tolerant Overlay Network
Network overlays have been the subject of intensive research in recent years. The paper presents an overlay structure, S-Fireflies, that is self-stabilizing and is robust against ...
Danny Dolev, Ezra N. Hoch, Robbert van Renesse