359 search results - page 50 / 72 » Online Algorithms for Disk Graphs |
73
Voted
CSR
2009
Springer
15 years 6 months ago
2009
Springer
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
JGAA
2007
14 years 11 months ago
2007
We introduce a new graph drawing convention for 2.5D hierarchical drawings of directed graphs. The vertex set is partitioned both into layers of vertices drawn in parallel planes ...
115
click to vote
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
In this work, we present a novel segmentation method for deformable objects in monocular videos. Firstly we introduce the dynamic shape to represent the prior knowledge about obje...
103
Voted
ATMOS
2007
15 years 1 months ago
2007
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...
168
click to vote
ICDE
1999
IEEE
16 years 1 months ago
1999
IEEE
An increasing number of database applications require online access to massive amounts of data. Since large-scale storage systems implemented entirely on magnetic disk can be impr...