845 search results - page 21 / 169 » Connecting Many-Sorted Theories |
JUCS
2000
13 years 8 months ago
2000
Abstract: A study of the classes of nite relations as enriched strict monoidal categories is presented in CaS91]. The relations there are interpreted as connections in owchart sche...
HT
2009
ACM
14 years 3 months ago
2009
ACM
Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of c...
DM
2008
13 years 8 months ago
2008
In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial tim...
MOBICOM
2009
ACM
14 years 3 months ago
2009
ACM
We address the connectivity of large-scale ad hoc cognitive radio networks, where secondary users exploit channels temporarily and locally unused by primary users and the existenc...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
—To understand how node mobility and Byzantine node failures affect connectivity of wireless multi-hop networks, this paper investigates resilience of geometric random graphs to ...