117 search results - page 15 / 24 » Routing on Trees via Matchings |
DOCENG
2005
ACM
14 years 11 months ago
2005
ACM
Document representations can rapidly become unwieldy if they try to encapsulate all possible document properties, ranging tract structure to detailed rendering and layout. We pres...
TON
2010
14 years 4 months ago
2010
Abstract--A novel storage design for IP routing table construction is introduced on the basis of a single set-associative hash table to support fast longest prefix matching (LPM). ...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—We study network optimization that considers energy minimization as an objective. Studies have shown that mechanisms such as speed scaling can significantly reduce the ...
SIGIR
2004
ACM
15 years 3 months ago
2004
ACM
Noun phrases in queries are identified and classified into four types: proper names, dictionary phrases, simple phrases and complex phrases. A document has a phrase if all content...
127
click to vote
VLDB
1999
ACM
15 years 1 months ago
1999
ACM
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...