Sciweavers

332 search results - page 40 / 67
» Compositions of Graphs Revisited
Sort
View
ESWS
2007
Springer
14 years 11 days ago
Functional Programs as Linked Data
The idea of linked programs, or procedural RDF metadata, has not been deeply explored. This paper introduces a dedicated scripting language for linked data, called Ripple, whose pr...
Joshua Shinavier
APVIS
2008
13 years 10 months ago
Visual Statistics for Collections of Clustered Graphs
We propose a method to visually summarize collections of networks on which a clustering of the vertices is given. Our method allows for efficient comparison of individual networks...
Ulrik Brandes, Jürgen Lerner, Miranda J. Lubb...
EWSN
2010
Springer
14 years 5 months ago
Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks
The simplicity and low-overhead of random walks have made them a popular querying mechanism for Wireless Sensor Networks. However, most of the related work is of theoretical nature...
Marco Zuniga, Chen Avin, Manfred Hauswirth
ICALP
2004
Springer
14 years 1 months ago
Simple Permutations Mix Well
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
Shlomo Hoory, Avner Magen, Steven Myers, Charles R...
JSW
2008
167views more  JSW 2008»
13 years 8 months ago
An Approach to Discover Dependencies between Service Operations
Service composition is emerging as an important paradigm for constructing distributed applications by combining and reusing independently developed component services. One key issu...
Shuying Yan, Jing Wang 0002, Chen Liu, Lei Liu