3353 search results - page 113 / 671 » Laver and set theory |
100
click to vote
EWNLG
1993
15 years 2 months ago
1993
Abstract. An active research programme in Natural Language Generation has grown up around the notion of `coherence relations'. Relations are being used in a variety of roles i...
CSC
2008
14 years 11 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
TKDE
2008
14 years 9 months ago
2008
The computational grid is rapidly evolving into a service-oriented computing infrastructure that facilitates resource sharing and large-scale problem solving over the Internet. Ser...
126
click to vote
ADAC
2008
14 years 10 months ago
2008
We consider the problem of multiple fitting of linearly parametrized curves, that arises in many computer vision problems such as road scene analysis. Data extracted from images us...
BIRTHDAY
2000
Springer
15 years 2 months ago
2000
Springer
A number of prioritized variants of Reiter’s default logic have been described in the literature. In this paper, we introduce two natural principles for preference handling and s...