Sciweavers

886 search results - page 31 / 178
» On the Autoreducibility of Random Sequences
Sort
View
IPSN
2005
Springer
14 years 1 months ago
Ecolocation: a sequence based technique for RF localization in wireless sensor networks
Abstract— In this paper we present a novel sequence-based RF localization algorithm called Ecolocation. Our algorithm determines the location of unknown nodes by examining the or...
Kiran Yedavalli, Bhaskar Krishnamachari, Sharmila ...
ICIP
1998
IEEE
14 years 9 months ago
Reducing the Computational Complexity of a Map Post-Processing Algorithm for Video Sequences
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...
Mark A. Robertson, Robert L. Stevenson
CIE
2010
Springer
13 years 11 months ago
How Powerful Are Integer-Valued Martingales?
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
Laurent Bienvenu, Frank Stephan, Jason Teutsch
BMCBI
2007
89views more  BMCBI 2007»
13 years 7 months ago
Comparing segmentations by applying randomization techniques
Background: There exist many segmentation techniques for genomic sequences, and the segmentations can also be based on many different biological features. We show how to evaluate ...
Niina Haiminen, Heikki Mannila, Evimaria Terzi
ICPR
2006
IEEE
14 years 8 months ago
Patterns of Co-Linear Equidistant Letter Sequences and Verses
It has been shown ([4], [3]) that equidistant letter sequence (ELS) pairs in the book of Genesis (G) form more compact geometric patterns on the surface of a cylinder than is expe...
Nachum Bombach, Harold Gans