Sciweavers

1664 search results - page 272 / 333
» Distance labeling in graphs
Sort
View
SODA
2004
ACM
87views Algorithms» more  SODA 2004»
15 years 1 months ago
Optimal space lower bounds for all frequency moments
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...
David P. Woodruff
COLING
2000
15 years 1 months ago
Structural disambiguation of morpho-syntactic categorial parsing for Korean
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...
Jeongwon Cha, Gary Geunbae Lee
CORR
2008
Springer
130views Education» more  CORR 2008»
14 years 12 months ago
A Kernel Method for the Two-Sample Problem
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...
Arthur Gretton, Karsten M. Borgwardt, Malte J. Ras...
VC
2008
94views more  VC 2008»
14 years 11 months ago
Virtual world explorations by using topological and semantic knowledge
This paper is dedicated to virtual world exploration techniques. Automatic camera control is important in many fields as computational geometry, visual servoing, robot motion, grap...
Dmitry Sokolov, Dimitri Plemenos
CPC
2002
80views more  CPC 2002»
14 years 11 months ago
The Wiener Index Of Random Trees
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
Ralph Neininger