11565 search results - page 129 / 2313 » Computing Minimal Mappings |
108
click to vote
VLSID
2006
IEEE
15 years 10 months ago
2006
IEEE
The main result of this paper, proved as a theorem, is that a lower bound on the number of test vectors that detect each fault at least N times is N
136
Voted
ASPLOS
2008
ACM
15 years 6 months ago
2008
ACM
We explore the extent to which newly available CPU-based security technology can reduce the Trusted Computing Base (TCB) for security-sensitive applications. We find that although...
131
click to vote
NAACL
2010
15 years 2 months ago
2010
Extraction of entities from ad creatives is an important problem that can benefit many computational advertising tasks. Supervised and semi-supervised solutions rely on labeled da...
161
click to vote
TCAD
2008
15 years 4 months ago
2008
Abstract--Simplifying a combinational circuit while preserving its range has a variety of applications, such as combinational equivalence checking and random simulation. Previous a...
137
click to vote
ICCV
2001
IEEE
16 years 6 months ago
2001
IEEE
In this paper we investigate the structure and motion problem for calibrated one-dimensional projections of a two-dimensional environment. In a previous paper the structure and mo...