Sciweavers

2080 search results - page 239 / 416
» Measuring empirical computational complexity
Sort
View
PEPM
2000
ACM
15 years 9 months ago
From Recursion to Iteration: What are the Optimizations?
Transforming recursion into iteration eliminates the use of stack frames during program execution. It has been studied extensively. This paper describes a powerful and systematic ...
Yanhong A. Liu, Scott D. Stoller
ICIP
2009
IEEE
15 years 3 months ago
Main subject detection via adaptive feature selection
In this paper we present an algorithm which uses adaptive selection of low-level features for main subject detection. The algorithm first computes low-level features such as contr...
Cuong T. Vu, Damon M. Chandler
EWSN
2007
Springer
16 years 5 months ago
Removing Systematic Error in Node Localisation Using Scalable Data Fusion
Methods for node localisation in sensor networks usually rely upon the measurement of received strength, time-of-arrival, and/or angle-of-arrival of an incoming signal. In this pap...
Albert Krohn, Mike Hazas, Michael Beigl
IPSN
2010
Springer
16 years 24 days ago
Robust uncorrelated bit extraction methodologies for wireless sensors
This paper presents novel methodologies which allow robust secret key extraction from radio channel measurements which suffer from real-world non-reciprocities and a priori unkno...
Jessica Croft, Neal Patwari, Sneha Kumar Kasera
EUROPAR
2007
Springer
16 years 4 days ago
TAUoverSupermon : Low-Overhead Online Parallel Performance Monitoring
Online application performance monitoring allows tracking performance characteristics during execution as opposed to doing so post-mortem. This opens up several possibilities other...
Aroon Nataraj, Matthew J. Sottile, Alan Morris, Al...