Sciweavers

11160 search results - page 243 / 2232
» Incompleteness in a General Setting
Sort
View
CORR
2002
Springer
99views Education» more  CORR 2002»
15 years 5 months ago
Nonmonotonic inference operations
A. Tarski 21] proposed the study of in nitary consequence operations as the central topic of mathematical logic. He considered monotonicity to be a property of all such operations...
Michael Freund, Daniel J. Lehmann
ICASSP
2011
IEEE
14 years 9 months ago
Low-rank matrix completion by variational sparse Bayesian learning
There has been a significant interest in the recovery of low-rank matrices from an incomplete of measurements, due to both theoretical and practical developments demonstrating th...
S. Derin Babacan, Martin Luessi, Rafael Molina, Ag...
FLAIRS
2011
14 years 9 months ago
Simulating Human Ratings on Word Concreteness
Psychological measures of concreteness of words are generally estimated by having humans provide ratings of words on a concreteness scale. Due to the limits of this technique, con...
Shi Feng, Zhiqiang Cai, Scott A. Crossley, Daniell...
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 6 months ago
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...
Bernard Boigelot, Julien Brusten, Véronique...
MP
2006
142views more  MP 2006»
15 years 5 months ago
Exploring the Relationship Between Max-Cut and Stable Set Relaxations
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
Monia Giandomenico, Adam N. Letchford