Sciweavers

3758 search results - page 37 / 752
» A Complete Subsumption Algorithm
Sort
View
ICCV
2009
IEEE
15 years 17 days ago
Tensor completion for estimating missing values in visual data
In this paper we propose an algorithm to estimate missing values in tensors of visual data. The values can be missing due to problems in the acquisition process, or because the ...
Ji Liu, Przemyslaw Musialski, Peter Wonka, Jieping...
LMCS
2006
126views more  LMCS 2006»
13 years 7 months ago
The Completeness of Propositional Resolution: A Simple and Constructive Proof
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing tha...
Jean H. Gallier
VCIP
2003
146views Communications» more  VCIP 2003»
13 years 9 months ago
A segmentation system with model-assisted completion of video objects
This paper presents a new algorithm for video-object segmentation, which combines motion-based segmentation, high-level object-model detection, and spatial segmentation into a sin...
Dirk Farin, Peter H. N. de With, Wolfgang Effelsbe...
MFCS
2009
Springer
14 years 2 months ago
The Isomorphism Problem for k-Trees Is Complete for Logspace
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...
Johannes Köbler, Sebastian Kuhnert
ISMVL
2007
IEEE
100views Hardware» more  ISMVL 2007»
14 years 1 months ago
A Complete Resolution Calculus for Signed Max-SAT
We define a resolution-style rule for solving the Max-SAT problem of Signed CNF formulas (Signed Max-SAT) and prove that our rule provides a complete calculus for that problem. F...
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...