4488 search results - page 363 / 898 » Properties of NP-Complete Sets |
205
click to vote
NIPS
2003
15 years 9 months ago
2003
In the problem of probability forecasting the learner’s goal is to output, given a training set and a new object, a suitable probability measure on the possible values of the ne...
207
click to vote
ACL
1998
15 years 9 months ago
1998
In this paper we specifically address questions of polysemy with respect to verbs, and how regular extensions of meaning can be achieved through the adjunction of particular synta...
196
click to vote
SLP
1994
15 years 9 months ago
1994
We consider a hierarchy of modal event calculi to represent and reason about partially ordered events. These calculi are based on the model of time and change of Kowalski and Sergo...
210
click to vote
CAD
2008
Springer
15 years 7 months ago
2008
Springer
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
203
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order, a natural extension of monoadic second-order logic), and t...