Sciweavers

2957 search results - page 525 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
WALCOM
2010
IEEE
221views Algorithms» more  WALCOM 2010»
13 years 6 months ago
Variants of Spreading Messages
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Ra...
WCNC
2010
IEEE
13 years 6 months ago
Combining Parallel Sequence Spread Spectrum (PSSS) with OFDM - Concept and Simulation Results
—In this paper, we present a novel multi-carrier spread spectrum (MCSS) system which uses Parallel Sequence Spread Spectrum (PSSS) as its spreading transform. This technique call...
Paulo Isagani M. Urriza, Joel Joseph S. Marciano J...
WCNC
2010
IEEE
13 years 6 months ago
On MIMO Cognitive Radios with Antenna Selection
—With the ever increasing interest in multiple-input multiple-output (MIMO) cognitive radio (CR) systems, reducing the costs associated with RF-chains at the radio front end beco...
Muhammad Fainan Hanif, Peter J. Smith
WCNC
2010
IEEE
13 years 6 months ago
A Recursive Battery Model for Nodes Lifetime Estimation in Wireless Sensor Networks
—Since sensor nodes use batteries as their source of energy, energy-based routing becomes an important requirement to extend network lifetime. This routing is done using the node...
Joseph Rahmé, Nicolas Fourty, Khaldoun Al A...
BMVC
2010
13 years 5 months ago
FAST: Fast Adaptive Silhouette Area based Template Matching
Template matching is a well-proven approach in the area of articulated object tracking. Matching accuracy and computation time of template matching are essential and yet often con...
Daniel Mohr, Gabriel Zachmann