829 search results - page 152 / 166 » Distance domination-critical graphs |
CCCG
2008
14 years 11 months ago
2008
Let G be a graph embedded in the L1-plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio LG 1 (p, q)/L1(p, q), where LG 1 (p...
IAAI
2003
14 years 11 months ago
2003
Pattern matching for intelligence organizations is a challenging problem. The data sets are large and noisy, and there is a flexible and constantly changing notion of what consti...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
COLING
2000
14 years 11 months ago
2000
The Korean Combinatory Categorial Grammar (KCCG) tbrmalism can unitbrmly handle word order variation among arguments and adjuncts within a clause as well as in complex clauses and...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We propose two statistical tests to determine if two samples are from different distributions. Our test statistic is in both cases the distance between the means of the two sample...