Sciweavers

1032 search results - page 78 / 207
» Extended Computation Tree Logic
Sort
View
LICS
2006
IEEE
15 years 4 months ago
The Boundedness Problem for Monadic Universal First-Order Logic
We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
Martin Otto
JCNS
2010
90views more  JCNS 2010»
14 years 4 months ago
Fast Kalman filtering on quasilinear dendritic trees
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
Liam Paninski
ICDE
2000
IEEE
130views Database» more  ICDE 2000»
15 years 11 months ago
CMP: A Fast Decision Tree Classifier Using Multivariate Predictions
Most decision tree classifiers are designed to keep class histograms for single attributes, and to select a particular attribute for the next split using said histograms. In this ...
Haixun Wang, Carlo Zaniolo
EVOW
2010
Springer
15 years 2 months ago
Ant Colony Optimization for Tree Decompositions
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
Thomas Hammerl, Nysret Musliu
WOB
2004
14 years 11 months ago
A Multi-Neighbor-Joining Approach for Phylogenetic Tree Reconstruction and Visualization
ABSTRACT. The computationally challenging problem of reconstructing the phylogeny of a set of contemporary data, such as DNA sequences or morphological attributes, was treated by a...
Ana Estela Antunes da Silva, Wilfredo J. Puma-Vill...