240 search results - page 37 / 48 » Efficient Variants of the Backward-Oracle-Matching Algorithm |
NIPS
2008
13 years 10 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
CATA
2004
13 years 10 months ago
2004
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
NN
2006
Springer
13 years 8 months ago
2006
Springer
We introduce the Hierarchically Growing Hyperbolic Self-Organizing Map (H2 SOM) featuring two extensions of the HSOM (hyperbolic SOM): (i) a hierarchically growing variant that al...
RECOMB
2009
Springer
14 years 9 months ago
2009
Springer
Reconciliation between a set of gene trees and a species tree is the most commonly used approach to infer the duplication and loss events in the evolution of gene families, given a...
VLDB
2004
ACM
14 years 8 months ago
2004
ACM
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....