Sciweavers

6568 search results - page 346 / 1314
» Reducing the Complexity of Reductions
Sort
View
JNW
2006
148views more  JNW 2006»
15 years 7 months ago
An Energy Efficient Approach to Dynamic Coverage in Wireless Sensor Networks
Tracking of mobile targets is an important application of sensor networks. This is a non-trivial problem as the increased accuracy of tracking results in an overall reduction in th...
Mohamed Khalil Watfa, Sesh Commuri
TC
2008
15 years 7 months ago
Low-Transition Test Pattern Generation for BIST-Based Applications
A low-transition test pattern generator, called the low-transition linear feedback shift register (LT-LFSR), is proposed to reduce the average and peak power of a circuit during te...
Mehrdad Nourani, Mohammad Tehranipoor, Nisar Ahmed
VTC
2006
IEEE
129views Communications» more  VTC 2006»
16 years 1 months ago
Practicable MIMO Capacity in Ideal Channels
— The impact of communications signal processing such as QAM modulations (instead of gaussian signals), finite block lengths (instead of infinitely long codes), and using simpl...
S. Amir Mirtaheri, Rodney G. Vaughan
SODA
2012
ACM
227views Algorithms» more  SODA 2012»
13 years 10 months ago
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
François Le Gall
ICCV
2005
IEEE
16 years 9 months ago
Dynamic Measurement Clustering to Aid Real Time Tracking
Many parameter estimation problems admit divide and conquer or partitioning techniques in order to reduce a highdimensional task into several reduced-dimension problems. These tec...
Christopher Kemp, Tom Drummond