2693 search results - page 127 / 539 » On Computing Complex Navigation Functions |
124
click to vote
COMPLIFE
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We describe an approach to clustering the yeast protein-protein interaction network in order to identify functional modules, groups of proteins forming multi-protein comp...
101
click to vote
CORR
2010
Springer
15 years 29 days ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
148
Voted
RANDOM
2001
Springer
15 years 6 months ago
2001
Springer
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨© ¤¥ ¦ §¨ belongs to a certain class of Boolean functions or whether it is far from the...
127
Voted
ATAL
2006
Springer
15 years 6 months ago
2006
Springer
It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of...
131
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...