Abstract. We analyze special random network models – so-called thickened trees – which are constructed by random trees where the nodes are replaced by local clusters. These obj...
Michael Drmota, Bernhard Gittenberger, Reinhard Ku...
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
Conversation Clusters explores the use of visualization to highlight salient moments of live conversation while archiving a meeting. Cheaper storage and easy access to recording d...
We study the phonetic information in the signal from an ultrasonic “microphone”, a device that emits an ultrasonic wave toward a speaker and receives the reflected, Doppler-s...
The mean shift algorithm, which is a nonparametric density
estimator for detecting the modes of a distribution on a
Euclidean space, was recently extended to operate on analytic
...