Sciweavers

1864 search results - page 108 / 373
» Formal topology and domains
Sort
View
COMPGEOM
2010
ACM
15 years 11 months ago
Constructing Reeb graphs using cylinder maps
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...
Harish Doraiswamy, Aneesh Sood, Vijay Natarajan
CCE
2007
15 years 6 months ago
An upper ontology based on ISO 15926
Ontologies reflect our view of what exists and developing ontologies for a given domain requires a common context. This context can be characterized explicitly by means of an uppe...
Rafael Batres, Matthew West, David Leal, David Pri...
TPHOL
2005
IEEE
15 years 12 months ago
A HOL Theory of Euclidean Space
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
John Harrison
ICML
2005
IEEE
16 years 7 months ago
Learning class-discriminative dynamic Bayesian networks
In many domains, a Bayesian network's topological structure is not known a priori and must be inferred from data. This requires a scoring function to measure how well a propo...
John Burge, Terran Lane
ACS
2007
15 years 6 months ago
Choiceless, Pointless, but not Useless: Dualities for Preframes
We provide the appropriate common ‘(pre)framework’ for various central results of domain theory and topology, like the Lawson duality of continuous domains, the Hofmann–Lawso...
Marcel Erné