Sciweavers

CVIU
2008
82views more  CVIU 2008»
13 years 9 months ago
Shape matching and registration by data-driven EM
In this paper, we present an efficient and robust algorithm for shape matching, registration, and detection. The task is to geometrically transform a source shape to fit a target ...
Zhuowen Tu, Songfeng Zheng, Alan L. Yuille
DSP
2010
13 years 9 months ago
A diffusion framework for detection of moving vehicles
Automatic acoustic-based vehicle detection is a common task in security and surveillance systems. Usually, a recording device is placed in a designated area and a hardware/softwar...
Alon Schclar, Amir Averbuch, N. Rabin, Valery A. Z...
CSE
2008
IEEE
13 years 9 months ago
Sampling Binary Contingency Tables
We study the problem of counting and randomly sampling binary contingency tables. For given row and column sums, we are interested in approximately counting (or sampling) 0/1 n
Ivona Bezáková
CSDA
2008
122views more  CSDA 2008»
13 years 9 months ago
Time-adaptive quantile regression
An algorithm for time-adaptive quantile regression is presented. The algorithm is based on the simplex algorithm, and the linear optimization formulation of the quantile regressio...
Jan Kloppenborg Møller, Henrik Aalborg Niel...
CORR
2008
Springer
82views Education» more  CORR 2008»
13 years 9 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard
CORR
2008
Springer
187views Education» more  CORR 2008»
13 years 9 months ago
Efficient Interpolation in the Guruswami-Sudan Algorithm
A novel algorithm is proposed for the interpolation step of the Guruswami
Peter Trifonov
DC
2010
13 years 9 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
DC
2010
13 years 9 months ago
Distributed algorithms for ultrasparse spanners and linear size skeletons
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
Seth Pettie
CORR
2008
Springer
111views Education» more  CORR 2008»
13 years 9 months ago
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
David Eppstein, Michael T. Goodrich, Darren Strash
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 9 months ago
A Spectral Algorithm for Learning Hidden Markov Models
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
Daniel Hsu, Sham M. Kakade, Tong Zhang