2125 search results - page 220 / 425 » On Graph Complexity |
178
click to vote
DISOPT
2011
14 years 6 months ago
2011
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
115
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
148
click to vote
FUIN
2006
15 years 3 months ago
2006
This paper introduces an approach to behavioral pattern identification as a part of a study of temporal patterns in complex dynamical systems. Rough set theory introduced by Zdzisl...
141
click to vote
STOC
2007
ACM
16 years 3 months ago
2007
ACM
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
141
click to vote
WWW
2003
ACM
16 years 3 months ago
2003
ACM
This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as ...