Sciweavers

1450 search results - page 127 / 290
» On the Complexity of Hardness Amplification
Sort
View
ECCV
2006
Springer
14 years 11 months ago
A Learning Based Approach for 3D Segmentation and Colon Detagging
Abstract. Foreground and background segmentation is a typical problem in computer vision and medical imaging. In this paper, we propose a new learning based approach for 3D segment...
Zhuowen Tu, Xiang Zhou, Dorin Comaniciu, Luca Bogo...
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
14 years 9 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...
EDBT
2004
ACM
155views Database» more  EDBT 2004»
14 years 9 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
ICCSA
2009
Springer
14 years 4 months ago
MDA-Based Framework for Automatic Generation of Consistent Firewall ACLs with NAT
Abstract. The design and management of firewall ACLs is a very hard and error-prone task. Part of this complexity comes from the fact that each firewall platform has its own low-le...
Sergio Pozo, A. J. Varela-Vaca, Rafael M. Gasca
HOST
2009
IEEE
14 years 3 months ago
Detecting Trojan Circuit Attacks
Abstract—Rapid advances in integrated circuit (IC) development predicted by Moore’s Law lead to increasingly complex, hard to verify IC designs. Design insiders or adversaries ...
Gedare Bloom, Bhagirath Narahari, Rahul Simha