1538 search results - page 177 / 308 » Spectral Techniques in Graph Algorithms |
136
click to vote
ICPP
1991
IEEE
15 years 7 months ago
1991
IEEE
There is an interesting class of ICNs, which includes the star graph and the n-way shuffle, for which the network diameter is sub-logarithmic in the network size. This paper prese...
107
click to vote
IJRR
2008
15 years 3 months ago
2008
Recognizing useful modular robot configurations composed of hundreds of modules is a significant challenge. Matching a new modular robot configuration to a library of known configu...
159
click to vote
ER
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...
143
Voted
BMCBI
2008
15 years 3 months ago
2008
Background: Quantitative characterization of the topological characteristics of protein-protein interaction (PPI) networks can enable the elucidation of biological functional modu...
138
click to vote
TIT
2008
15 years 3 months ago
2008
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...