Sciweavers

4843 search results - page 800 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
16 years 3 months ago
Similarity Search on Supergraph Containment
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...
Haichuan Shang, Ke Zhu, Xuemin Lin, Ying Zhang, Ry...
ICDE
2010
IEEE
199views Database» more  ICDE 2010»
16 years 3 months ago
Fuzzy Matching of Web Queries to Structured Data
Recognizing the alternative ways people use to reference an entity, is important for many Web applications that query structured data. In such applications, there is often a mismat...
Tao Cheng, Hady Wirawan Lauw, Stelios Paparizos
117
Voted
MOBIHOC
2006
ACM
16 years 2 months ago
Starvation mitigation through multi-channel coordination in CSMA multi-hop wireless networks
Existing multi-channel protocols have been demonstrated to significantly increase aggregate throughput compared to single-channel protocols. However, we show that despite such imp...
Jingpu Shi, Theodoros Salonidis, Edward W. Knightl...
EWSN
2008
Springer
16 years 2 months ago
Predictive Modeling-Based Data Collection in Wireless Sensor Networks
Abstract. We address the problem of designing practical, energy-efficient protocols for data collection in wireless sensor networks using predictive modeling. Prior work has sugges...
Lidan Wang, Amol Deshpande
130
Voted
EWSN
2004
Springer
16 years 2 months ago
Design of Surveillance Sensor Grids with a Lifetime Constraint
A surveillance area is to be monitored using a grid network of heterogeneous sensor nodes. There are two types of nodes; type 0 nodes which perform sensing and relaying of data wit...
Vivek Mhatre, Catherine Rosenberg, Daniel Kofman, ...