Sciweavers

340 search results - page 30 / 68
» ets 2009
Sort
View
ICML
2010
IEEE
15 years 27 days ago
Improved Local Coordinate Coding using Local Tangents
Local Coordinate Coding (LCC), introduced in (Yu et al., 2009), is a high dimensional nonlinear learning method that explicitly takes advantage of the geometric structure of the d...
Kai Yu, Tong Zhang
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
15 years 4 months ago
Evolutionary codings and operators for the terminal assignment problem
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
Bryant A. Julstrom
GECCO
2009
Springer
152views Optimization» more  GECCO 2009»
15 years 4 months ago
A data-based coding of candidate strings in the closest string problem
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
Bryant A. Julstrom
RECOMB
2009
Springer
15 years 6 months ago
Yeast Ancestral Genome Reconstructions: The Possibilities of Computational Methods
In 2006, a debate has risen on the question of the efficiency of bioinformatics methods to reconstruct mammalian ancestral genomes. Three years later, Gordon et al. (PLoS Genetics,...
Eric Tannier
CORR
2010
Springer
131views Education» more  CORR 2010»
14 years 12 months ago
A PAC-Bayesian Analysis of Graph Clustering and Pairwise Clustering
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...
Yevgeny Seldin