5100 search results - page 618 / 1020 » The Linear Complexity of a Graph |
199
Voted
SPAA
2005
ACM
16 years 1 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
210
click to vote
DIALM
2004
ACM
16 years 1 months ago
2004
ACM
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...
187
Voted
IWPEC
2004
Springer
16 years 1 months ago
2004
Springer
Consider the following problem, that we call “Chordless Path through Three Vertices” or CP3V, for short: Given a simple undirected graph G = (V, E), a positive integer k, and t...
231
Voted
ICRA
2003
IEEE
16 years 28 days ago
2003
IEEE
In this paper we present a probabilistic framework for the reduction in the uncertainty of a moving robot pose during exploration by using a second robot to assist. A Monte Carlo ...
209
Voted
AGTIVE
2003
Springer
16 years 27 days ago
2003
Springer
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...