2210 search results - page 291 / 442 » Information complexity of neural networks |
165
click to vote
ITNG
2006
IEEE
16 years 17 days ago
2006
IEEE
—In this paper, we address the scheduling problem for Clos-network switches with no buffers at the central stage. Existing scheduling (dispatching) algorithms for this type of sw...
130
click to vote
GD
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper we propose three layout algorithms for semibipartite graphs—bipartite graphs with edges in one partition—that emerge from microarray experiment analysis...
147
click to vote
IVS
2007
15 years 6 months ago
2007
Networks have remained a challenge for information retrieval and visualization because of the rich set of tasks that users want to accomplish. This paper n abstract Content-Actor ...
167
click to vote
CIKM
2007
Springer
16 years 22 days ago
2007
Springer
Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network...
177
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: A better understanding of the mechanisms involved in gas-phase fragmentation of peptides is essential for the development of more reliable algorithms for high-throughp...