905 search results - page 94 / 181 » On the Complexity of uSPR Distance |
SODA
2004
ACM
14 years 11 months ago
2004
ACM
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
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...
ECIS
2000
14 years 11 months ago
2000
Recent advancements in communication systems enable the collaboration of virtual software design teams, breaking the barriers of time and distance. In this paper we address a criti...
NIPS
1998
14 years 11 months ago
1998
Principal curves have been defined as "self consistent" smooth curves which pass through the "middle" of a d-dimensional probability distribution or data cloud...