720 search results - page 139 / 144 » Linear k-arboricities on trees |
VLDB
1999
ACM
14 years 25 days ago
1999
ACM
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
PODS
1994
ACM
14 years 19 days ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
WADS
1993
Springer
14 years 19 days ago
1993
Springer
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere ...
TAGT
1994
Springer
14 years 19 days ago
1994
Springer
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
COMPGEOM
2007
ACM
14 years 15 days ago
2007
ACM
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...