Sciweavers

4131 search results - page 14 / 827
» Compactness in Topology and Computation
Sort
View
CVPR
2010
IEEE
15 years 9 months ago
Convex Shape Decomposition
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
Liu Hairong, Longin Jan Latecki, Liu Wenyu
ACS
2007
15 years 1 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é
113
Voted
JSYML
2007
97views more  JSYML 2007»
15 years 1 months ago
Sublocales in formal topology
The paper studies how the localic notion of sublocale transfers to formal topology. For any formal topology (not necessarily with positivity predicate) we define a sublocale to b...
Steven Vickers
JAC
2008
15 years 3 months ago
Topological properties of sand automata as cellular automata
In this paper, we exhibit a strong relation between the sand automata configuration space and the cellular automata configuration space. This relation induces a compact topology f...
Alberto Dennunzio, Pierre Guillon, Benoît Ma...
122
Voted
JGT
2008
150views more  JGT 2008»
15 years 1 months ago
Cycle spaces in topological spaces
: We develop a general model of edge spaces in order to generalize, unify, and simplify previous work on cycle spaces of infinite graphs. We give simple topological criteria to sho...
Antoine Vella, R. Bruce Richter