Sciweavers

9719 search results - page 429 / 1944
» Answer Set Optimization
Sort
View
IMA
2003
Springer
125views Cryptology» more  IMA 2003»
16 years 24 days ago
Commitment Capacity of Discrete Memoryless Channels
In extension of the bit commitment task and following work initiated by Crépeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discr...
Andreas Winter, Anderson C. A. Nascimento, Hideki ...
AI
2010
Springer
16 years 12 days ago
Toward a Gold Standard for Extractive Text Summarization
Abstract. Extractive text summarization is the process of selecting relevant sentences from a collection of documents, perhaps only a single document, and arranging such sentences ...
Alistair Kennedy, Stan Szpakowicz
ICALP
1990
Springer
15 years 11 months ago
Determining the Separation of Preprocessed Polyhedra - A Unified Approach
We show how (now familiar) hierarchical representations of (convex) polyhedra can be used to answer various separation queries efficiently (in a number of cases, optimally). Our e...
David P. Dobkin, David G. Kirkpatrick
NIPS
2007
15 years 9 months ago
On Sparsity and Overcompleteness in Image Models
Computational models of visual cortex, and in particular those based on sparse coding, have enjoyed much recent attention. Despite this currency, the question of how sparse or how...
Pietro Berkes, Richard Turner, Maneesh Sahani
NIPS
2007
15 years 9 months ago
Linear programming analysis of loopy belief propagation for weighted matching
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we investiga...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...