Sciweavers

874 search results - page 91 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
BMCBI
2010
121views more  BMCBI 2010»
14 years 7 months ago
A grammar-based distance metric enables fast and accurate clustering of large sets of 16S sequences
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
David J. Russell, Samuel F. Way, Andrew K. Benson,...
SIAMDM
2000
159views more  SIAMDM 2000»
14 years 9 months ago
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
Lisa Fleischer
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 1 months ago
An empirical investigation of how and why neutrality affects evolutionary search
The effects of neutrality on evolutionary search have been considered in a number of interesting studies, the results of which, however, have been contradictory. Some researchers ...
Edgar Galván López, Riccardo Poli
CVPR
2010
IEEE
15 years 12 days ago
A Study on Continuous Max-Flow and Min-Cut Approaches
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
Jing Yuan, Egil Bae, Xuecheng Tai
DAC
2005
ACM
14 years 12 months ago
A combined feasibility and performance macromodel for analog circuits
The need to reuse the performance macromodels of an analog circuit topology challenges existing regression based modeling techniques. A model of good reusability should have a num...
Mengmeng Ding, Ranga Vemuri