Sciweavers

2421 search results - page 348 / 485
» Approximate Flow-Aware Networking
Sort
View
112
Voted
SIROCCO
2010
15 years 3 months ago
Traffic Grooming in Star Networks via Matching Techniques
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
Ignasi Sau, Mordechai Shalom, Shmuel Zaks
128
Voted
BMCBI
2008
138views more  BMCBI 2008»
15 years 2 months ago
CASCADE: a novel quasi all paths-based network analysis algorithm for clustering biological interactions
Background: Quantitative characterization of the topological characteristics of protein-protein interaction (PPI) networks can enable the elucidation of biological functional modu...
Woochang Hwang, Young-Rae Cho, Aidong Zhang, Mural...
COMCOM
2006
147views more  COMCOM 2006»
15 years 2 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das
108
Voted
NN
2008
Springer
15 years 2 months ago
Multilayer in-place learning networks for modeling functional layers in the laminar cortex
Currently, there is a lack of general-purpose in-place learning networks that model feature layers in the cortex. By "general-purpose" we mean a general yet adaptive hig...
Juyang Weng, Tianyu Luwang, Hong Lu, Xiangyang Xue
CORR
2004
Springer
119views Education» more  CORR 2004»
15 years 2 months ago
Exploring networks with traceroute-like probes: theory and simulations
Mapping the Internet generally consists in sampling the network from a limited set of sources by using traceroute-like probes. This methodology, akin to the merging of different s...
Luca Dall'Asta, J. Ignacio Alvarez-Hamelin, Alain ...