5918 search results - page 921 / 1184 » A view of cloud computing |
122
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
138
click to vote
CG
2005
Springer
15 years 4 months ago
2005
Springer
Two experiments were carried out to explore the effect of rendering and interface fidelity on subjective impressions of illumination and perceived presence after exposure to a vir...
163
click to vote
SAGT
2010
Springer
15 years 2 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
149
click to vote
SIAMCOMP
2010
15 years 2 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
134
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...