2938 search results - page 469 / 588 » On obfuscating point functions |
153
click to vote
DM
2008
15 years 6 months ago
2008
Fix nonnegative integers n1, . . . , nd and let L denote the lattice of integer points (a1, . . . , ad) Zd satisfying 0 ai ni for 1 i d. Let L be partially ordered by the usua...
182
click to vote
EJC
2008
15 years 6 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
175
click to vote
ENTCS
2008
15 years 6 months ago
2008
A lot of progress has been made to secure network communication, e.g., through the use of cryptographic algorithms. However, this offers only a partial solution as long as the com...
161
click to vote
EOR
2008
15 years 6 months ago
2008
We study the market partition between two distinct firms that deliver services to waiting time sensitive customers. In our model, the incoming customers select a firm on the basis...
157
click to vote
CJ
2006
15 years 6 months ago
2006
Operations on spatial objects have much individuality. As a consequence, the spatial data modelling approaches, which have been proposed, have to consider either data types of the...