359 search results - page 53 / 72 » Online Algorithms for Disk Graphs |
PODC
2006
ACM
15 years 5 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
TOSN
2010
14 years 10 months ago
2010
Boundary recognition is an important and challenging issue in wireless sensor networks when no coordinates or distances are available. The distinction between inner and boundary n...
ICIP
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper describes a new framework for the automated tracking of the central retinal vein in retinal images. The procedure first computes a binary image of the retinal vasculatur...
KI
2009
Springer
15 years 6 months ago
2009
Springer
This paper presents a sequential state estimation method with arbitrary probabilistic models expressing the system’s belief. Probabilistic models can be estimated by Maximum a po...
111
click to vote
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...