Sciweavers

32 search results - page 6 / 7
» New Net Models for Spectral Netlist Partitioning
Sort
View
CVPR
2010
IEEE
13 years 11 months ago
Learning kernels for variants of normalized cuts: Convex relaxations and applications
We propose a new algorithm for learning kernels for variants of the Normalized Cuts (NCuts) objective – i.e., given a set of training examples with known partitions, how should ...
Lopamudra Mukherjee, Vikas Singh, Jiming Peng, Chr...
ICML
2007
IEEE
14 years 11 months ago
Learning state-action basis functions for hierarchical MDPs
This paper introduces a new approach to actionvalue function approximation by learning basis functions from a spectral decomposition of the state-action manifold. This paper exten...
Sarah Osentoski, Sridhar Mahadevan
ICASSP
2011
IEEE
13 years 2 months ago
When codeword frequency meets geographical location
When codeword frequency meets geographical location in landmark search applications, is it still discriminative for the search procedure? In this paper, we give a systematic inves...
Rongrong Ji, Ling-Yu Duan, Jie Chen, Hongxun Yao, ...
BMCBI
2007
265views more  BMCBI 2007»
13 years 11 months ago
Large scale clustering of protein sequences with FORCE -A layout based heuristic for weighted cluster editing
Background: Detecting groups of functionally related proteins from their amino acid sequence alone has been a long-standing challenge in computational genome research. Several clu...
Tobias Wittkop, Jan Baumbach, Francisco P. Lobo, S...
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
14 years 4 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin