181 search results - page 15 / 37 » On Quantification with A Finite Universe |
ALT
2002
Springer
14 years 4 months ago
2002
Springer
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
SEMWEB
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we consider the problem of materializing the complete finite RDFS closure in a scalable manner; this includes those parts of the RDFS closure that are often ignored...
ICLP
1991
Springer
13 years 11 months ago
1991
Springer
An extended logic programming language embodying sets is developed in successive stages, introducing at each stage simple set dictions and operations, and discussing their operati...
NIPS
2007
13 years 9 months ago
2007
Over the past few years, the notion of stability in data clustering has received growing attention as a cluster validation criterion in a sample-based framework. However, recent w...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In wireless networks, the knowledge of nodal distances is essential for performance analysis and protocol design. When determining distance distributions in random networks, the u...