Sciweavers

1763 search results - page 37 / 353
» Dependent random choice
Sort
View
ISITA
2010
13 years 7 months ago
Approximating discrete probability distributions with causal dependence trees
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
Christopher J. Quinn, Todd P. Coleman, Negar Kiyav...
ICIP
2001
IEEE
14 years 10 months ago
Hierarchical watermarking depending on local constraints
In this paper we propose a new watermarking technique where the watermark is embedded according to two keys. The first key is used to embed a code bit in a block of pixels. The se...
Christopher D. Coltman, Adrian G. Bors
ISBI
2004
IEEE
14 years 9 months ago
Non-Rigid Image Transformation for Assessing Changes in Fluorescence Imaging Data of Molecular Activity in Time-Dependent Geomet
This paper presents an image processing framework for assessing molecular activity changes from fluorescent data in time-dependent geometries. The aim of our work is to provide th...
Kostas Marias, Stelios C. Orphanoudakis, Jorge Rip...
RT
1997
Springer
14 years 1 months ago
A Geometry Dependent Texture Generation Framework for Simulating Surface Imperfections
: To model surface imperfections and weathering, we proposea two-step texture generation framework in between manual texture synthesis and automatic physical simulation. Although t...
Tien-Tsin Wong, Wai-Yin Ng, Pheng-Ann Heng
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 9 months ago
Dependable k-coverage algorithms for sensor networks
– Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same ti...
Simon Gyula, Miklós Molnár, Lá...