2365 search results - page 42 / 473 » All things are connected |
127
click to vote
WG
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
124
click to vote
DIGITALCITIES
2001
Springer
15 years 5 months ago
2001
Springer
As a platform for community networks, public information spaces that mirror the city metaphor are being developed around the world. The aim of digital cities is to pursue a future ...
IJCAI
1997
15 years 2 months ago
1997
This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition...
147
click to vote
NIPS
1993
15 years 2 months ago
1993
The non-linear complexities of neural networks make network solutions difficult to understand. Sanger's contribution analysis is here extended to the analysis of networks aut...
123
click to vote
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
15 years 1 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...