Sciweavers

4066 search results - page 36 / 814
» Almost Complete Sets
Sort
View
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
CSFW
2005
IEEE
14 years 3 months ago
Computational and Information-Theoretic Soundness and Completeness of Formal Encryption
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
Pedro Adão, Gergei Bana, Andre Scedrov
VL
2000
IEEE
115views Visual Languages» more  VL 2000»
14 years 2 months ago
SD2: A Sound and Complete Diagrammatic Reasoning System
SD2 is a system of Venn-type diagrams that can be used to reason diagrammatically about sets, their cardinalities and their relationships. They augment the systems of Venn-Peirce ...
John Howse, Fernando Molina, John Taylor