4451 search results - page 632 / 891 » On Random Ordering Constraints |
168
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
190
click to vote
ICB
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Fingerprints are considered to be unique because they contain various distinctive features, including minutiae, ridges, pores, etc. Some attempts have been made to model ...
185
click to vote
ASPDAC
2009
ACM
16 years 1 months ago
2009
ACM
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
160
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
171
click to vote
ARC
2010
Springer
16 years 1 months ago
2010
Springer
Physical Unclonable Functions promise cheap, efficient, and secure identification and authentication of devices. In FPGA devices, PUFs may be instantiated directly from FPGA fabri...