3735 search results - page 640 / 747 » Order compression schemes |
151
Voted
DCOSS
2008
Springer
15 years 2 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
108
Voted
ESA
2008
Springer
15 years 2 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
FLOPS
2008
Springer
15 years 2 months ago
2008
Springer
In this paper, we present an extension of the scheme HH(C) (Hereditary Harrop formulas with Constraints) with a suitable formulation of negation in order to obtain a constraint ded...
122
Voted
FPGA
2008
ACM
15 years 2 months ago
2008
ACM
We present an in-depth analysis of the Xilinx bitstream format. The information gathered in this paper allows bitstream compilation and decompilation. While not actually compromis...
100
Voted
BIOCOMP
2007
15 years 2 months ago
2007
Reconstructing phylogenies is one of the primary objectives in evolution studies. Efficient software to reconstruct phylogenies based on isolated genes has existed for decades, ye...