Sciweavers

616 search results - page 92 / 124
» Decoding One Out of Many
Sort
View
SAT
2010
Springer
165views Hardware» more  SAT 2010»
13 years 6 months ago
An Empirical Study of Optimal Noise and Runtime Distributions in Local Search
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
Lukas Kroc, Ashish Sabharwal, Bart Selman
INLG
2010
Springer
13 years 6 months ago
Charting the Potential of Description Logic for the Generation of Referring Expressions
The generation of referring expressions (GRE), an important subtask of Natural Language Generation (NLG) is to generate phrases that uniquely identify domain entities. Until recen...
Yuan Ren, Kees van Deemter, Jeff Z. Pan
IEEEVAST
2010
13 years 3 months ago
Finding and visualizing relevant subspaces for clustering high-dimensional astronomical data using connected morphological opera
Data sets in astronomy are growing to enormous sizes. Modern astronomical surveys provide not only image data but also catalogues of millions of objects (stars, galaxies), each ob...
Bilkis J. Ferdosi, Hugo Buddelmeijer, Scott Trager...
LACL
2011
Springer
12 years 11 months ago
Using Logic in the Generation of Referring Expressions
The problem of generating referring expressions (GRE) is an important task in natural language generation. In this paper, we advocate for the use of logical languages in the output...
Carlos Areces, Santiago Figueira, Daniel Gor&iacut...
PODC
2011
ACM
12 years 11 months ago
Locally checkable proofs
This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distri...
Mika Göös, Jukka Suomela