4377 search results - page 215 / 876 » Mass problems and randomness |
155
click to vote
ITC
1995
IEEE
15 years 10 months ago
1995
IEEE
During built-in self-test (BIST), the set of patterns generated by a pseudo-random pattern generator may not provide a sufficiently high fault coverage. This paper presents a new ...
148
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
186
click to vote
SIAMREV
2010
15 years 1 months ago
2010
Suppose x and y are unit 2-norm n-vectors whose components sum to zero. Let P(x, y) be the polygon obtained by connecting (x1, y1), . . . , (xn, yn), (x1, y1) in order. We say that...
167
click to vote
TSP
2010
15 years 1 months ago
2010
We consider the problem of estimating a deterministic sparse vector x0 from underdetermined measurements Ax0 +w, where w represents white Gaussian noise and A is a given determinis...
164
Voted
ICN
2001
Springer
15 years 11 months ago
2001
Springer
SplitPath is a new application for the easy, well-known and provably secure one-time pad encryption scheme. Two problems hinder the one-time pad scheme from being applied in the ar...