Sciweavers

3396 search results - page 444 / 680
» Tree representations of graphs
Sort
View
CLASSIFICATION
2008
84views more  CLASSIFICATION 2008»
15 years 6 months ago
Degenerating Families of Dendrograms
Dendrograms used in data analysis are ultrametric spaces, hence objects of nonarchimedean geometry. It is known that there exist p-adic representations of dendrograms. Completed b...
Patrick Erik Bradley
CVIU
2004
131views more  CVIU 2004»
15 years 6 months ago
Part-level object recognition using superquadrics
This paper proposes a technique for object recognition using superquadric built models. Superquadrics, which are three-dimensional models suitable for part-level representation of...
Jaka Krivic, Franc Solina
ACL
2010
15 years 4 months ago
Detecting Errors in Automatically-Parsed Dependency Relations
We outline different methods to detect errors in automatically-parsed dependency corpora, by comparing so-called dependency rules to their representation in the training data and ...
Markus Dickinson
IWPEC
2009
Springer
16 years 1 months ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 10 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger