Sciweavers

1888 search results - page 41 / 378
» Proof theory and computational analysis
Sort
View
HASKELL
2009
ACM
14 years 1 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
CHI
2011
ACM
12 years 11 months ago
Comparing activity theory with distributed cognition for video analysis: beyond "kicking the tires"
The field of HCI is growing, not only in the variety of application areas or the volume of research conducted, but also in the number of analytical approaches for use in the evalu...
Eric P. S. Baumer, Bill Tomlinson
SIGECOM
2011
ACM
229views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
A revealed preference approach to computational complexity in economics
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
Federico Echenique, Daniel Golovin, Adam Wierman
DCC
2006
IEEE
14 years 7 months ago
Analysis of Multiple Antenna Systems with Finite-Rate Feedback Using High Resolution Quantization Theory
This paper considers the development of a general framework for the analysis of transmit beamforming methods in multiple antenna systems with finite-rate feedback. Inspired by the...
Jun Zheng, Ethan R. Duni, Bhaskar D. Rao
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
14 years 7 days ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook