Sciweavers

6045 search results - page 335 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
COLING
2010
15 years 2 months ago
A Comparative Study on Ranking and Selection Strategies for Multi-Document Summarization
This paper presents a comparative study on two key problems existing in extractive summarization: the ranking problem and the selection problem. To this end, we presented a system...
Feng Jin, Minlie Huang, Xiaoyan Zhu
DCC
2011
IEEE
15 years 2 months ago
Tree Structure Compression with RePair
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which a...
Markus Lohrey, Sebastian Maneth, Roy Mennicke
ICCV
2011
IEEE
14 years 7 months ago
Physically-based Motion Models for 3D Tracking: A Convex Formulation
In this paper, we propose a physically-based dynamical model for tracking. Our model relies on Newton’s second law of motion, which governs any real-world dynamical system. As a...
Mathieu Salzmann, Raquel Urtasun
CVPR
2012
IEEE
13 years 10 months ago
Multitarget data association with higher-order motion models
We present an iterative approximate solution to the multidimensional assignment problem under general cost functions. The method maintains a feasible solution at every step, and i...
Robert T. Collins
APPROX
2006
Springer
121views Algorithms» more  APPROX 2006»
15 years 11 months ago
A Randomized Solver for Linear Systems with Exponential Convergence
Abstract. The Kaczmarz method for solving linear systems of equations Ax = b is an iterative algorithm that has found many applications ranging from computer tomography to digital ...
Thomas Strohmer, Roman Vershynin