Sciweavers

4622 search results - page 215 / 925
» Foundations of Information Theory
Sort
View
COSIT
2007
Springer
120views GIS» more  COSIT 2007»
16 years 26 days ago
Relations in Mathematical Morphology with Applications to Graphs and Rough Sets
Rough sets have been applied in spatial information theory to construct theories of granularity – presenting information at different levels of detail. Mathematical morphology c...
John G. Stell
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
16 years 7 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
ER
2007
Springer
130views Database» more  ER 2007»
16 years 26 days ago
Towards Automated Reasoning on ORM Schemes
The goal of this article is to formalize Object Role Modeling (ORM) using the DLR description logic. This would enable automated reasoning on the formal properties of ORM diagrams,...
Mustafa Jarrar
CCA
2005
Springer
16 years 7 days ago
The Dedekind Reals in Abstract Stone Duality
kind Reals in Abstract Stone Duality Andrej Bauer and Paul Taylor 3 June 2009 Stone Duality (ASD) is a direct axiomatisation of general topology, in contrast to the traditional an...
Andrej Bauer, Paul Taylor 0002
PDCN
2004
15 years 8 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...