Sciweavers

5401 search results - page 291 / 1081
» Using Versions in GIS
Sort
View
DEXAW
2006
IEEE
141views Database» more  DEXAW 2006»
16 years 21 days ago
Bipolar Queries and Queries with Preferences
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...
Slawomir Zadrozny, Janusz Kacprzyk
127
Voted
HT
2005
ACM
16 years 6 days ago
What the geeks know: hypertext and the problem of literacy
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...
Stuart Moulthrop
ISPEC
2005
Springer
16 years 4 days ago
A New Class of Codes for Fingerprinting Schemes
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...
179
Voted
CINQ
2004
Springer
123views Database» more  CINQ 2004»
16 years 1 days ago
One-Sided Instance-Based Boundary Sets
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....
MFCS
2004
Springer
15 years 12 months ago
Crossing Number Is Hard for Cubic Graphs
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...
Petr Hlinený