16404 search results - page 149 / 3281 » A set coverage problem |
151
Voted
LPNMR
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
156
Voted
AGP
2003
IEEE
15 years 8 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
132
click to vote
EUROCRYPT
2004
Springer
15 years 7 months ago
2004
Springer
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
186
click to vote
ADAC
2008
15 years 3 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...
144
Voted
SEMWEB
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. The increasing awareness of the benefits of ontologies for information processing has lead to the creation of a number of large ontologies about real world domains. The ...