3319 search results - page 358 / 664 » The topology of dark networks |
135
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
208
click to vote
MOBIHOC
2002
ACM
16 years 6 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
211
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— Collaborative spectrum sensing among secondary users (SUs) in cognitive networks is shown to yield a significant performance improvement. However, there exists an inherent tra...
189
click to vote
DSD
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—In two recent contributions [1], [2], we have provided a comparative analysis of various optimization algorithms, which can be used for atomic location estimation, and s...
187
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
—For label switched networks, such as MPLS and GMPLS, most existing traffic engineering (TE) solutions work in a single routing domain. These solutions do not work when a route ...