19866 search results - page 326 / 3974 » Computing all factorizations in *** |
153
click to vote
SPDP
1990
IEEE
15 years 10 months ago
1990
IEEE
This paper provides lower bounds on the energy consumption and demonstrates an energy-time trade-off in optical computations. All the lower bounds are shown to have the matching u...
171
click to vote
TCC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We study the necessary and sufficient assumptions for universally composable (UC) computation, both in terms of setup and computational assumptions. We look at the common...
171
click to vote
SIGCSE
1998
ACM
15 years 11 months ago
1998
ACM
We present a series of programming exercises that use scaling as a theme for teaching design techniques in the introductory computer science course sequence. All exercises are on ...
161
Voted
CIIA
2009
15 years 7 months ago
2009
: Technology has emerged almost all the domains in our daily life. In computational linguistics, the uses of electronic corpora are very important. Nowadays it is possible to study...
141
click to vote
AML
2010
15 years 6 months ago
2010
Defining the degree of categoricity of a computable structure M to be the least degree d for which M is d-computably categorical, we investigate which Turing degrees can be realiz...