1805 search results - page 235 / 361 » A Theory of Closure Operators |
150
click to vote
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...
137
click to vote
ICDM
2009
IEEE
15 years 2 months ago
2009
IEEE
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
142
click to vote
ICFEM
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. On the one hand, modal specifications are classic, convenient, and expressive mathematical objects to represent interfaces of component-based systems. On the other hand, ...
144
click to vote
CC
2010
Springer
15 years 2 months ago
2010
Springer
We describe a randomized algorithm that, given an integer a, produces a certificate that the integer is not a pure power of an integer in expected (log a)1+o(1) bit operations unde...
114
click to vote
SIAMMAX
2010
14 years 11 months ago
2010
We propose a new approach to estimate the joint spectral radius and the joint spectral subradius of an arbitrary set of matrices. We first restrict our attention to matrices that ...