Sciweavers

1756 search results - page 138 / 352
» Directed scale-free graphs
Sort
View
DAM
2010
81views more  DAM 2010»
13 years 8 months ago
The k-in-a-tree problem for graphs of girth at least k
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...
W. Liu, Nicolas Trotignon
ICDAR
2009
IEEE
13 years 5 months ago
Recurrent HMMs and Cursive Handwriting Recognition Graphs
Standard cursive handwriting recognition is based on a language model, mostly a lexicon of possible word hypotheses or character n-grams. The result is a list of word alternatives...
Marc-Peter Schambach
CVPR
2011
IEEE
13 years 4 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
ICIP
2002
IEEE
14 years 9 months ago
Object contour tracking using graph cuts based active contours
In this paper, we present an object contour tracking approach using graph cuts based active contours (GCBAC). Our proposed algorithm does not need any a priori global shape model,...
Ning Xu, Narendra Ahuja
DAC
2007
ACM
14 years 9 months ago
Multiprocessor Resource Allocation for Throughput-Constrained Synchronous Dataflow Graphs
Abstract. Embedded multimedia systems often run multiple time-constrained applications simultaneously. These systems use multiprocessor systems-on-chip of which it must be guarante...
Sander Stuijk, Twan Basten, Marc Geilen, Henk Corp...