Sciweavers

7200 search results - page 410 / 1440
» On the Computational Power of Winner-Take-All
Sort
View
SYNASC
2005
IEEE
92views Algorithms» more  SYNASC 2005»
16 years 13 days ago
P Colonies Working in the Maximally Parallel and in the Sequential Mode
We consider P colonies as introduced in [4] and investigate their computational power when working in the maximally parallel and in the sequential mode. It turns out that there is...
Rudolf Freund, Marion Oswald
OSDI
2000
ACM
15 years 8 months ago
Policies for Dynamic Clock Scheduling
Pocket computers are beginning to emerge that provide sufficient processing capability and memory capacity to run traditional desktop applications and operating systems on them. T...
Dirk Grunwald, Philip Levis, Keith I. Farkas, Char...
EWSN
2011
Springer
14 years 10 months ago
An Adaptive Algorithm for Compressive Approximation of Trajectory (AACAT) for Delay Tolerant Networks
Highly efficient compression provides a promising approach to address the transmission and computation challenges imposed by moving object tracking applications on resource constra...
Rajib Kumar Rana, Wen Hu, Tim Wark, Chun Tung Chou
ICS
2011
Tsinghua U.
14 years 10 months ago
Page placement in hybrid memory systems
Phase-Change Memory (PCM) technology has received substantial attention recently. Because PCM is byte-addressable and exhibits access times in the nanosecond range, it can be used...
Luiz E. Ramos, Eugene Gorbatov, Ricardo Bianchini
MOBISYS
2011
ACM
14 years 9 months ago
ProxiMate: proximity-based secure pairing using ambient wireless signals
Forming secure associations between wireless devices that do not share a prior trust relationship is an important problem. This paper presents ProxiMate, a system that allows wire...
Suhas Mathur, Robert C. Miller, Alexander Varshavs...