Sciweavers

1717 search results - page 141 / 344
» A Computable Spectral Theorem
Sort
View
ICPR
2008
IEEE
15 years 11 months ago
Graph drawing using quantum commute time
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...
David Emms, Edwin R. Hancock, Richard C. Wilson
ICCV
2005
IEEE
15 years 10 months ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua
NIME
2004
Springer
102views Music» more  NIME 2004»
15 years 10 months ago
Gesture and Musical Interaction: Interactive Engagement Through Dynamic Morphology
New Interfaces for Musical Expression must speak to the nature of ‘instrument’, that is, it must always be understood that the interface binds to a complex musical phenomenon....
Garth Paine
DCC
2005
IEEE
16 years 4 months ago
The Combinatorics of Dom de Caen
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
Edwin R. van Dam
116
Voted
CCA
2009
Springer
15 years 11 months ago
Random Iteration Algorithm for Graph-Directed Sets
Abstract. A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton’s theorem, it is shown that almost all sequences obtaine...
Yoshiki Tsujii, Takakazu Mori, Mariko Yasugi, Hide...