Sciweavers

1529 search results - page 231 / 306
» A slant removal algorithm
Sort
View
ISAAC
2005
Springer
97views Algorithms» more  ISAAC 2005»
15 years 10 months ago
A Min-Max Relation on Packing Feedback Vertex Sets
Let G be a graph with a nonnegative integral function w defined on V (G). A collection F of subsets of V (G) (repetition is allowed) is called a feedback vertex set packing in G ...
Xujin Chen, Guoli Ding, Xiaodong Hu, Wenan Zang
150
Voted
ISVC
2005
Springer
15 years 10 months ago
Structural and Textural Skeletons for Noisy Shapes
The extraction of consistent skeletons in the presence of boundary noise is still a problem for most skeletonization algorithms. Many suppress skeletons associated with boundary pe...
Wooi-Boon Goh, Kai-Yun Chan
MDAI
2005
Springer
15 years 10 months ago
Noise-Robust Watermarking for Numerical Datasets
Watermarking has been used on multimedia for a variety of applications, among which intellectual property protection stands out. However, and in spite of a growing need, very few a...
Francesc Sebé, Josep Domingo-Ferrer, Agusti...
ECCV
2004
Springer
15 years 10 months ago
Null Space Approach of Fisher Discriminant Analysis for Face Recognition
The null space of the within-class scatter matrix is found to express most discriminative information for the small sample size problem (SSSP). The null space-based LDA takes full ...
Wei Liu, Yunhong Wang, Stan Z. Li, Tieniu Tan
GECCO
2004
Springer
15 years 10 months ago
Shortcomings with Tree-Structured Edge Encodings for Neural Networks
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
Gregory Hornby