1986 search results - page 348 / 398 » Path Separability of Graphs |
124
click to vote
BTW
1999
Springer
15 years 6 months ago
1999
Springer
Abstract: Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a singl...
124
click to vote
POPL
1996
ACM
15 years 6 months ago
1996
ACM
that defines abstract costs for measuring or analyzing the performance of computations, (2) to supply the users with a mapping of these costs onto runtimes on various machine model...
117
click to vote
STACS
1997
Springer
15 years 6 months ago
1997
Springer
Exotic semirings such as the “(max, +) semiring” (R ∪ {−∞}, max, +), or the “tropical semiring” (N ∪ {+∞}, min, +), have been invented and reinvented many times s...
123
click to vote
ESA
1994
Springer
15 years 6 months ago
1994
Springer
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
111
click to vote
ACISP
2007
Springer
15 years 6 months ago
2007
Springer
This paper studies the interplay of network connectivity and perfectly secure message transmission under the corrupting influence of a Byzantine mobile adversary that may move from...