Sciweavers

970 search results - page 131 / 194
» On encodings of spanning trees
Sort
View
FUIN
2007
95views more  FUIN 2007»
13 years 10 months ago
Compositional Systems over Reducible Networks
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...
Antoni W. Mazurkiewicz
TOMS
2010
106views more  TOMS 2010»
13 years 8 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
CVPR
2011
IEEE
13 years 6 months ago
Nonparametric Density Estimation on A Graph: Learning Framework, Fast Approximation and Application in Image Segmentation
We present a novel framework for tree-structure embedded density estimation and its fast approximation for mode seeking. The proposed method could find diverse applications in co...
Zhiding Yu, Oscar Au, Ketan Tang
COLING
2010
13 years 5 months ago
2D Trie for Fast Parsing
In practical applications, decoding speed is very important. Modern structured learning technique adopts template based method to extract millions of features. Complicated templat...
Xian Qian, Qi Zhang, Xuanjing Huang, Lide Wu
ICCV
2009
IEEE
15 years 3 months ago
Context by Region Ancestry
In this paper, we introduce a new approach for modeling visual context. For this purpose, we consider the leaves of a hierarchical segmentation tree as elementary units. Each le...
Joseph J. Lim, Pablo Arbelaez, Chunhui Gu, and Jit...