Sciweavers

1064 search results - page 85 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
JMLR
2006
156views more  JMLR 2006»
15 years 4 months ago
Large Scale Multiple Kernel Learning
While classical kernel-based learning algorithms are based on a single kernel, in practice it is often desirable to use multiple kernels. Lanckriet et al. (2004) considered conic ...
Sören Sonnenburg, Gunnar Rätsch, Christi...
INFOVIS
2002
IEEE
15 years 9 months ago
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
Yehuda Koren, Liran Carmel, David Harel
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
15 years 5 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
BMCBI
2006
112views more  BMCBI 2006»
15 years 4 months ago
A correlated motif approach for finding short linear motifs from protein interaction networks
Background: An important class of interaction switches for biological circuits and disease pathways are short binding motifs. However, the biological experiments to find these bin...
Soon-Heng Tan, Hugo Willy, Wing-Kin Sung, See-Kion...
IDA
2005
Springer
15 years 9 months ago
Miner Ants Colony: A New Approach to Solve a Mine Planning Problem
In this paper we introduce a simple ant based algorithm for solving a copper mine planning problem. In the last 10 years this realworld problem has been tackled using linear intege...
María-Cristina Riff, Michael Moossen, Xavie...