2107 search results - page 171 / 422 » Computing Small Search Numbers in Linear Time |
146
Voted
SODA
1998
ACM
15 years 5 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
141
Voted
BMCBI
2006
15 years 3 months ago
2006
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
138
Voted
ECCV
2004
Springer
16 years 5 months ago
2004
Springer
We extend the constellation model to include heterogeneous parts which may represent either the appearance or the geometry of a region of the object. The parts and their spatial co...
116
Voted
FM
1994
Springer
15 years 7 months ago
1994
Springer
Model Checking of Infinite Specifications Daniel Jackson School of Computer Science Carnegie Mellon University Pittsburgh, PA A new method for analyzing specifications in languages...
176
Voted
CP
2003
Springer
15 years 9 months ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...