Sciweavers

749 search results - page 150 / 150
» Dualities for Constraint Satisfaction Problems
Sort
View
IJCAI
1997
13 years 7 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
JACIII
2007
99views more  JACIII 2007»
13 years 5 months ago
Asymptotic Behavior of Linear Approximations of Pseudo-Boolean Functions
We study the problem of approximating pseudoBoolean functions by linear pseudo-Boolean functions. Pseudo-Boolean functions generalize ordinary Boolean functions by allowing the fu...
Guoli Ding, Robert F. Lax, Peter P. Chen, Jianhua ...
PUC
2007
154views more  PUC 2007»
13 years 5 months ago
Point-of-capture archiving and editing of personal experiences from a mobile device
Personal experience computing is an emerging research area in computing support for capturing, archiving, editing, and utilizing of digital personal experiences. This paper presen...
Chon-in Wu, Chao-ming Teng, Yi-Chao Chen, Tung-yun...
FOCS
2004
IEEE
13 years 9 months ago
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O...