2489 search results - page 241 / 498 » On the Subgroup Distance Problem |
144
click to vote
DCOSS
2009
Springer
15 years 9 months ago
2009
Springer
We study the problem of computing a family of connected dominating sets in wireless sensor networks (WSN) in a distributed manner. A WSN is modelled as a unit disk graph G = (V, E)...
152
click to vote
STACS
2009
Springer
15 years 9 months ago
2009
Springer
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials ...
152
click to vote
AVBPA
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. A common problem in fingerprint recognition is the existence of false minutiae which increase both FAR and FRR in fingerprint matching. In this paper, a robust minutiae...
131
click to vote
PG
1998
IEEE
15 years 9 months ago
1998
IEEE
The construction of shape spaces is studied from a mathematical and a computational viewpoint. A program is outlined reducing the problem to four tasks: the representation of geom...
116
click to vote
AMDO
2006
Springer
15 years 8 months ago
2006
Springer
We present a theoretical and computational framework for matching of two-dimensional articulated shapes. Assuming that articulations can be modeled as near-isometries, we show an a...