4744 search results - page 198 / 949 » Connected Computing |
163
click to vote
DAM
2006
15 years 7 months ago
2006
Abstract. In this paper we present an algorithm for the problem of exhaustive equivalence-free generation of 3-connected matroids which are represented by a matrix over some finite...
198
click to vote
ADG
1998
Springer
15 years 11 months ago
1998
Springer
This paper reviews and evaluates three main techniques for automated geometry diagram construction: synthetic methods, numerical computation methods, and symbolic computation metho...
207
Voted
MOBIHOC
2009
ACM
16 years 1 months ago
2009
ACM
Low-connectivity and full-coverage three dimensional Wireless Sensor Networks (WSNs) have many real-world applications. By low connectivity, we mean there are at least k disjoint ...
220
Voted
IPPS
2006
IEEE
16 years 1 months ago
2006
IEEE
The following three questions should be answered in developing new topology with more powerful ability to tolerate node-failure in wireless sensor network. First, what is node-fai...
201
click to vote
HPCA
1995
IEEE
15 years 10 months ago
1995
IEEE
—Reducing communication latency, which is a performance bottleneck in optically interconnected multiprocessor systems, is of prominent importance. A conventional approach for est...