Sciweavers

1986 search results - page 355 / 398
» Path Separability of Graphs
Sort
View
TMC
2008
91views more  TMC 2008»
13 years 7 months ago
Dynamic Forwarding over Tree-on-DAG for Scalable Data Aggregation in Sensor Networks
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Moreo...
Kai-Wei Fan, Sha Liu, Prasun Sinha
TVCG
2008
112views more  TVCG 2008»
13 years 7 months ago
Vispedia: Interactive Visual Exploration of Wikipedia Data via Search-Based Integration
Abstract-Wikipedia is an example of the collaborative, semi-structured data sets emerging on the Web. These data sets have large, nonuniform schema that require costly data integra...
Bryan Chan, Leslie Wu, Justin Talbot, Mike Cammara...
ALGORITHMICA
2002
84views more  ALGORITHMICA 2002»
13 years 7 months ago
Exploring Unknown Environments with Obstacles
We study exploration problems where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the rst problem setting we cons...
Susanne Albers, Klaus Kursawe, Sven Schuierer
CN
2004
114views more  CN 2004»
13 years 7 months ago
Representing the Internet as a succinct forest
Effective placement of resources used to support distributed services in the Internet depends on an accurate representation of Internet topology and routing. Representations of au...
Jim Gast, Paul Barford
ENTCS
2002
89views more  ENTCS 2002»
13 years 7 months ago
ZEUS: A Distributed Timed Model-Checker Based on KRONOS
In this work we present Zeus, a Distributed Model-Checker that evolves from the tool Kronos [8] and that currently can handle backwards computation of TCTLreachability properties ...
Víctor A. Braberman, Alfredo Olivero, Ferna...