2771 search results - page 151 / 555 » A General Computational Treatment of the Comparative |
202
click to vote
DPPI
2007
ACM
15 years 10 months ago
2007
ACM
This paper focuses on the design of pleasurably playful interfaces within an interactive art context. It describes the development of a framework of thirteen pleasures of play and ...
158
click to vote
CVPR
2004
IEEE
15 years 10 months ago
2004
IEEE
In the paper, we study the problem of optimal matching of two generalized functions (distributions) via a diffeomorphic transformation of the ambient space. In the particular case...
193
click to vote
DAC
2004
ACM
15 years 10 months ago
2004
ACM
This paper presents a method of generating tests for transition faults using tests for stuck-at faults such that the peak power is the minimum possible using a given set of tests ...
182
click to vote
STACS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
167
click to vote
ICS
1995
Tsinghua U.
15 years 10 months ago
1995
Tsinghua U.
Modulo scheduling is an e cient technique for exploiting instruction level parallelism in a variety of loops, resulting in high performance code but increased register requirement...