Sciweavers

3758 search results - page 13 / 752
» A Complete Subsumption Algorithm
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Low-rank matrix completion with geometric performance guarantees
—The low-rank matrix completion problem can be stated as follows: given a subset of the entries of a matrix, find a low-rank matrix consistent with the observations. There exist...
Wei Dai, Ely Kerman, Olgica Milenkovic
ACL
2012
11 years 10 months ago
Computational Approaches to Sentence Completion
This paper studies the problem of sentencelevel semantic coherence by answering SATstyle sentence completion questions. These questions test the ability of algorithms to distingui...
Geoffrey Zweig, John C. Platt, Christopher Meek, C...
RWEB
2010
Springer
13 years 5 months ago
Reasoning and Explanation in EL and in Expressive Description Logics
Description Logics (DLs) are the formalism underlying the standard web ontology language OWL 2. DLs have formal semantics which are the basis for powerful reasoning services. In th...
Anni-Yasmin Turhan
IJCAI
1989
13 years 8 months ago
Recognizing Unnecessary Inference
Intelligent reasoners sometimes draw conclusions that lack new or relevant information. Similarly, automated reasoning systems can produce formulas that are not necessary for the ...
Dan Benanav
TASLP
2010
138views more  TASLP 2010»
13 years 2 months ago
Glimpsing IVA: A Framework for Overcomplete/Complete/Undercomplete Convolutive Source Separation
Abstract--Independent vector analysis (IVA) is a method for separating convolutedly mixed signals that significantly reduces the occurrence of the well-known permutation problem in...
Alireza Masnadi-Shirazi, Wenyi Zhang, Bhaskar D. R...