Sciweavers

1089 search results - page 181 / 218
» Bounds on generalized Frobenius numbers
Sort
View
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 9 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
14 years 9 months ago
Provisioning a virtual private network: a network design problem for multicommodity flow
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...
LATIN
2010
Springer
14 years 3 months ago
Sharp Separation and Applications to Exact and Parameterized Algorithms
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grando...
MSWIM
2009
ACM
14 years 3 months ago
On the impact of far-away interference on evaluations of wireless multihop networks
It is common practice in wireless multihop network evaluations to ignore interfering signals below a certain signal strength threshold. This paper investigates the thesis that thi...
Douglas M. Blough, Claudia Canali, Giovanni Resta,...
ICC
2009
IEEE
148views Communications» more  ICC 2009»
14 years 3 months ago
A Game-Theoretic Analysis of Inter-Session Network Coding
Abstract— A common assumption in the network coding literature is that the users are cooperative and will not pursue their own interests. However, this assumption can be violated...
Amir Hamed Mohsenian Rad, Jianwei Huang, Vincent W...