Sciweavers

187 search results - page 3 / 38
» On the uniform edge-partition of a tree
Sort
View
RSA
2010
108views more  RSA 2010»
14 years 10 months ago
Resolvent of large random graphs
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...
Charles Bordenave, Marc Lelarge
ICPR
2002
IEEE
15 years 4 months ago
Uniformity Testing Using Minimal Spanning Tree
Testing for uniformity of multivariate data is the initial step in exploratory pattern analysis. We propose a new uniformity testing method, which first computes the maximum (sta...
Anil K. Jain, Xiaowei Xu, Tin Kam Ho, Fan Xiao
ALGORITHMICA
2006
96views more  ALGORITHMICA 2006»
14 years 11 months ago
Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics
We present some fundamental structural properties for minimum length networks (known as Steiner minimum trees) interconnecting a given set of points in an environment in which edg...
Marcus Brazil, D. A. Thomas, J. F. Weng, Martin Za...
ICDT
2003
ACM
126views Database» more  ICDT 2003»
15 years 4 months ago
Typechecking Top-Down Uniform Unranked Tree Transducers
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
Wim Martens, Frank Neven
ISAAC
2004
Springer
95views Algorithms» more  ISAAC 2004»
15 years 5 months ago
Flexibility of Steiner Trees in Uniform Orientation Metrics
Marcus Brazil, Pawel Winter, Martin Zachariasen