Sciweavers

3958 search results - page 246 / 792
» Dynamic Graph Algorithms with Applications
Sort
View
SPAA
2003
ACM
15 years 12 months ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
SSS
2009
Springer
138views Control Systems» more  SSS 2009»
16 years 1 months ago
Analysis of Wireless Sensor Network Protocols in Dynamic Scenarios
We describe an approach to the analysis of protocols for wireless sensor networks in scenarios with mobile nodes and dynamic link quality. The approach is based on the theorem prov...
Cinzia Bernardeschi, Paolo Masci, Holger Pfeifer
IPPS
1999
IEEE
15 years 11 months ago
A New Approach to Parallel Dynamic Partitioning for Adaptive Unstructured Meshes
Classical mesh partitioning algorithms were designed for rather static situations, and their straightforward application in a dynamical framework may lead to unsatisfactory result...
Gerd Heber, Guang R. Gao, Rupak Biswas
PRL
2002
128views more  PRL 2002»
15 years 6 months ago
Dynamic flies: a new pattern recognition tool applied to stereo sequence processing
The "fly algorithm" is a fast artificial evolution-based technique devised for the exploration of parameter space in pattern recognition applications. In the application...
Jean Louchet, Maud Guyon, Marie-Jeanne Lesot, Amin...
VLDB
2007
ACM
155views Database» more  VLDB 2007»
16 years 6 months ago
Towards Graph Containment Search and Indexing
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
Chen Chen, Xifeng Yan, Philip S. Yu, Jiawei Han, D...