2434 search results - page 57 / 487 » Algorithmic Randomness of Closed Sets |
126
Voted
ISAAC
2009
Springer
15 years 8 months ago
2009
Springer
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
136
click to vote
PAMI
2006
15 years 3 months ago
2006
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
120
click to vote
EMMCVPR
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. This paper presents a Bayesian inference algorithm for image layer representation [26], 2.1D sketch [6], with mixed Markov random field. 2.1D sketch is an very important...
148
click to vote
BMCBI
2007
15 years 3 months ago
2007
Background: Gene Set Enrichment Analysis (GSEA) is a computational method for the statistical evaluation of sorted lists of genes or proteins. Originally GSEA was developed for in...
143
click to vote
SLSFS
2005
Springer
15 years 8 months ago
2005
Springer
Random projection is a simple technique that has had a number of applications in algorithm design. In the context of machine learning, it can provide insight into questions such as...