Sciweavers

1326 search results - page 263 / 266
» Approximate Tree Kernels
Sort
View
COMCOM
2006
147views more  COMCOM 2006»
14 years 9 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das
87
Voted
JPDC
2006
141views more  JPDC 2006»
14 years 9 months ago
M-TREE: A high efficiency security architecture for protecting integrity and privacy of software
Secure processor architectures enable new sets of applications such as commercial grid computing, software copy protection and secure mobile agents by providing secure computing e...
Chenghuai Lu, Tao Zhang, Weidong Shi, Hsien-Hsin S...
TASLP
2008
131views more  TASLP 2008»
14 years 9 months ago
A Noise-Robust FFT-Based Auditory Spectrum With Application in Audio Classification
In this paper, we investigate the noise robustness of Wang and Shamma's early auditory (EA) model for the calculation of an auditory spectrum in audio classification applicati...
Wei Chu, B. Champagne
TISSEC
2008
235views more  TISSEC 2008»
14 years 9 months ago
SDAP: A Secure Hop-by-Hop Data Aggregation Protocol for Sensor Networks
Hop-by-hop data aggregation is a very important technique for reducing the communication overhead and energy expenditure of sensor nodes during the process of data collection in a...
Yi Yang, Xinran Wang, Sencun Zhu, Guohong Cao
TSP
2008
101views more  TSP 2008»
14 years 9 months ago
Optimal Node Density for Detection in Energy-Constrained Random Networks
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
Animashree Anandkumar, Lang Tong, Ananthram Swami