Sciweavers

2446 search results - page 346 / 490
» Choiceless Polynomial Time
Sort
View
DLOG
2007
13 years 10 months ago
Partitioning ABoxes Based on Converting DL to Plain Datalog
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...
Jianfeng Du, Yi-Dong Shen
FLAIRS
2008
13 years 10 months ago
Tractable Class of a Problem of Goal Satisfaction in Mutual Exclusion Network
In this paper we describe a class of a problem of goal satisfaction in mutual exclusion network that can be solved in polynomial time. This problem provides a common basis for rea...
Pavel Surynek
WSC
2008
13 years 10 months ago
Smooth flexible models of nonhomogeneous poisson processes using one or more process realizations
We develop and evaluate a semiparametric method to estimate the mean-value function of a nonhomogeneous Poisson process (NHPP) using one or more process realizations observed over...
Michael E. Kuhl, Shalaka C. Deo, James R. Wilson
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
13 years 10 months ago
Learning Random Monotone DNF
We give an algorithm that with high probability properly learns random monotone DNF with t(n) terms of length log t(n) under the uniform distribution on the Boolean cube {0, 1}n ....
Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedi...
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
13 years 10 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan