Sciweavers

868 search results - page 98 / 174
» Finding Most Likely Solutions
Sort
View
STOC
2009
ACM
150views Algorithms» more  STOC 2009»
14 years 10 months ago
Integrality gaps for Sherali-Adams relaxations
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...
Moses Charikar, Konstantin Makarychev, Yury Makary...
ICC
2007
IEEE
113views Communications» more  ICC 2007»
14 years 4 months ago
Utility-Aware Resource Allocation for Multi-Stream Overlay Multicast
Abstract - Overlay multicast, which performs topology construction and data relaying in the application layer, has recently emerged as a promising vehicle for data distribution. In...
Ji Xu, Jiangchuan Liu, Hsiao-Hwa Chen, Xiao Chu
JAIR
2000
123views more  JAIR 2000»
13 years 10 months ago
Backbone Fragility and the Local Search Cost Peak
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
Josh Singer, Ian P. Gent, Alan Smaill
GIS
2004
ACM
14 years 11 months ago
Energy efficient exact kNN search in wireless broadcast environments
The advances in wireless communication and decreasing costs of mobile devices have enabled users to access desired information at any time. Coupled with positioning technologies l...
Bugra Gedik, Aameek Singh, Ling Liu
WWW
2004
ACM
14 years 10 months ago
What's new on the web?: the evolution of the web from a search engine perspective
We seek to gain improved insight into how Web search engines should cope with the evolving Web, in an attempt to provide users with the most up-to-date results possible. For this ...
Alexandros Ntoulas, Junghoo Cho, Christopher Olsto...