Sciweavers

3628 search results - page 387 / 726
» Approaching the Physical Limits of Computing
Sort
View
AINA
2008
IEEE
15 years 8 months ago
A Communication-Efficient Distributed Clustering Algorithm for Sensor Networks
Sensor networks usually generate continuous stream of data over time. Clustering sensor data as a core task of mining sensor data plays an essential role in analytical application...
Amirhosein Taherkordi, Reza Mohammadi, Frank Elias...
EVOW
2008
Springer
15 years 7 months ago
Particle Swarm Optimization for Tackling Continuous Review Inventory Models
We propose an alternative algorithm for solving continuous review inventory model problems for deteriorating items over a finite horizon. Our interest focuses on the case of time...
Konstantinos E. Parsopoulos, K. Skouri, Michael N....
ECCV
2010
Springer
15 years 5 months ago
Hybrid Compressive Sampling via a New Total Variation TVL1
Compressive sampling (CS) is aimed at acquiring a signal or image from data which is deemed insufficient by Nyquist/Shannon sampling theorem. Its main idea is to recover a signal ...
Xianbiao Shu, Narendra Ahuja
CODES
2010
IEEE
15 years 4 months ago
A greedy buffer allocation algorithm for power-aware communication in body sensor networks
Monitoring human movements using wireless sensory devices promises to revolutionize the delivery of healthcare services. In spite of their potentials for many application domains,...
Hassan Ghasemzadeh, Roozbeh Jafari
TCOS
2010
15 years 1 months ago
PET SNAKE: A Special Purpose Architecture to Implement an Algebraic Attack in Hardware
Abstract. In [24] Raddum and Semaev propose a technique to solve systems of polynomial equations over F2 as occurring in algebraic attacks on block ciphers. This approach is known ...
Willi Geiselmann, Kenneth Matheis, Rainer Steinwan...