103 search results - page 16 / 21 » Adaptive Matching Based Kernels for Labelled Graphs |
SIGIR
2008
ACM
13 years 7 months ago
2008
ACM
Ranking algorithms, whose goal is to appropriately order a set of objects/documents, are an important component of information retrieval systems. Previous work on ranking algorith...
DAGM
2009
Springer
14 years 2 months ago
2009
Springer
High-speed smooth and accurate visual tracking of objects in arbitrary, unstructured environments is essential for robotics and human motion analysis. However, building a system th...
LREC
2008
13 years 9 months ago
2008
We propose two general and robust methods for enriching resources annotated in the Frame Semantic paradigm with syntactic dependency graphs, which can provide useful additional in...
PAMI
2010
13 years 2 months ago
2010
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
WDAG
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...