Results 1  10
of
271,064
Clustering and Embedding using Commute Times
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
"... This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation and multibody motion tracking. Our starting point is the lazy random walk on the graph, which is determined by the heatke ..."
Abstract

Cited by 55 (4 self)
 Add to MetaCart
This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation and multibody motion tracking. Our starting point is the lazy random walk on the graph, which is determined
Image segmentation using commute times
 In BMVC
, 2005
"... This paper exploits the properties of the commute time to develop a graphspectral method for image segmentation. Our starting point is the lazy random walk on the graph, which is determined by the heatkernel of the graph and can be computed from the spectrum of the graph Laplacian. We characterise ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
This paper exploits the properties of the commute time to develop a graphspectral method for image segmentation. Our starting point is the lazy random walk on the graph, which is determined by the heatkernel of the graph and can be computed from the spectrum of the graph Laplacian. We characterise
Job Search and Commuting Time
 Journal of Business and Economic Statistics
, 1997
"... applied labour economics research team vrije Universi tei t amsterdam ..."
Abstract

Cited by 25 (3 self)
 Add to MetaCart
applied labour economics research team vrije Universi tei t amsterdam
Graph commute times for image representation
 In CVPR, 2008. 5 (a) (b) (c) (d) (e) (f) (g) (h
"... We introduce a new image representation that encompasses both the general layout of groups of quantized local invariant descriptors as well as their relative frequency. A graph of interest points clusters is constructed and we use the matrix of commute times between the different nodes of the graph ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
We introduce a new image representation that encompasses both the general layout of groups of quantized local invariant descriptors as well as their relative frequency. A graph of interest points clusters is constructed and we use the matrix of commute times between the different nodes of the graph
Graph Drawing using Quantum Commute Time
"... In this paper, we explore experimentally the use of the commute time of the continuoustime quantum walk for graph drawing. For the classical random walk, the commute time has been shown to be robust to errors in edge weight structure and to lead to spectral clustering algorithms with improved perfo ..."
Abstract
 Add to MetaCart
In this paper, we explore experimentally the use of the commute time of the continuoustime quantum walk for graph drawing. For the classical random walk, the commute time has been shown to be robust to errors in edge weight structure and to lead to spectral clustering algorithms with improved
Lollipop Graphs Are Extremal for Commute Times
, 1998
"... Consider a simple random walk on a connected graph G = (V; E). Let C(u; v) be the expected time taken for the walk starting at vertex u to reach vertex v and then go back to u again, i.e. the commute time for u and v, and let C(G) = max u;v2V C(u; v). Let further G(n; m) be the family of connected ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Consider a simple random walk on a connected graph G = (V; E). Let C(u; v) be the expected time taken for the walk starting at vertex u to reach vertex v and then go back to u again, i.e. the commute time for u and v, and let C(G) = max u;v2V C(u; v). Let further G(n; m) be the family of connected
Graph Matching using Commute Time Spanning Trees
"... This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heatkernel of the graph and can be computed from the spectrum of the graph Laplacian. We characterise the random walk using the c ..."
Abstract
 Add to MetaCart
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heatkernel of the graph and can be computed from the spectrum of the graph Laplacian. We characterise the random walk using
Improvement of Commutation Time in Matrix Converter
"... Abstract — Matrix Converter is a near ideal static frequency changer which provides solution to the problem of converting ac from one frequency and one magnitude to variable frequency and variable magnitude ac, without any bulky energy storing components like capacitors or induct ors. One of the maj ..."
Abstract
 Add to MetaCart
of the major obstacles towards commercial acceptance of this topology has been the commutation of the bidirectional switches. An attempt has been made here to find a very fast and simple but safe current commutation technique. It has been found that with simple modification of the Input Current Filtering
Sample Selection Bias in Models of Commuting Time
"... Summary. This research conceptualises, measures and evaluates the effects of sample selection bias on models of commuting time. Data are drawn from the Public Use Microdata Sample of the 1990 US Census for the Boston metropolitan area. The major ® nding of the analysis is that the process that deter ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Summary. This research conceptualises, measures and evaluates the effects of sample selection bias on models of commuting time. Data are drawn from the Public Use Microdata Sample of the 1990 US Census for the Boston metropolitan area. The major ® nding of the analysis is that the process
Symposium article The Pecuniary Value of Commuting Time
"... If commuting time is changed significantly by injury or wrongful termination, the change in the cost of commuting might be an element of damages, and the forensic economist might be called on to evaluate the change. Transportation economists have studied commuting behavior for more than half a centu ..."
Abstract
 Add to MetaCart
If commuting time is changed significantly by injury or wrongful termination, the change in the cost of commuting might be an element of damages, and the forensic economist might be called on to evaluate the change. Transportation economists have studied commuting behavior for more than half a
Results 1  10
of
271,064