Sciweavers

71 search results - page 11 / 15
» Compressing Large Signature Trees
Sort
View
INFOCOM
2010
IEEE
13 years 6 months ago
FlashTrie: Hash-based Prefix-Compressed Trie for IP Route Lookup Beyond 100Gbps
It is becoming apparent that the next generation IP route lookup architecture needs to achieve speeds of 100Gbps and beyond while supporting both IPv4 and IPv6 with fast real-time ...
Masanori Bando, H. Jonathan Chao
SSDBM
2010
IEEE
220views Database» more  SSDBM 2010»
14 years 23 days ago
Prefix Tree Indexing for Similarity Search and Similarity Joins on Genomic Data
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
Astrid Rheinländer, Martin Knobloch, Nicky Ho...
WWW
2008
ACM
14 years 9 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
COMSWARE
2007
IEEE
14 years 2 months ago
Integrated Data Location in Multihop Wireless Networks
Abstract— Multihop wireless networks are ideal as infrastructures for location-aware network applications, particularly for disaster recovery operations. However, one missing com...
Irfan Sheriff, Prashanth Aravinda Kumar Acharya, A...
PERCOM
2010
ACM
13 years 6 months ago
Connectivity monitoring in wireless sensor networks
Connectivity monitoring is useful in practical deployment of wireless sensor network. In order to understand the behavior and performance bottleneck, knowledge of the network conn...
Mingze Zhang, Mun Choon Chan, Akkihebbal L. Ananda