99 search results - page 14 / 20 » Approximation algorithms and hardness of integral concurrent... |
NIPS
2007
13 years 8 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
EDBT
2009
ACM
14 years 1 months ago
2009
ACM
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
STOC
2009
ACM
14 years 7 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
CCR
2010
13 years 7 months ago
2010
TCP flows start with an initial congestion window of at most four segments or approximately 4KB of data. Because most Web transactions are short-lived, the initial congestion wind...
ICDE
2008
IEEE
14 years 8 months ago
2008
IEEE
The overwhelming flow of information in many data stream applications forces many companies to outsource to a third-party the deployment of a Data Stream Management System (DSMS) f...