2570 search results - page 15 / 514 » Fast Algorithms For The Computation Of Ranklets |
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
Consider two phylogenetic networks N and N′ of size n. The tripartition-based distance finds the proportion of tripartitions which are not shared by N and N′ . This distance i...
112
click to vote
TON
2010
14 years 4 months ago
2010
Abstract--We consider a scheduled orthogonal frequency division multiplexed (OFDM) wireless cellular network where the channels from the base-station to the mobile users undergo fl...
CDC
2008
IEEE
14 years 11 months ago
2008
IEEE
In this paper, an efficient algorithm is presented for solving the 2-D optimization problem which is associated with computing the robustness measures of a number of linear time-in...
JPDC
2006
14 years 9 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
VLSID
2000
IEEE
15 years 2 months ago
2000
IEEE
Digital images are convenient media for describing and storing spatial, temporal, spectral, and physical components of information contained in a variety of domains(e.g. aerial/sa...