Sciweavers

2436 search results - page 411 / 488
» Comonadic Notions of Computation
Sort
View
102
Voted
CHI
2007
ACM
16 years 4 months ago
Evaluating experience-focused HCI
A growing trend in the field is the development of experience-focused HCI, which emphasizes the experience of using the technology, rather than the focus on the task that is chara...
Joseph Kaye
HPCA
2006
IEEE
16 years 4 months ago
Phase characterization for power: evaluating control-flow-based and event-counter-based techniques
Computer systems increasingly rely on dynamic, phasebased system management techniques, in which system hardware and software parameters may be altered or tuned at runtime for dif...
Canturk Isci, Margaret Martonosi
238
Voted
POPL
2006
ACM
16 years 4 months ago
A hierarchical model of data locality
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
Chengliang Zhang, Chen Ding, Mitsunori Ogihara, Yu...
ICS
2010
Tsinghua U.
16 years 1 months ago
Robustly Leveraging Collusion in Combinatorial Auctions
feuse of its devstting eets in utions nd other mehnismsD ollusion is prohiited nd leglly proseutedF etD olluders hve lwys existedD nd my ontinue to existF e thus rise the followin...
Jing Chen, Silvio Micali, Paul Valiant
STACS
2010
Springer
15 years 10 months ago
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
Maurice Jansen