699 search results - page 98 / 140 » The method of combinatorial telescoping |
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces [5]. We use the well-known fami...
118
Voted
COMGEO
2010
ACM
15 years 20 days ago
2010
ACM
: We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f Q[x,y,z] of arbitrary total degree N. Additionally, our analy...
104
Voted
COMBINATORICA
2008
15 years 20 days ago
2008
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
88
Voted
CORR
2010
Springer
15 years 19 days ago
2010
Springer
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
107
click to vote
CORR
2008
Springer
15 years 19 days ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...