409 search results - page 80 / 82 » Polynomial Time Approximation Schemes and Parameterized Comp... |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
JISE
2010
13 years 2 months ago
2010
In dealing with large datasets the reduced support vector machine (RSVM) was proposed for the practical objective to overcome the computational difficulties as well as to reduce t...
ICDAR
2011
IEEE
12 years 7 months ago
2011
IEEE
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...
ECCV
2002
Springer
14 years 9 months ago
2002
Springer
Visual sensors provide exclusively uncertain and partial knowledge of a scene. In this article, we present a suitable scene knowledge representation that makes integration and fusi...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...