The concepts of bipolar queries and queries with preferences are studied. Various interpretations of the former, recently defined by Dubois and Prade, are discussed. The latter w...
Recent theories of hypertext usefully emphasize continuity with earlier media; but in the general social environment, this continuity is not well understood, and may even be oppos...
Abstract. In this paper we discuss the problem of collusion secure fingerprinting. In the first part of our contribution we prove the existence of equidistant codes that can be u...
Marcel Fernandez, Miguel Soriano, Josep Cotrina Na...
Abstract. Instance retraction is a difficult problem for concept learning by version spaces. This chapter introduces a family of version-space representations called one-sided inst...
Evgueni N. Smirnov, Ida G. Sprinkhuizen-Kuyper, H....
It was proved by [Garey and Johnson, 1983] that computing the crossing number of a graph is an NP-hard problem. Their reduction, however, used parallel edges and vertices of very h...