3044 search results - page 105 / 609 » Linear logical approximations |
RECOMB
2006
Springer
14 years 9 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
DAM
2008
13 years 8 months ago
2008
We consider {0, 1}n as a sample space with a probability measure on it, thus making pseudo-Boolean functions into random variables. We then derive explicit formulas for approximat...
CDC
2010
IEEE
13 years 4 months ago
2010
IEEE
We address the consensus-based distributed linear filtering problem, where a discrete time, linear stochastic process is observed by a network of sensors. We assume that the consen...
SIAMCOMP
1998
13 years 8 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
CISC
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. This paper reports on the improved and multiple linear cryptanalysis of reduced round Serpent by mean of a branch-and-bound characteristic search within the algorithm. We...