1029 search results - page 67 / 206 » Compact representations of ordered sets |
114
click to vote
IFIP
2004
Springer
15 years 8 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
123
click to vote
IJCAI
2007
15 years 4 months ago
2007
Compiling Bayesian networks (BNs) is one of the hot topics in the area of probabilistic modeling and processing. In this paper, we propose a new method of compiling BNs into multi...
152
click to vote
BMVC
2010
15 years 1 months ago
2010
Recently, sparse coding has been receiving much attention in object and scene recognition tasks because of its superiority in learning an effective codebook over k-means clusterin...
145
click to vote
BMCBI
2007
15 years 3 months ago
2007
Background: The task of computing highly accurate structural alignments of proteins in very short computation time is still challenging. This is partly due to the complexity of pr...
102
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
The identification of mechanisms by which constraints on phenotypic variability are tuned in nature, and the implementation of these mechanisms in Evolutionary Algorithms (EAs) ca...