165 search results - page 21 / 33 » Fast Routing Table Lookup Using CAMs |
ECCV
2010
Springer
15 years 3 months ago
2010
Springer
This paper presents algorithms for efficiently computing the covariance matrix for features that form sub-windows in a large multidimensional image. For example, several image proc...
62
Voted
FPGA
2001
ACM
15 years 2 months ago
2001
ACM
In FPGAs, the internal connections in a cluster of lookup tables (LUTs) are often fully-connected like a full crossbar. Such a high degree of connectivity makes routing easier, bu...
LCN
2008
IEEE
15 years 4 months ago
2008
IEEE
—Structured Peer-to-Peer (P2P) systems are highly scalable, self-organizing, and support efficient lookups. Furthermore, Distributed Hash Tables (DHTs), due to their features, a...
JGTOOLS
2008
14 years 10 months ago
2008
Abstract. This article presents uniform B-spline interpolation, completely contained on the graphics processing unit (GPU). This implies that the CPU does not need to compute any l...
NETWORKING
2008
14 years 11 months ago
2008
Due to the increasing size of IP routing table and the growing rate of their lookups, many algorithms are introduced to achieve the required speed in table search and update or opt...