Sciweavers

398 search results - page 5 / 80
» Critical exponents of graphs
Sort
View
ACCV
2009
Springer
14 years 4 months ago
Skeleton Graph Matching Based on Critical Points Using Path Similarity
This paper proposes a novel graph matching algorithm based on skeletons and applies it to shape recognition based on object silhouettes. The main idea is to match the critical poin...
Yao Xu, Bo Wang, Wenyu Liu, Xiang Bai
CORR
2006
Springer
88views Education» more  CORR 2006»
13 years 9 months ago
A Graph-based Framework for Transmission of Correlated Sources over Broadcast Channels
Abstract-- In this paper we consider the communication problem that involves transmission of correlated sources over broadcast channels. We consider a graph-based framework for thi...
Suhan Choi, S. Sandeep Pradhan
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 9 months ago
Locating phase transitions in computationally hard problems
We discuss how phase-transitions may be detected in computationally hard problems in the context of anytime algorithms. Treating the computational time, value and utility functions...
B. Ashok, T. K. Patra
CPC
2008
59views more  CPC 2008»
13 years 9 months ago
On a Form of Coordinate Percolation
Let ai, bi, i = 0, 1, 2, . . . be drawn uniformly and independently from the unit interval, and let t be a fixed real number. Let a site (i, j) N2 be open if ai + bj t, and clos...
Elizabeth R. Moseman, Peter Winkler
ICIP
2010
IEEE
13 years 7 months ago
Local two-channel critically sampled filter-banks on graphs
In this paper, we propose two-channel filter-bank designs for signals defined on arbitrary graphs. These filter-banks are local, invertible and critically sampled. Depending on th...
Sunil K. Narang, Antonio Ortega