2938 search results - page 70 / 588 » On obfuscating point functions |
168
click to vote
TCAD
1998
15 years 5 months ago
1998
—Conventional scan design imposes considerable area and delay overheads. To establish a scan chain in the test mode, multiplexers at the inputs of flip-flops and scan wires are...
164
click to vote
ICCV
2009
IEEE
15 years 3 months ago
2009
IEEE
We present a taxonomy for local distance functions where most existing algorithms can be regarded as approximations of the geodesic distance defined by a metric tensor. We categor...
216
click to vote
ARITH
2001
IEEE
15 years 9 months ago
2001
IEEE
We give the results of our search for the worst cases for correct rounding of the major elementary functions in double precision floating-point arithmetic. These results allow the...
157
click to vote
WER
2001
Springer
15 years 10 months ago
2001
Springer
Although Non-Functional Requirements (NFR) have been present in many software development methods, they have been faced as a second or even third class type of requirement, frequen...
144
click to vote
CSDA
2007
15 years 6 months ago
2007
Given a sample of n observations y1, . . . , yn at time points t1, . . . , tn we consider the problem of specifying a function ˜f such that ˜f • is smooth, • fits the data ...