Sciweavers

106 search results - page 14 / 22
» Probabilistically Checkable Arguments
Sort
View
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 7 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...
EMNLP
2006
13 years 10 months ago
Unsupervised Discovery of a Statistical Verb Lexicon
This paper demonstrates how unsupervised techniques can be used to learn models of deep linguistic structure. Determining the semantic roles of a verb's dependents is an impo...
Trond Grenager, Christopher D. Manning
PAMI
2007
187views more  PAMI 2007»
13 years 8 months ago
Supervised Learning of Semantic Classes for Image Annotation and Retrieval
—A probabilistic formulation for semantic image annotation and retrieval is proposed. Annotation and retrieval are posed as classification problems where each class is defined as...
Gustavo Carneiro, Antoni B. Chan, Pedro J. Moreno,...
STOC
2009
ACM
119views Algorithms» more  STOC 2009»
14 years 9 months ago
Explicit construction of a small epsilon-net for linear threshold functions
We give explicit constructions of epsilon nets for linear threshold functions on the binary cube and on the unit sphere. The size of the constructed nets is polynomial in the dime...
Yuval Rabani, Amir Shpilka
CSFW
2006
IEEE
14 years 2 months ago
Computationally Sound Compositional Logic for Key Exchange Protocols
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...
Anupam Datta, Ante Derek, John C. Mitchell, Bogdan...