614 search results - page 88 / 123 » Computational Complexity of Multi-way, Dataflow Constraint P... |
ICEIS
2006
IEEE
14 years 2 months ago
2006
IEEE
The satisfiability test checks, whether or not the evaluation of a query returns the empty set for any input document, and can be used in query optimization for avoiding the submis...
ICLP
1997
Springer
14 years 4 days ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
AAAI
1992
13 years 9 months ago
1992
Effective problem-solving about complex engineered devices requires device models that are both adequate for the problem and computationally efficient . Producing such models requ...
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
ACL
2010
13 years 6 months ago
2010
Open-ended spoken interactions are typically characterised by both structural complexity and high levels of uncertainty, making dialogue management in such settings a particularly...