1449 search results - page 136 / 290 » Finiteness results for sigmoidal |
156
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
160
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
170
click to vote
PODS
2005
ACM
16 years 6 months ago
2005
ACM
We consider here the exchange of Active XML (AXML) data, i.e., XML documents where some of the data is given explicitly while other parts are given only intensionally as calls to ...
182
click to vote
ICDAR
2009
IEEE
16 years 1 months ago
2009
IEEE
The problem of determining the appropriate number of components is important in finite mixture modeling for pattern classification. This paper considers the application of an unsu...
172
click to vote
SEMWEB
2009
Springer
16 years 29 days ago
2009
Springer
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...