251 search results - page 12 / 51 » Constructive Linear Time Algorithms for Branchwidth |
TIT
2010
14 years 4 months ago
2010
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
RECONFIG
2008
IEEE
15 years 3 months ago
2008
IEEE
—We present algorithms for implementing large-scale regular expression matching (REM) on FPGA. Based on the proposed algorithms, we develop tools that first transform regular ex...
SODA
2000
ACM
14 years 10 months ago
2000
ACM
We discuss the problem of optimally "finishing" a partially sequenced, reconstructed DNA segment. At first sight, this appears to be computationally hard. We construct a...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
89
Voted
CC
2006
Springer
15 years 1 months ago
2006
Springer
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...