Sciweavers

3641 search results - page 394 / 729
» On Computability of Pattern Recognition Problems
Sort
View
TODS
2002
92views more  TODS 2002»
15 years 4 months ago
Searching in metric spaces with user-defined and approximate distances
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
Paolo Ciaccia, Marco Patella
CIKM
2010
Springer
15 years 3 months ago
A method for discovering components of human rituals from streams of sensor data
This paper describes an algorithm for determining if an event occurs persistently within an interval where the interval is periodic but the event is not. The goal of the algorithm...
Athanasios Bamis, Jia Fang, Andreas Savvides
JMLR
2010
155views more  JMLR 2010»
14 years 11 months ago
Structured Sparse Principal Component Analysis
We present an extension of sparse PCA, or sparse dictionary learning, where the sparsity patterns of all dictionary elements are structured and constrained to belong to a prespeci...
Rodolphe Jenatton, Guillaume Obozinski, Francis Ba...
ICASSP
2011
IEEE
14 years 8 months ago
Kernel cross-modal factor analysis for multimodal information fusion
This paper presents a novel approach for multimodal information fusion. The proposed method is based on kernel cross-modal factor analysis (KCFA), in which the optimal transformat...
Yongjin Wang, Ling Guan, Anastasios N. Venetsanopo...
DASFAA
2007
IEEE
174views Database» more  DASFAA 2007»
15 years 11 months ago
Efficient Holistic Twig Joins in Leaf-to-Root Combining with Root-to-Leaf Way
Finding all the occurrences of a twig pattern on multiple elements in an XML document is a core operation for efficient evaluation of XML queries. Holistic twig join algorithms, Tw...
Guoliang Li, Jianhua Feng, Yong Zhang, Lizhu Zhou