Sciweavers

1696 search results - page 339 / 340
» Permuted function matching
Sort
View
ICDCS
2012
IEEE
11 years 11 months ago
Scalable Name Lookup in NDN Using Effective Name Component Encoding
—Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv...
Yi Wang, Keqiang He, Huichen Dai, Wei Meng, Junche...
TKDE
2012
312views Formal Methods» more  TKDE 2012»
11 years 11 months ago
Efficient Fuzzy Type-Ahead Search in XML Data
—In a traditional keyword-search system over XML data, a user composes a keyword query, submits it to the system, and retrieves relevant answers. In the case where the user has l...
Jianhua Feng, Guoliang Li
ICDE
2006
IEEE
183views Database» more  ICDE 2006»
14 years 2 months ago
Similarity Queries on Structured Data in Structured Overlays
Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, b...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...
ASIAN
2005
Springer
178views Algorithms» more  ASIAN 2005»
14 years 2 months ago
An Approach for Service Discovery Based on Semantic Peer-to-Peer
The service discovery is a key step during Peer-to-Peer (P2P) converging with Web Service. In this paper, a semantic-P2P based approach is presented for web service discovery. To e...
Hao Wu, Hai Jin, Yunfa Li, Hanhan Chen
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 1 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen