70 search results - page 11 / 14 » On low degree k-ordered graphs |
158
Voted
SPAA
2005
ACM
15 years 11 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
160
click to vote
ICDCS
2006
IEEE
16 years 1 days ago
2006
IEEE
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
219
click to vote
TC
2011
15 years 28 days ago
2011
—Aggressive technology scaling to 45nm and below introduces serious reliability challenges to the design of microprocessors. Since a large fraction of chip area is devoted to on-...
185
click to vote
SETA
2004
Springer
15 years 11 months ago
2004
Springer
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n =...
170
click to vote
TROB
2008
15 years 5 months ago
2008
This paper presents a vision-based approach to SLAM in indoor / outdoor environments with minimalistic sensing and computational requirements. The approach is based on a graph repr...