1986 search results - page 292 / 398 » Path Separability of Graphs |
114
click to vote
CPC
2002
15 years 2 months ago
2002
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
127
Voted
COLT
2010
Springer
15 years 14 days ago
2010
Springer
We develop an online algorithm called Component Hedge for learning structured concept classes when the loss of a structured concept sums over its components. Example classes inclu...
121
Voted
ICPP
2009
IEEE
15 years 5 days ago
2009
IEEE
In this paper we present a multi-grained parallel algorithm for computing betweenness centrality, which is extensively used in large-scale network analysis. Our method is based on ...
253
Voted
GBRPR
2011
Springer
14 years 6 months ago
2011
Springer
Convexity represents an important principle of grouping in visual perceptual organization. This paper presents a new technique for contour grouping based on convexity and has the f...
248
Voted
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. It has been widely used in many fields of information proces...