Sciweavers

455 search results - page 32 / 91
» On Trees and Noncrossing Partitions
Sort
View
DCG
2002
71views more  DCG 2002»
13 years 7 months ago
A Polytope Related to Empirical Distributions, Plane Trees, Parking Functions, and the Associahedron
The volume of the n-dimensional polytope nx := fy 2 Rn : yi 0 and y1 + + yi x1 + + xi for all 1 i ng for arbitrary x := x1; : : : ; xn with xi 0 for all i de nes a polyn...
Richard P. Stanley, Jim Pitman
GIS
2009
ACM
14 years 2 months ago
Tree detection from aerial imagery
We propose an automatic approach to tree detection from aerial imagery. First a pixel-level classifier is trained to assign a {tree, non-tree} label to each pixel in an aerial im...
Lin Yang, Xiaqing Wu, Emil Praun, Xiaoxu Ma
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
13 years 11 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
ALGORITHMICA
1999
112views more  ALGORITHMICA 1999»
13 years 7 months ago
Suffix Trees on Words
We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural partitioning into m multicharacter substrings or words. This ...
Arne Andersson, N. Jesper Larsson, Kurt Swanson
SDM
2007
SIAM
139views Data Mining» more  SDM 2007»
13 years 9 months ago
Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
Barna Saha, Pabitra Mitra