1591 search results - page 289 / 319 » Random lifts of graphs |
ACTA
2006
14 years 10 months ago
2006
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
102
click to vote
ALGORITHMICA
2006
14 years 10 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
— The advent of network coding presents promising opportunities in many areas of communication and networking. It has been recently shown that network coding technique can signi...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
—In this paper, we conduct extensive simulations to understand the properties of the overlay generated by BitTorrent. We start by analyzing how the overlay properties impact the ...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...