Sciweavers

240 search results - page 41 / 48
» The Kernel Trick for Distances
Sort
View
ALMOB
2006
110views more  ALMOB 2006»
13 years 7 months ago
Computing distribution of scale independent motifs in biological sequences
The use of Chaos Game Representation (CGR) or its generalization, Universal Sequence Maps (USM), to describe the distribution of biological sequences has been found objectionable ...
Jonas S. Almeida, Susana Vinga
ECML
2004
Springer
14 years 1 months ago
The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
Marco Saerens, François Fouss, Luh Yen, Pie...
ICCV
2009
IEEE
15 years 18 days ago
Heterogeneous Feature Machines for Visual Recognition
With the recent efforts made by computer vision researchers, more and more types of features have been designed to describe various aspects of visual characteristics. Modeling s...
Liangliang Cao, Jiebo Luo, Feng Liang, Thomas S. H...
CVPR
2007
IEEE
14 years 9 months ago
A Graph Cut Approach to Image Segmentation in Tensor Space
This paper proposes a novel method to apply the standard graph cut technique to segmenting multimodal tensor valued images. The Riemannian nature of the tensor space is explicitly...
Allen Tannenbaum, James G. Malcolm, Yogesh Rathi
CVPR
2008
IEEE
14 years 9 months ago
Beyond sliding windows: Object localization by efficient subwindow search
Most successful object recognition systems rely on binary classification, deciding only if an object is present or not, but not providing information on the actual object location...
Christoph H. Lampert, Matthew B. Blaschko, Thomas ...