10997 search results - page 27 / 2200 » On the Structure of Complete Sets |
ICDT
2003
ACM
14 years 3 months ago
2003
ACM
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...
WCRE
2000
IEEE
14 years 2 months ago
2000
IEEE
This paper describes a structured tool demonstration, a hybrid evaluation technique that combines elements from experiments, case studies, and technology demonstrations. Developer...
INFOVIS
2002
IEEE
14 years 2 months ago
2002
IEEE
Radial, space-filling (RSF) techniques for hierarchy visualization have several advantages over traditional node-link diagrams, including the ability to efficiently use the disp...
SIGECOM
2003
ACM
14 years 3 months ago
2003
ACM
We study mechanisms that can be modelled as coalitional games with transferable utilities, and apply ideas from mechanism design and game theory to problems arising in a network d...
MLQ
2006
13 years 10 months ago
2006
We show that a Woodin cardinal is necessary for the Extender Algebra to be complete. Our proof is relatively simple and does not use fine structure.