Sciweavers

2487 search results - page 386 / 498
» Partitions of Graphs into Trees
Sort
View
INFOCOM
2006
IEEE
14 years 2 months ago
Landmark-Based Information Storage and Retrieval in Sensor Networks
— For a wide variety of sensor network environments, location information is unavailable or expensive to obtain. We propose a location-free, lightweight, distributed, and data-ce...
Qing Fang, Jie Gao, Leonidas J. Guibas
INFOCOM
2005
IEEE
14 years 1 months ago
GLIDER: gradient landmark-based distributed routing for sensor networks
— We present Gradient Landmark-Based Distributed Routing (GLIDER), a novel naming/addressing scheme and associated routing algorithm, for a network of wireless communicating node...
Qing Fang, Jie Gao, Leonidas J. Guibas, V. de Silv...
MSR
2005
ACM
14 years 1 months ago
Mining version histories to verify the learning process of Legitimate Peripheral Participants
Since code revisions reflect the extent of human involvement in the software development process, revision histories reveal the interactions and interfaces between developers and...
Shih-Kun Huang, Kang-min Liu
IPPS
2002
IEEE
14 years 1 months ago
A Recursion-Based Broadcast Paradigm in Wormhole Routed Mesh/Torus Networks
: A novel broadcast technique for wormhole-routed mesh and torus parallel computers based on recursion is presented in this paper. It works by partitioning the graph into several s...
Xiaotong Zhuang, Vincenzo Liberatore
SIGMOD
2010
ACM
281views Database» more  SIGMOD 2010»
14 years 1 months ago
Continuous sampling for online aggregation over multiple queries
In this paper, we propose an online aggregation system called COSMOS (Continuous Sampling for Multiple queries in an Online aggregation System), to process multiple aggregate quer...
Sai Wu, Beng Chin Ooi, Kian-Lee Tan