SIAMCOMP
2011
12 years 11 months ago
2011
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
SMI
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract--Many representation schemes have been proposed to deal with non-manifold and mixed dimensionalities objects. A majority of those models are based on incidence graphs and ...
JANCL
2002
13 years 3 months ago
2002
A topological constraint language is a formal language whose variables range over certain subsets of topological spaces, and whose nonlogical primitives are interpreted as topologi...
JCSS
2000
13 years 4 months ago
2000
The paper investigates the use of topological annotations (called topological invariants) to answer topological queries in spatial databases. The focus is on the translation of to...
TIP
2008
13 years 4 months ago
2008
The implicit framework of the level-set method has several advantages when tracking propagating fronts. Indeed, the evolving contour is embedded in a higher dimensional level-set f...
APAL
2005
13 years 4 months ago
2005
Dynamic Topological Logic provides a context for studying the confluence of the topological semantics for S4, based on topological spaces rather than Kripke frames; topological dy...
ENTCS
2007
13 years 4 months ago
2007
We consider the non-orthodox proof rules of hybrid logic from the viewpoint of topological semantics. Topological semantics is more general than Kripke semantics. We show that the...
DCG
2007
13 years 4 months ago
2007
Scalar functions defined on a topological space Ω are at the core of many applications such as shape matching, visualization and physical simulations. Topological persistence i...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We show that for every n > 0 there is a planar topological disk A0 and n translates A1, A2, . . . , An of A0 such that the interiors of A0, . . . An are pairwise disjoint, but ...
CGF
2006
13 years 4 months ago
2006
Performances of actual mesh compression algorithms vary significantly depending on the type of model it encodes. These methods rely on prior assumptions on the mesh to be efficient...