4926 search results - page 106 / 986 » Two Graph Algorithms On an Associative Computing Model |
108
click to vote
DCOSS
2008
Springer
15 years 4 months ago
2008
Springer
This paper studies the problem of associating deterministically a track revealed by a binary sensor network with the trajectory of a unique moving anonymous object, namely the Mult...
158
click to vote
MOBICOM
2006
ACM
15 years 8 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
130
click to vote
INFOCOM
2005
IEEE
15 years 8 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
135
click to vote
INFOCOM
2000
IEEE
15 years 6 months ago
2000
IEEE
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
124
Voted
RSS
2007
15 years 3 months ago
2007
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...