1032 search results - page 78 / 207 » Extended Computation Tree Logic |
156
Voted
LICS
2006
IEEE
15 years 9 months ago
2006
IEEE
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...
133
Voted
JCNS
2010
14 years 10 months ago
2010
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...
249
click to vote
ICDE
2000
IEEE
16 years 4 months ago
2000
IEEE
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 ...
130
Voted
EVOW
2010
Springer
15 years 7 months ago
2010
Springer
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...
121
Voted
WOB
2004
15 years 5 months ago
2004
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...