1369 search results - page 141 / 274 » Lattice computations for random numbers |
NOSSDAV
2004
Springer
15 years 3 months ago
2004
Springer
Despite many years of research, fair queuing still faces a number of implementation challenges in high speed routers. In particular, in spite of proposals such as DiffServ, the st...
102
click to vote
SAC
2003
ACM
15 years 3 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
VLSID
2006
IEEE
15 years 10 months ago
2006
IEEE
Logarithmic Number Systems (LNS) offer a viable alternative in terms of area, delay and power to binary number systems for multiplication and division operations in signal process...
DAGM
2003
Springer
15 years 3 months ago
2003
Springer
A new enhancement of RANSAC, the locally optimized RANSAC (LO-RANSAC), is introduced. It has been observed that, to find an optimal solution (with a given probability), the numbe...
SPIRE
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...