2252 search results - page 297 / 451 » Lower Bounds for Dynamic Algorithms |
123
Voted
CAS
2008
15 years 3 months ago
2008
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
112
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
A belief-propagation decoder for low-density lattice codes, which represents messages explicitly as a mixture of Gaussians functions, is given. In order to prevent the mixture elem...
148
click to vote
JCB
2008
15 years 3 months ago
2008
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2-break rearrangements represent standard reversals, fusions...
129
click to vote
IEICET
2007
15 years 3 months ago
2007
We compare the convergence performance of different numerical schemes for computing the fundamental matrix from point correspondences over two images. First, we state the problem ...
131
click to vote
IJAIT
2007
15 years 3 months ago
2007
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...