Sciweavers

2878 search results - page 218 / 576
» Learning the Common Structure of Data
Sort
View
JSAC
2010
146views more  JSAC 2010»
14 years 11 months ago
NLOS identification and mitigation for localization based on UWB experimental data
Abstract--Sensor networks can benefit greatly from locationawareness, since it allows information gathered by the sensors to be tied to their physical locations. Ultra-wide bandwid...
Stefano Maranò, Wesley M. Gifford, Henk Wym...
SODA
1998
ACM
113views Algorithms» more  SODA 1998»
15 years 5 months ago
Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
David Eppstein
ACCV
2010
Springer
14 years 11 months ago
Unsupervised Selective Transfer Learning for Object Recognition
Abstract. We propose a novel unsupervised transfer learning framework that utilises unlabelled auxiliary data to quantify and select the most relevant transferrable knowledge for r...
Wei-Shi Zheng, Shaogang Gong, Tao Xiang
CVPR
2007
IEEE
16 years 6 months ago
Image Classification with Segmentation Graph Kernels
We propose a family of kernels between images, defined as kernels between their respective segmentation graphs. The kernels are based on soft matching of subtree-patterns of the r...
Francis Bach, Zaïd Harchaoui
JMLR
2000
134views more  JMLR 2000»
15 years 4 months ago
Learning with Mixtures of Trees
This paper describes the mixtures-of-trees model, a probabilistic model for discrete multidimensional domains. Mixtures-of-trees generalize the probabilistic trees of Chow and Liu...
Marina Meila, Michael I. Jordan