Sciweavers

1830 search results - page 72 / 366
» Workshop on Graph Computation Models
Sort
View
CISIS
2009
IEEE
15 years 11 months ago
A Parameter-Based Scheme for Service Composition in Pervasive Computing Environment
Pervasive computing, the new computing paradigm aiming at providing services anywhere at anytime, poses great challenges on dynamic service composition. Existing service compositi...
Zhenghui Wang, Tianyin Xu, Zhuzhong Qian, Sanglu L...
BIRTHDAY
2010
Springer
15 years 5 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
15 years 10 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
VIZSEC
2005
Springer
15 years 9 months ago
Multiple Coordinated Views for Network Attack Graphs
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...
Steven Noel, Michael Jacobs, Pramod Kalapa, Sushil...
ADHOCNOW
2008
Springer
15 years 10 months ago
Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range
Abstract. This paper presents an algorithm for constructing a spanner for ad hoc networks whose nodes have variable transmission range. Almost all previous spanner constructions fo...
David Peleg, Liam Roditty