Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
Keyword search is considered to be an effective information discovery method for both structured and semistructured data. In XML keyword search, query semantics is based on the con...
Supporting scalable and efficient routing and service provision in Mobile Ad Hoc Networks (MANET) has been a big research challenge. Conventional topology-based unicast and multic...
In this paper we present FireWxNet, a multi-tiered portable wireless system for monitoring weather conditions in rugged wildland fire environments. FireWxNet provides the fire fig...
Carl Hartung, Richard Han, Carl Seielstad, Saxon H...
Wireless data broadcast has received a lot of attention from industries and academia in recent years. Access efficiency and energy conservation are two critical performance concer...