Sciweavers

184 search results - page 9 / 37
» Using FPGAs to solve the Hamiltonian cycle problem
Sort
View
TON
2010
118views more  TON 2010»
14 years 10 months ago
ILP formulations for p-cycle design without candidate cycle enumeration
—The concept of p-cycle (preconfigured protection cycle) allows fast and efficient span protection in wavelength division multiplexing (WDM) mesh networks. To design p-cycles f...
Bin Wu, Kwan L. Yeung, Pin-Han Ho
113
Voted
STACS
2007
Springer
15 years 5 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
DNA
2007
Springer
107views Bioinformatics» more  DNA 2007»
15 years 5 months ago
Solutions to Computational Problems Through Gene Assembly
Abstract. Gene assembly in ciliates is an impressive computational process. Ciliates have a unique way of storing their genetic information in two fundamentally different forms wi...
Artiom Alhazov, Ion Petre, Vladimir Rogojin
106
Voted
ERSA
2006
129views Hardware» more  ERSA 2006»
15 years 1 months ago
Group-Alignment based Accurate Floating-Point Summation on FPGAs
Floating-point summation is one of the most important operations in scientific/numerical computing applications and also a basic subroutine (SUM) in BLAS (Basic Linear Algebra Sub...
Chuan He, Guan Qin, Mi Lu, Wei Zhao
RECOMB
2007
Springer
15 years 12 months ago
Improving Inversion Median Computation Using Commuting Reversals and Cycle Information
In the past decade, genome rearrangements have attracted increasing attention from both biologists and computer scientists as a new type of data for phylogenetic analysis. Methods ...
William Arndt, Jijun Tang