1209 search results - page 128 / 242 » Approximation by pseudo-linear operators |
127
click to vote
PKC
2007
Springer
15 years 10 months ago
2007
Springer
Damg˚ard et al. [11] showed a novel technique to convert a polynomial sharing of secret a into the sharings of the bits of a in constant rounds, which is called the bit-decomposit...
128
click to vote
SEMWEB
2007
Springer
15 years 10 months ago
2007
Springer
Abstract The most common matching applications, e.g., ontology matching, focus on the computation of the correspondences holding between the nodes of graph structures (e.g., concep...
172
Voted
SMI
2006
IEEE
15 years 10 months ago
2006
IEEE
One of the challenges in geometry processing is to automatically reconstruct a higher-level representation from raw geometric data. For instance, computing a parameterization of a...
143
click to vote
ASAP
2005
IEEE
15 years 10 months ago
2005
IEEE
With continued reductions in feature size, additional functionality may be added to future microprocessors to boost the performance of important application domains. Due to growth...
140
click to vote
ICLP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Information about the nondeterminism behavior of a functional logic program is important for various reasons. For instance, a nondeterministic choice in I/O operations re...