Sciweavers

2069 search results - page 62 / 414
» Linear time algorithms for Clobber
Sort
View
CORR
2012
Springer
185views Education» more  CORR 2012»
13 years 11 months ago
Adjustment Criteria in Causal Diagrams: An Algorithmic Perspective
Identifying and controlling bias is a key problem in empirical sciences. Causal diagram theory provides graphical criteria for deciding whether and how causal effects can be iden...
Johannes Textor, Maciej Liskiewicz
PR
2007
100views more  PR 2007»
15 years 3 months ago
Linear manifold clustering in high dimensional spaces by stochastic search
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
Robert M. Haralick, Rave Harpaz
140
Voted
IPL
2007
104views more  IPL 2007»
15 years 3 months ago
A linear-time algorithm for Euclidean feature transform sets
The Euclidean distance transform of a binary image is the function that assigns to every pixel the Euclidean distance to the background. The Euclidean feature transform is the fun...
Wim H. Hesselink
126
Voted
TNN
1998
89views more  TNN 1998»
15 years 3 months ago
Fast training of recurrent networks based on the EM algorithm
— In this work, a probabilistic model is established for recurrent networks. The EM (expectation-maximization) algorithm is then applied to derive a new fast training algorithm f...
Sheng Ma, Chuanyi Ji
PODC
2012
ACM
13 years 6 months ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya