Sciweavers

3172 search results - page 8 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
DLOG
2011
13 years 1 months ago
Implementing Completion-Based Inferences for the EL-family
Completion algorithms for subsumption are investigated for many extensions of the description logic EL. While for several of them subsumption is tractable, this is no longer the ca...
Julian Mendez, Andreas Ecke, Anni-Yasmin Turhan
KBS
2002
88views more  KBS 2002»
13 years 9 months ago
Mining the optimal class association rule set
We define an optimal class association rule set to be the minimum rule set with the same predictive power of the complete class association rule set. Using this rule set instead o...
Jiuyong Li, Hong Shen, Rodney W. Topor
KR
2010
Springer
14 years 2 months ago
A Characterization of Optimality Criteria for Decision Making under Complete Ignorance
In this paper we present a model for decision making under complete ignorance. By complete ignorance it is meant that all that is known is the set of possible consequences associa...
Ramzi Ben Larbi, Sébastien Konieczny, Pierr...
EMMCVPR
2001
Springer
14 years 2 months ago
Multiple Contour Finding and Perceptual Grouping as a Set of Energy Minimizing Paths
We address the problem of finding a set of contour curves in an image. We consider the problem of perceptual grouping and contour completion, where the data is a set of points in ...
Laurent D. Cohen, Thomas Deschamps
SIGKDD
2010
151views more  SIGKDD 2010»
13 years 4 months ago
Limitations of matrix completion via trace norm minimization
In recent years, compressive sensing attracts intensive attentions in the field of statistics, automatic control, data mining and machine learning. It assumes the sparsity of the ...
Xiaoxiao Shi, Philip S. Yu