Sciweavers

3708 search results - page 188 / 742
» Approximating Betweenness Centrality
Sort
View
163
Voted
JSAC
2008
70views more  JSAC 2008»
15 years 7 months ago
LMMSE turbo equalization based on factor graphs
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...
Qinghua Guo, Li Ping
197
Voted
MOR
2007
138views more  MOR 2007»
15 years 6 months ago
The Demand-Matching Problem
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...
F. Bruce Shepherd, Adrian Vetta
239
Voted
JMLR
2012
13 years 9 months ago
Detecting Network Cliques with Radon Basis Pursuit
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...
Xiaoye Jiang, Yuan Yao, Han Liu, Leonidas J. Guiba...
306
Voted
ICDE
2003
IEEE
160views Database» more  ICDE 2003»
16 years 8 months ago
SWAT: Hierarchical Stream Summarization in Large Networks
The problem of statistics and aggregate maintenance over data streams has gained popularity in recent years especially in telecommunications network monitoring, trend-related anal...
Ahmet Bulut, Ambuj K. Singh
200
Voted
ICALP
2005
Springer
16 years 17 days ago
New Approaches for Virtual Private Network Design
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...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...