1086 search results - page 92 / 218 » Subspace Analysis Using Random Mixture Models |
JCST
2010
13 years 3 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
SIBGRAPI
1999
IEEE
14 years 1 months ago
1999
IEEE
Texture analysis and synthesis is very important for computer graphics, vision, and image processing. This paper describes an algorithm which can produce new textures with a matchi...
ICMCS
2006
IEEE
14 years 3 months ago
2006
IEEE
In this paper, we present a speaker identification algorithm for a microphone array based on a first-order joint Hidden Markov Model (HMM) where the observations correspond to t...
CMSB
2006
Springer
14 years 21 days ago
2006
Springer
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
JSAT
2006
13 years 9 months ago
2006
An analysis of the SAT 2005 sub-competition on random instances is given. This year this (sub-)competition set-up was geared to establish a basic setting, focusing on the instance...