183 search results - page 3 / 37 » Analyzing graph structure via linear measurements |
EUROGP
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. In recent years different genetic programming (GP) structures have emerged. Today, the basic forms of representation for genetic programs are tree, linear and graph stru...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...
CCS
2007
ACM
14 years 1 months ago
2007
ACM
In this paper, we develop an analytical framework to measure the vulnerability of superpeer networks against attack. Two different kinds of attacks namely deterministic and degre...
BMCBI
2006
13 years 7 months ago
2006
Background: Accurate methods for extraction of meaningful patterns in high dimensional data have become increasingly important with the recent generation of data types containing ...
AAAI
2008
13 years 9 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...