2421 search results - page 16 / 485 » Approximate Flow-Aware Networking |
150
click to vote
ICDE
2012
IEEE
13 years 4 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
142
Voted
VTC
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract--This paper analyzes the outage probability in cognitive radio networks, based on the Poisson point process model of node spatial distribution and the standard propagation...
94
Voted
JACM
2007
15 years 1 months ago
2007
116
Voted
ORL
1998
15 years 1 months ago
1998
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
140
click to vote
MOR
2000
15 years 1 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...