3708 search results - page 188 / 742 » Approximating Betweenness Centrality |
140
click to vote
JSAC
2008
15 years 6 months ago
2008
Abstract--In this paper, a vector-form factor graph representation is derived for intersymbol interference (ISI) channels. The resultant graphs have a tree-structure that avoids th...
168
Voted
MOR
2007
15 years 5 months ago
2007
The objective of the demand matching problem is to obtain the subset M of edges which is feasible and where the sum of the profits of each of the edges is maximized. The set M is...
215
Voted
JMLR
2012
13 years 8 months ago
2012
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between o...
264
click to vote
ICDE
2003
IEEE
16 years 7 months ago
2003
IEEE
The problem of statistics and aggregate maintenance over data streams has gained popularity in recent years especially in telecommunications network monitoring, trend-related anal...
162
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...