Sciweavers

7913 search results - page 53 / 1583
» Information Collection on a Graph
Sort
View
IPCO
2010
148views Optimization» more  IPCO 2010»
13 years 10 months ago
Prize-Collecting Steiner Network Problems
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
GECCO
2008
Springer
161views Optimization» more  GECCO 2008»
13 years 10 months ago
An evolutionary design technique for collective communications on optimal diameter-degree networks
Scheduling collective communications (CC) in networks based on optimal graphs and digraphs has been done with the use of the evolutionary techniques. Inter-node communication patt...
Jirí Jaros, Vaclav Dvorak
INFOCOM
2010
IEEE
13 years 6 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
VL
2003
IEEE
126views Visual Languages» more  VL 2003»
14 years 2 months ago
Spatial graph grammars for web information transformation
Thispaper presents an approach to spatial specifications for Web information transformation'. Extended from the Reserved Graph Grammar (RGG), a Spatial Graph Grammar (SGG) is...
Mei Kang Qiu, Guang-Lei Song, Jun Kong, Kang Zhang
EDBT
2004
ACM
133views Database» more  EDBT 2004»
14 years 9 months ago
HOPI: An Efficient Connection Index for Complex XML Document Collections
In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2?hop cover of a directed graph introduced by Cohen et al. In contrast to most o...
Ralf Schenkel, Anja Theobald, Gerhard Weikum