Sciweavers

1837 search results - page 366 / 368
» Abstraction and the C Machine Model
Sort
View
RANDOM
1998
Springer
13 years 11 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 11 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
ICPP
1995
IEEE
13 years 11 months ago
Progress: A Toolkit for Interactive Program Steering
Interactive program steering permits researchers to monitor and guide their applications during runtime. Interactive steering can help make end users more effective in addressing ...
Jeffrey S. Vetter, Karsten Schwan
DATAMINE
2008
137views more  DATAMINE 2008»
13 years 7 months ago
Two heads better than one: pattern discovery in time-evolving multi-aspect data
Abstract. Data stream values are often associated with multiple aspects. For example, each value observed at a given time-stamp from environmental sensors may have an associated ty...
Jimeng Sun, Charalampos E. Tsourakakis, Evan Hoke,...
COMPUTER
2007
153views more  COMPUTER 2007»
13 years 7 months ago
The Discipline of Embedded Systems Design
ems, using abstractions that actually remove physical constraints from consideration. At the other, embedded systems design goes beyond the traditional expertise of electrical engi...
Thomas A. Henzinger, Joseph Sifakis