101 search results - page 12 / 21 » An Algorithm to Find a Perfect Map for Graphoid Structures |
ICIP
2008
IEEE
14 years 10 months ago
2008
IEEE
Subspace learning techniques are widespread in pattern recognition research. They include PCA, ICA, LPP, etc. These techniques are generally linear and unsupervised. The problem o...
ICML
1994
IEEE
14 years 2 days ago
1994
IEEE
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
TSP
2008
13 years 8 months ago
2008
We study a sampling setup where a continuous-time signal is mapped by a memoryless, invertible and nonlinear transformation, and then sampled in a nonideal manner. Such scenarios a...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
13 years 8 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...