4131 search results - page 295 / 827 » Compactness in Topology and Computation |
135
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
158
click to vote
PG
2007
IEEE
16 years 28 days ago
2007
IEEE
We overview a new method for computing the arrangement of semi-algebraic curves. A subdivision approach is used to compute the topology of the algebraic objects and to segment the...
165
click to vote
CGI
2006
IEEE
16 years 22 days ago
2006
IEEE
In this paper a computational model called dynamic medial axis (DMA) is proposed to describe the internal evolution of planar shapes. To define the DMA, a symbolic representation ...
174
click to vote
SGP
2003
15 years 8 months ago
2003
In this paper we develop a new description for subdivision surfaces based on a graph grammar formalism. Subdivision schemes are specified by a context sensitive grammar in which ...
197
click to vote
MST
2007
15 years 6 months ago
2007
In this paper we consider the computation of reachable, viable and invariant sets for discrete-time systems. We use the framework of type-two effectivity, in which computations a...