Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJuly 2018
Perceived-Color Approximation Transforms for Programs that Draw
IEEE Micro (IMIC), Volume 38, Issue 4Jul./Aug. 2018, Pages 20–29https://doi.org/10.1109/MM.2018.043191122Human color perception acuity is not uniform across colors. This makes it possible to transform drawing programs to generate outputs whose colors are perceptually equivalent but numerically distinct. One benet of such transformations is lower display ...
- articleDecember 2017
Error-Efficient Computing Systems
Foundations and Trends in Electronic Design Automation (TEDA), Volume 11, Issue 418 12 2017, Pages 362–461https://doi.org/10.1561/1000000049This survey explores the theory and practice of techniques to make computingsystems faster or more energy-efficient by allowing them to make controllederrors. In the same way that systems which only use as much energy as necessaryare referred to as ...
- research-articleJune 2016
Reducing serial I/O power in error-tolerant applications by efficient lossy encoding
DAC '16: Proceedings of the 53rd Annual Design Automation ConferenceJune 2016, Article No.: 62, Pages 1–6https://doi.org/10.1145/2897937.2898079Transferring data between integrated circuits (ICs) accounts for an important fraction of the power dissipation in wearable and mobile systems. Reducing signal transitions reduces the dynamic power dissipated in the data transfer between ICs. Techniques ...
- proceedingOctober 2010
OOPSLA '10: Proceedings of the ACM international conference on Object oriented programming systems languages and applications
It is my pleasure to welcome you to SPLASH, the next step in the evolution of the well-known OOPSLA conference. SPLASH is the premier forum for practitioners, researchers, educators, and students who are passionate about improving the state of the art ...
- ArticleAugust 2010
Optimal Scheduling of Urgent Preemptive Tasks
RTCSA '10: Proceedings of the 2010 IEEE 16th International Conference on Embedded and Real-Time Computing Systems and ApplicationsAugust 2010, Pages 377–386https://doi.org/10.1109/RTCSA.2010.20Tasks’ scheduling has always been a central problem in the embedded real-time systems community. As in general the scheduling problem is NP-hard, researchers have been looking for efficient heuristics to solve the scheduling problem in polynomial time. ...
- ArticleSeptember 2009
A Hierarchy of Tractable Subclasses for SAT and Counting SAT Problems
SYNASC '09: Proceedings of the 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific ComputingSeptember 2009, Pages 61–68https://doi.org/10.1109/SYNASC.2009.12Finding subclasses of formulae for which the SAT problem can be solved in polynomial time has been an important problem in computer science. We present a new hierarchy of propositional formulæ subclasses for which the SAT and counting SAT problems can ...
- columnNovember 2008
SIGPLAN programming language curriculum workshop: Discussion Summaries and recommendations
- Eric Allen,
- Ras Bodik,
- Kim Bruce,
- Kathleen Fisher,
- Stephen Freund,
- Robert Harper,
- Chandra Krintz,
- Shriram Krishnamurthi,
- Jim Larus,
- Doug Lea,
- Gary Leavens,
- Lori Pollock,
- Stuart Reges,
- Martin Rinard,
- Mark Sheldon,
- Franklyn Turbak,
- Mitchell Wand,
- Mark W. Bailey
ACM SIGPLAN Notices (SIGPLAN), Volume 43, Issue 11November 2008, Pages 6–29https://doi.org/10.1145/1480828.1480831