5100 search results - page 697 / 1020 » The Linear Complexity of a Graph |
171
click to vote
MTDT
2000
IEEE
15 years 11 months ago
2000
IEEE
In this work, we present the application of Generalized Linear Feedback Shift Registers (GLFSRs) for generation of patterns for pseudo-random memory Built-In SelfTest (BIST). Rece...
161
click to vote
CCA
2000
Springer
15 years 11 months ago
2000
Springer
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, ...
154
click to vote
ICCV
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper deals with the concept of auto-calibration, i.e. methods to calibrate a camera on-line. In particular, we deal with minimal conditions on the intrinsic parameters neede...
133
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
187
click to vote
COMPGEOM
1998
ACM
15 years 11 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...