42 search results - page 7 / 9 » On Linear Programming Relaxations for Unsplittable Flow in T... |
KDD
2009
ACM
14 years 6 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
FPGA
1999
ACM
13 years 10 months ago
1999
ACM
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
COMCOM
2006
13 years 5 months ago
2006
The pervasiveness and operational autonomy of mesh-based wireless sensor networks (WSNs) make them an ideal candidate in offering sustained monitoring functions at reasonable cost...
STOC
2003
ACM
14 years 6 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
TMC
2008
13 years 5 months ago
2008
In this paper, we propose a bandwidth-efficient multicast mechanism for heterogeneous wireless networks. We reduce the bandwidth cost of an Internet Protocol (IP) multicast tree by...