Sciweavers

197 search results - page 14 / 40
» Strongly meager and strong measure zero sets
Sort
View
JMIV
1998
93views more  JMIV 1998»
13 years 7 months ago
Connectivity on Complete Lattices
Classically, connectivity is a topological notion for sets, often introduced by means of arcs. A non topological axiomatics has been proposed by Matheron and Serra. The present pa...
Jean Serra
VMV
2007
155views Visualization» more  VMV 2007»
13 years 8 months ago
Accurate Computation of Geodesic Distance Fields for Polygonal Curves on Triangle Meshes
We present an algorithm for the efficient and accurate computation of geodesic distance fields on triangle meshes. We generalize the algorithm originally proposed by Surazhsky e...
David Bommes, Leif Kobbelt
INFOCOM
2007
IEEE
14 years 1 months ago
Finding Self-Similarities in Opportunistic People Networks
— Opportunistic network is a type of Delay Tolerant Networks (DTN) where network communication opportunities appear opportunistic. In this study, we investigate opportunistic net...
Ling-Jyh Chen, Yung-Chih Chen, Tony Sun, Paruvelli...
FOSSACS
2007
Springer
14 years 1 months ago
Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
We give logical characterizations of bisimulation relations for the probabilistic automata of Segala in terms of three Hennessy-Milner style logics. The three logics characterize s...
Augusto Parma, Roberto Segala
CEC
2007
IEEE
13 years 11 months ago
Efficient relevance estimation and value calibration of evolutionary algorithm parameters
Calibrating the parameters of an evolutionary algorithm (EA) is a laborious task. The highly stochastic nature of an EA typically leads to a high variance of the measurements. The ...
Volker Nannen, A. E. Eiben