7129 search results - page 443 / 1426 » Approximation Algorithms for Treewidth |
207
click to vote
IPL
2010
15 years 1 months ago
2010
This paper deals with broadcasting in a network with t-locally bounded Byzantine faults. One of the simplest broadcasting algorithms under Byzantine failures is referred to as a c...
161
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We propose blind equalization algorithms that perform similarly to supervised ones, independently of the QAM order. They converge approximately to the Wiener solution, which gener...
206
click to vote
ICC
2007
IEEE
16 years 20 days ago
2007
IEEE
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...
146
Voted
FOCS
2006
IEEE
16 years 12 days ago
2006
IEEE
We draw on the observation that the amount of heat diffusing outside of a heated body in a short period of time is proportional to its surface area, to design a simple algorithm f...
189
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...