777 search results - page 65 / 156 » A fast algorithm for the computation of an upper bound on th... |
GD
2005
Springer
14 years 1 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
CSR
2010
Springer
14 years 14 days ago
2010
Springer
Let πw denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A [1 . . n], is there a w...
MOBIHOC
2006
ACM
14 years 7 months ago
2006
ACM
To date, topology control in wireless ad hoc and sensor networks--the study of how to compute from the given communication network a subgraph with certain beneficial properties--h...
FOCS
1999
IEEE
13 years 12 months ago
1999
IEEE
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
ITA
2002
13 years 7 months ago
2002
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the be...