39 search results - page 3 / 8 » Fast and Compact Prefix Codes |
INFOCOM
1999
IEEE
14 years 26 days ago
1999
IEEE
One of the key design issues for the new generation IP routers is the route lookup mechanism. For each incoming IP packet, the IP routing requires to perform a longest prefix match...
CVPR
2010
IEEE
13 years 7 months ago
2010
IEEE
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
UIST
2005
ACM
14 years 2 months ago
2005
ACM
We introduce PlayAnywhere, a front-projected computer vision-based interactive table system which uses a new commercially available projection technology to obtain a compact, self...
IMR
2003
Springer
14 years 1 months ago
2003
Springer
We describe data structures for representing simplicial meshes compactly while supporting online queries and updates efficiently. Our data structure requires about a factor of fi...
SPIRE
2009
Springer
14 years 3 months ago
2009
Springer
The directed graph representation of the World Wide Web has been extensively used to analyze the Web structure, behavior and evolution. However, those graphs are huge and do not ...