Sciweavers

733 search results - page 112 / 147
» Learning Riemannian Metrics
Sort
View
ICPR
2010
IEEE
13 years 9 months ago
Lipreading: A Graph Embedding Approach
In this paper, we propose a novel graph embedding method for the problem of lipreading. To characterize the temporal connections among video frames of the same utterance, a new di...
Ziheng Zhou, Guoying Zhao, Matti Pietikäinen
DAS
2010
Springer
13 years 9 months ago
Overlapped text segmentation using Markov random field and aggregation
Separating machine printed text and handwriting from overlapping text is a challenging problem in the document analysis field and no reliable algorithms have been developed thus f...
Xujun Peng, Srirangaraj Setlur, Venu Govindaraju, ...
COLING
2008
13 years 9 months ago
A Local Alignment Kernel in the Context of NLP
This paper discusses local alignment kernels in the context of the relation extraction task. We define a local alignment kernel based on the Smith-Waterman measure as a sequence s...
Sophia Katrenko, Pieter W. Adriaans
IJCAI
2007
13 years 9 months ago
Computing Semantic Relatedness Using Wikipedia-based Explicit Semantic Analysis
Computing semantic relatedness of natural language texts requires access to vast amounts of common-sense and domain-specific world knowledge. We propose Explicit Semantic Analysi...
Evgeniy Gabrilovich, Shaul Markovitch
SODA
2007
ACM
145views Algorithms» more  SODA 2007»
13 years 9 months ago
Aggregation of partial rankings, p-ratings and top-m lists
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...
Nir Ailon