10819 search results - page 87 / 2164 » Addition and multiplication of sets |
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
Let I be a finite set of integers and F be a finite set of maps of the form n → ki n + i with integer coefficients. For an integer base k ≥ 2, we study the k-recognizability ...
CVPR
2000
IEEE
14 years 9 months ago
2000
IEEE
In this paper, we address the problem of curve and surface reconstruction from sets of points. We introduce regular interpolants which are polygonal approximations of planar curve...
ASAP
2004
IEEE
13 years 11 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
With recent advances in sensory and mobile computing technology, enormous amounts of data about moving objects are being collected. One important application with such data is aut...
ITNG
2010
IEEE
13 years 6 months ago
2010
IEEE
—The increase in computational power of off-the-shelf hardware offers more and more advantageous tradeoffs among efficiency, cost and availability, thus enhancing the feasibil...