Sciweavers

530 search results - page 50 / 106
» Bounds on marginal probability distributions
Sort
View
SODA
2001
ACM
108views Algorithms» more  SODA 2001»
13 years 9 months ago
Entropy-preserving cuttings and space-efficient planar point location
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
Sunil Arya, Theocharis Malamatos, David M. Mount
CORR
2008
Springer
136views Education» more  CORR 2008»
13 years 8 months ago
Data Fusion Trees for Detection: Does Architecture Matter?
We consider the problem of decentralized detection in a network consisting of a large number of nodes arranged as a tree of bounded height, under the assumption of conditionally in...
Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win
ICCV
2009
IEEE
15 years 29 days ago
A Probabilistic Framework for Partial Intrinsic Symmetries in Geometric Data
In this paper, we present a novel algorithm for partial intrinsic symmetry detection in 3D geometry. Unlike previous work, our algorithm is based on a conceptually simple and st...
Ruxandra Lasowski, Art Tevs, Hans-Peter Seidel, Mi...
GECCO
2007
Springer
215views Optimization» more  GECCO 2007»
14 years 2 months ago
Addressing sampling errors and diversity loss in UMDA
Estimation of distribution algorithms replace the typical crossover and mutation operators by constructing a probabilistic model and generating offspring according to this model....
Jürgen Branke, Clemens Lode, Jonathan L. Shap...
ACISP
2009
Springer
14 years 2 months ago
Cryptographic Properties and Application of a Generalized Unbalanced Feistel Network Structure
Abstract. In this paper, we study GF-NLFSR, a Generalized Unbalanced Feistel Network (GUFN) which can be considered as an extension of the outer function FO of the KASUMI block cip...
Jiali Choy, Guanhan Chew, Khoongming Khoo, Huihui ...