Sciweavers

1647 search results - page 98 / 330
» Improved Randomized Approximation Algorithms for Lot-Sizing ...
Sort
View
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
16 years 5 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
VTC
2007
IEEE
107views Communications» more  VTC 2007»
15 years 11 months ago
Random Switched Beamforming for Uplink Wireless Sensor Networks
– Integration of beamforming to sensors is very beneficial for a reduction of transmission power consumption and for improvement of the overall system performance. Unfortunately,...
Mohammed Elmusrati, Vesa Hasu
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
15 years 10 months ago
On strip packing With rotations
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
Klaus Jansen, Rob van Stee
WWW
2004
ACM
16 years 5 months ago
The effect of the back button in a random walk: application for pagerank
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
Fabien Mathieu, Mohamed Bouklit
FOCS
2008
IEEE
15 years 11 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...