6110 search results - page 437 / 1222 » Approximate Computing |
144
click to vote
NGC
2002
Springer
15 years 6 months ago
2002
Springer
Sequence design is a crucial problem in information-based biotechnology such as DNA-based computation. We introduce a simple strategy named template method that systematically gene...
178
click to vote
TCS
2002
15 years 6 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
205
click to vote
ECCV
2010
Springer
16 years 1 days ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
139
click to vote
SODA
2010
ACM
15 years 5 months ago
2010
ACM
We consider computational aspects of alternating move games, repeated games in which players take actions at alternating time steps rather than playing simultaneously. We show tha...
147
click to vote
VLSID
2002
IEEE
16 years 7 months ago
2002
IEEE
We propose the redundancy identification of wire replacement faults. The solutions rely on the satisfiability (SAT) formulation of redundancy identification, augmented with the me...