Sciweavers

1538 search results - page 191 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
BMCBI
2006
141views more  BMCBI 2006»
15 years 1 months ago
Maximum common subgraph: some upper bound and lower bound results
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
Xiuzhen Huang, Jing Lai, Steven F. Jennings
PAMI
2006
156views more  PAMI 2006»
15 years 1 months ago
Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
Yefeng Zheng, David S. Doermann
109
Voted
TPDS
2008
136views more  TPDS 2008»
15 years 1 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
JVCA
2007
132views more  JVCA 2007»
15 years 1 months ago
Interactive and flexible motion transition
In this paper, we present an example-based motion synthesis technique. Users can interactively control the virtual character to perform desired actions in any order. The desired a...
Jen-Yu Peng, I-Chen Lin, Jui-Hsiang Chao, Yan-Ju C...
CVGIP
2004
121views more  CVGIP 2004»
15 years 1 months ago
Skeleton-driven 2D distance field metamorphosis using intrinsic shape parameters
In this article a novel algorithm is presented for 2D shape interpolation using the intrinsic shape parameters of a piecewise linear curve. The skeletons of two given shapes are c...
WuJun Che, XunNian Yang, GuoZhao Wang