6095 search results - page 446 / 1219 » Learning in Local Search |
207
Voted
ICML
2004
IEEE
16 years 9 days ago
2004
IEEE
We investigate how to learn a kernel matrix for high dimensional data that lies on or near a low dimensional manifold. Noting that the kernel matrix implicitly maps the data into ...
174
click to vote
NIPS
2008
15 years 8 months ago
2008
We study the convergence and the rate of convergence of a local manifold learning algorithm: LTSA [13]. The main technical tool is the perturbation analysis on the linear invarian...
219
Voted
BIBE
2008
IEEE
16 years 1 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
205
Voted
BMCBI
2006
15 years 7 months ago
2006
Background: The identification of statistically overrepresented sequences in the upstream regions of coregulated genes should theoretically permit the identification of potential ...
207
Voted
BMCBI
2005
15 years 6 months ago
2005
Background: High throughput microarray analyses result in many differentially expressed genes that are potentially responsible for the biological process of interest. In order to ...