1347 search results - page 81 / 270 » On the Structure of the Minimum Time Function |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
EDBT
2008
ACM
14 years 9 months ago
2008
ACM
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
ICCS
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. Recently, the distributed real-time services are developing in distributed object computing environments in a way that can support a new programming paradigm of the distr...
ISCA
2005
IEEE
14 years 2 months ago
2005
IEEE
Increased power densities (and resultant temperatures) and other effects of device scaling are predicted to cause significant lifetime reliability problems in the near future. In...
WWW
2006
ACM
14 years 9 months ago
2006
ACM
We introduce a new, powerful class of text proximity queries: find an instance of a given "answer type" (person, place, distance) near "selector" tokens matchi...