Sciweavers

147 search results - page 29 / 30
» Network localization in partially localizable networks
Sort
View
BMCBI
2010
118views more  BMCBI 2010»
13 years 6 months ago
Walk-weighted subsequence kernels for protein-protein interaction extraction
Background: The construction of interaction networks between proteins is central to understanding the underlying biological processes. However, since many useful relations are exc...
Seonho Kim, Juntae Yoon, Jihoon Yang, Seog Park
TWC
2008
141views more  TWC 2008»
13 years 6 months ago
Progressive Accumulative Routing: Fundamental Concepts and Protocol
This paper considers a multi-hop network in which relay nodes cooperate to minimize the total energy consumed in transmitting a (unicast) packet from a source to a destination. We...
Raymond Yim, Neelesh B. Mehta, Andreas F. Molisch,...
NECO
2007
150views more  NECO 2007»
13 years 5 months ago
Reinforcement Learning, Spike-Time-Dependent Plasticity, and the BCM Rule
Learning agents, whether natural or artificial, must update their internal parameters in order to improve their behavior over time. In reinforcement learning, this plasticity is ...
Dorit Baras, Ron Meir
LCTRTS
2009
Springer
14 years 1 months ago
Eliminating the call stack to save RAM
Most programming languages support a call stack in the programming model and also in the runtime system. We show that for applications targeting low-power embedded microcontroller...
Xuejun Yang, Nathan Cooprider, John Regehr
SPAA
1997
ACM
13 years 10 months ago
Pipelining with Futures
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
Guy E. Blelloch, Margaret Reid-Miller