344 search results - page 29 / 69 » On the Discrete Symmetric Localization Problem |
HYBRID
2009
Springer
15 years 5 months ago
2009
Springer
In this paper, we present an automatable decompositional method for the computation of Lyapunov functions for hybrid systems with complex discrete state spaces. We use graph-based ...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
abstract Subhash Khot Assaf Naor In the kernel clustering problem we are given a (large) n ? n symmetric positive semidefinite matrix A = (aij) with n i=1 n j=1 aij = 0 and a (sma...
117
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
State of the art methods for image and object re-
trieval exploit both appearance (via visual words) and
local geometry (spatial extent, relative pose). In large
scale problems,...
ALGORITHMICA
2010
14 years 10 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
AVSS
2006
IEEE
15 years 4 months ago
2006
IEEE
In this paper we address the spatial activity recognition problem with an algorithm based on Smith-Waterman (SW) local alignment. The proposed SW approach utilises dynamic program...