2421 search results - page 234 / 485 » Approximate Flow-Aware Networking |
162
click to vote
HICSS
2008
IEEE
15 years 4 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
136
Voted
DISOPT
2008
15 years 4 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
142
click to vote
INTERNET
2006
15 years 3 months ago
2006
Distributed data mining deals with the problem of data analysis in environments with distributed data, computing nodes, and users. Peer-to-peer computing is emerging as a new dist...
128
click to vote
JCB
2006
15 years 3 months ago
2006
As postgenomic biology becomes more predictive, the ability to infer rate parameters of genetic and biochemical networks will become increasingly important. In this paper, we expl...
106
click to vote
IJON
2007
15 years 3 months ago
2007
In many studies of self-organized criticality (SOC), branching processes were used to model the dynamics of the activity of the system during avalanches. This mathematical simpliï...