Sciweavers

6682 search results - page 324 / 1337
» network 2006
Sort
View
MST
1998
75views more  MST 1998»
15 years 6 months ago
Periodic Merging Networks
We consider the problem of merging two sorted sequences on constant degree networks using comparators only. The classical solution to the problem are the networks based on Batcherâ...
Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oes...
JMLR
2010
157views more  JMLR 2010»
15 years 5 months ago
Kronecker Graphs: An Approach to Modeling Networks
How can we generate realistic networks? In addition, how can we do so with a mathematically tractable model that allows for rigorous analysis of network properties? Real networks ...
Jure Leskovec, Deepayan Chakrabarti, Jon M. Kleinb...
MOBIHOC
2006
ACM
16 years 6 months ago
Proportionally fair allocation of end-to-end bandwidth in STDMA wireless networks
We consider the problem of designing distributed mechanisms for joint congestion control and resource allocation in spatial-reuse TDMA wireless networks. The design problem is pos...
Pablo Soldati, Björn Johansson, Mikael Johans...
IJCNN
2006
IEEE
16 years 23 days ago
Reconstruction of Gene Regulatory Networks from Temporal Microarray Data Using Pattern Recognition Techniques
- Gene regulatory networks allow us to study and understand genes’ roles in biological processes. Among others, regulatory networks help to identify pathway initiator genes and t...
Azhar Salim, Faramarz Valafar
NETWORKS
2010
15 years 5 months ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...