4052 search results - page 751 / 811 » Using RDF to describe networks |
IJFCS
2006
14 years 9 months ago
2006
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Admission control as a mechanism for providing QoS requires an accurate description of the requested flow as well as already admitted flows. Since 802.11 WLAN capacity is shared...
WS
2010
ACM
14 years 8 months ago
2010
ACM
One of the most important decisions researchers face when analyzing software systems is the choice of a proper data analysis/exchange format. In this paper, we present EvoOnt, a s...
103
click to vote
WWW
2011
ACM
14 years 4 months ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
211
click to vote
SACMAT
2011
ACM
14 years 18 days ago
2011
ACM
In this paper, we present an approach for identity and access management (IAM) in the context of (cross-organizational) serviceoriented architectures (SOA). In particular, we de...