Sciweavers

1728 search results - page 113 / 346
» The Size of Power Automata
Sort
View
ASPDAC
2009
ACM
115views Hardware» more  ASPDAC 2009»
16 years 1 months ago
Incremental and on-demand random walk for iterative power distribution network analysis
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
Yiyu Shi, Wei Yao, Jinjun Xiong, Lei He
ACISP
2005
Springer
16 years 8 days ago
RFID Guardian: A Battery-Powered Mobile Device for RFID Privacy Management
Abstract. RFID tags are tiny, inexpensive, inductively powered computers that are going to replace bar codes on many products, but which have many other uses as well. For example, ...
Melanie R. Rieback, Bruno Crispo, Andrew S. Tanenb...
SETA
2004
Springer
93views Mathematics» more  SETA 2004»
16 years 1 days ago
Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I, H, N}n Transform
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n =...
Lars Eirik Danielsen, Matthew G. Parker
ISLPED
2003
ACM
95views Hardware» more  ISLPED 2003»
15 years 12 months ago
Power efficient comparators for long arguments in superscalar processors
Traditional pulldown comparators that are used to implement associativeaddressing logic in superscalar microprocessors dissipate energy on a mismatch in any bit position in the co...
Dmitry Ponomarev, Gurhan Kucuk, Oguz Ergin, Kanad ...
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 10 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