COMPGEOM
2011
ACM
12 years 8 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
COCOA
2010
Springer
12 years 11 months ago
2010
Springer
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model...
DGCI
2009
Springer
13 years 2 months ago
2009
Springer
The test mask TM is the minimum neighbourhood sufficient to extract the medial axis of any discrete shape, for a given chamfer distance mask M. We propose an arithmetical framework...
COMPGEOM
2009
ACM
13 years 2 months ago
2009
ACM
COMPGEOM
2009
ACM
13 years 2 months ago
2009
ACM
COMPGEOM
2009
ACM
13 years 2 months ago
2009
ACM
Computed tomography(CT), especially since the introduction of helical CT, provides excellent visualization of the internal organs of the body. As a result, CT is used routinely in...
COCOA
2010
Springer
13 years 2 months ago
2010
Springer
A plane graph is a drawing of a planar graph in the plane such that no two edges cross each other. A rooted plane graph has a designated outer vertex. For given positive integers ...
COCOA
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. For a fixed integer k 0, a k-transmitter is an omnidirectional wireless transmitter with an infinite broadcast range that is able to penetrate up to k "walls",...
COCOA
2010
Springer
13 years 2 months ago
2010
Springer
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
COCOA
2010
Springer
13 years 2 months ago
2010
Springer
The classical and well-studied group testing problem is to find d defectives in a set of n elements by group tests, which tell us for any chosen subset whether it contains defectiv...