Sciweavers

7195 search results - page 791 / 1439
» On Computing Power
Sort
View
SPAA
2005
ACM
16 years 26 days ago
Parallelizing time with polynomial circuits
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
Ryan Williams
WOSP
2005
ACM
16 years 26 days ago
Modeling the performance of a NAT/firewall network service for the IXP2400
The evolution towards IP-aware access networks creates the possibility (and, indeed, the desirability) of additional network services, like firewalling or NAT, integrated into th...
Tom Verdickt, Wim Van de Meerssche, Koert Vlaeminc...
LCPC
2005
Springer
16 years 24 days ago
Dynamic Compilation for Reducing Energy Consumption of I/O-Intensive Applications
Tera-scale high-performance computing has enabled scientists to tackle very large and computationally challenging scientific problems, making the advancement of scientific discov...
Seung Woo Son, Guangyu Chen, Mahmut T. Kandemir, A...
PDC
2004
ACM
16 years 22 days ago
Examining a planning discourse: how a manager represents issues within a planning frame and how the others could do the same
The aim of Participatory Design (PD) is to involve the users in the design. Even though the research has shown the success of PD projects in empowering users, little has been said...
Jarmo Sarkkinen
PODC
2004
ACM
16 years 22 days ago
Completely fair SFE and coalition-safe cheap talk
Secure function evaluation (SFE) enables a group of players, by themselves, to evaluate a function on private inputs as securely as if a trusted third party had done it for them. ...
Matt Lepinski, Silvio Micali, Chris Peikert, Abhi ...