1722 search results - page 106 / 345 » On the sample mean of graphs |
154
click to vote
ICWSM
2008
15 years 7 months ago
2008
Identifying topics and concepts associated with a set of documents is a task common to many applications. It can help in the annotation and categorization of documents and be used...
166
click to vote
TDSC
2008
15 years 6 months ago
2008
The probabilistic packet marking (PPM) algorithm is a promising way to discover the Internet map or an attack graph that the attack packets traversed during a distributed denial-of...
181
click to vote
TEC
2002
15 years 6 months ago
2002
Abstract--In this paper, we present an efficient graph-based evolutionary optimization technique called evolutionary graph generation (EGG) and the proposed approach is applied to ...
149
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
The goal of this paper is to find sparse and representative spatial priors that can be applied to part-based object localization. Assuming a GMRF prior over part configurations, w...
176
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Wigderson and Xiao presented an efficient derandomization of the matrix Chernoff bound using the method of pessimistic estimators [WX08]. Building on their construction, we prese...