Sciweavers

7200 search results - page 254 / 1440
» On the Computational Power of Winner-Take-All
Sort
View
TOSN
2011
116views more  TOSN 2011»
15 years 1 months ago
A model framework for greedy routing in a sensor network with a stochastic power scheme
A stochastic model is formulated and analyzed to study the advancements of messages under greedy routing in a sensor network with a power-saving scheme. The aim of this model is g...
Holger Paul Keeler, Peter G. Taylor
ICASSP
2011
IEEE
14 years 10 months ago
Powerful extensions to CRFS for grapheme to phoneme conversion
Conditional Random Fields (CRFs) have proven to perform well on natural language processing tasks like name transliteration, concept tagging or grapheme-to-phoneme (g2p) conversio...
Stefan Hahn, Patrick Lehnen, Hermann Ney
NOCS
2007
IEEE
16 years 27 days ago
The Power of Priority: NoC Based Distributed Cache Coherency
The paper introduces Network-on-Chip (NoC) design methodology and low cost mechanisms for supporting efficient cache access and cache coherency in future high-performance Chip Mul...
Evgeny Bolotin, Zvika Guz, Israel Cidon, Ran Ginos...
BIRTHDAY
2012
Springer
14 years 2 months ago
Cryptography with Asynchronous Logic Automata
We introduce the use of asynchronous logic automata (ALA) for cryptography. ALA aligns the descriptions of hardware and software for portability, programmability, and scalability. ...
Peter Schmidt-Nielsen, Kailiang Chen, Jonathan Bac...