Sciweavers

388 search results - page 2 / 78
» Improving Exact Algorithms for MAX-2-SAT
Sort
View
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 3 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
13 years 11 months ago
Maximizing the Number of Independent Labels in the Plane
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee
FOCS
1995
IEEE
13 years 8 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
13 years 4 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
TMI
2010
123views more  TMI 2010»
13 years 3 months ago
Fast Exact/Quasi-Exact FBP Algorithms for Triple-Source Helical Cone-Beam CT
Abstract—Cardiac computed tomography (CT) has been improved over past years, but it still needs improvement for higher temporal resolution in the cases of high or irregular cardi...
Yang Lu, Alexander Katsevich, Jun Zhao, Hengyong Y...