Sciweavers

30 search results - page 4 / 6
» A Historical Perspective on Computer Arithmetic
Sort
View
JACM
2002
122views more  JACM 2002»
13 years 9 months ago
Cosmological lower bound on the circuit complexity of a small problem in logic
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
Larry J. Stockmeyer, Albert R. Meyer
DIALM
1999
ACM
150views Algorithms» more  DIALM 1999»
14 years 2 months ago
Mobile computing in next generation wireless networks
In this paper, we attempt to describe the evolving status of wireless communications and its impact on the future of mobile computing. We present a historical perspective and eluc...
Prathima Agrawal, David Famolari
TSMC
2008
147views more  TSMC 2008»
13 years 9 months ago
A New Approach for Solving Nonlinear Equations Systems
This paper proposes a new perspective for solving systems of complex nonlinear equations by simply viewing them as a multiobjective optimization problem. Every equation in the syst...
Crina Grosan, Ajith Abraham
CHI
2007
ACM
14 years 10 months ago
Home networking and HCI: what hath god wrought?
For much of the industrialized world, network connectivity in the home is commonplace. Despite the large number of networked homes, even the most technically savvy people can have...
Erika Shehan, W. Keith Edwards
IJMMS
2007
132views more  IJMMS 2007»
13 years 9 months ago
How emotion is made and measured
How we design and evaluate for emotions depends crucially on what we take emotions to be. In affective computing, affect is often taken to be another kind of information - discret...
Kirsten Boehner, Rogério de Paula, Paul Dou...