8099 search results - page 11 / 1620 » Higher-Order Task Models |
210
click to vote
IDA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. This paper introduces Higher-Order Bayesian Networks, a probabilistic reasoning formalism which combines the efficient reasoning mechanisms of Bayesian Networks with the...
153
click to vote
BMCBI
2008
15 years 5 months ago
2008
Background: Identification of approximate tandem repeats is an important task of broad significance and still remains a challenging problem of computational genomics. Often there ...
144
click to vote
ICC
2000
IEEE
15 years 10 months ago
2000
IEEE
The biggest limitation of Radio over Fiber (ROF) links in a wireless network is its limited dynamic range due to ‘Non Linear Distortions’ (NLD). In this paper a higher orde...
159
click to vote
ACL
1996
15 years 7 months ago
1996
In this paper, we show that Higher-Order Coloured Unification - a form of unification developed for automated theorem proving - provides a general theory for modeling the interfac...
135
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...