16093 search results - page 270 / 3219 » On the optimality of the neighbor-joining algorithm |
173
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
: Carry-save-adder(CSA) is one of the most widely used schemes for fast arithmetic in industry. This paper provides a solution to the problem of finding an optimal-timing allocatio...
194
click to vote
TMC
2011
15 years 1 months ago
2011
We consider the problem of optimal channel access to provide quality of service (QoS) for data transmission in cognitive vehicular networks. In such a network the vehicular nodes ...
250
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
Table partitioning splits a table into smaller parts that can be accessed, stored, and maintained independent of one another. From their traditional use in improving query perform...
198
click to vote
ICC
2011
IEEE
14 years 6 months ago
2011
IEEE
—In this paper, we investigate the transmission completion time minimization problem in a two-user additive white Gaussian noise (AWGN) broadcast channel, where the transmitter i...
190
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
This paper examines sparse grid quadrature on weighted tensor products (wtp) of reproducing kernel Hilbert spaces on products of the unit sphere S2 . We describe a wtp quadrature ...