9736 search results - page 23 / 1948 » How Fast Can We Compute Products |
144
click to vote
ENTCS
2011
14 years 11 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computation...
133
click to vote
CHI
2006
ACM
16 years 4 months ago
2006
ACM
Within the CHI community there is growing interest in moving beyond cognition and expanding into the social, emotional, and bodily aspects of the human-computer experience. Sex li...
116
click to vote
SAC
2010
ACM
15 years 4 months ago
2010
ACM
Nowadays, the interaction between a product and the user is described using different methods than for product to product communication. This makes it difficult to replace users a...
106
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
Understanding how a single edge deletion can affect the connectivity of a graph amounts to finding the graph bridges. But when faced with d > 1 deletions, can we establish as ...
145
click to vote
BIBE
2004
IEEE
15 years 8 months ago
2004
IEEE
The RSA public-key cryptosystem is an algorithm that converts input data to an unrecognizable encryption and converts the unrecognizable data back into its original decryption form...