634 search results - page 16 / 127 » Completion Procedures as Semidecision Procedures |
TASLP
2011
13 years 4 months ago
2011
—Time-domain algorithms for blind separation of audio sources can be classified as being based either on a partial or complete decomposition of an observation space. The decompo...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
—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...
CSDA
2006
13 years 9 months ago
2006
A studentized range test using a two-stage and a one-stage sampling procedures, respectively, is proposed for testing the hypothesis that the average deviation of the normal means...
TOG
2012
12 years 5 days ago
2012
Procedural noise is a fundamental tool in Computer Graphics. However, designing noise patterns is hard. In this paper, we present Gabor noise by example, a method to estimate the ...
ECAI
2010
Springer
13 years 10 months ago
2010
Springer
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...