7200 search results - page 296 / 1440 » On the Computational Power of Winner-Take-All |
179
click to vote
ACL
2012
13 years 9 months ago
2012
Recently, it was shown (KUHLMANN, SATTA: Tree-adjoining grammars are not closed under strong lexicalization. Comput. Linguist., 2012) that finitely ambiguous tree adjoining gramm...
180
click to vote
HPCA
2001
IEEE
16 years 7 months ago
2001
IEEE
With the increasing clock rate and transistor count of today's microprocessors, power dissipation is becoming a critical component of system design complexity. Thermal and po...
172
click to vote
TCS
2008
15 years 6 months ago
2008
We study the computational power of pure insertion grammars. We show that pure insertion grammars of weight 3 can characterize all recursively enumerable languages. This is achiev...
162
click to vote
CHI
1996
ACM
15 years 11 months ago
1996
ACM
The goal of `Computer Augmented Environments' is to bring computational power to everyday objects with which users are already familiar, so that the user interface to this co...
219
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
— We study the end-to-end resource allocation in an OFDM based multi-hop network consisting of a one-dimensional chain of nodes including a source, a destination, and multiple re...