Sciweavers

791 search results - page 113 / 159
» Approximating the Maximum Sharing Problem
Sort
View
IAT
2009
IEEE
14 years 2 months ago
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ra...
ICPR
2000
IEEE
14 years 9 months ago
Estimation of Adaptive Parameters for Satellite Image Deconvolution
The deconvolution of blurred and noisy satellite images is an ill-posed inverse problem, which can be regularized within a Bayesian context by using an a priori model of the recon...
André Jalobeanu, Josiane Zerubia, Laure Bla...
ICC
2008
IEEE
127views Communications» more  ICC 2008»
14 years 2 months ago
Pre-Equalization and Precoding Design for Frequency-Selective Fading Channels
— In this paper, we consider the joint transmitter and receiver design problem based on a novel approximate maximum likelihood decision feedback equalizer (A-ML-DFE) over frequen...
Lingyang Song, Are Hjørungnes, Manav R. Bha...
INFOCOM
2006
IEEE
14 years 1 months ago
A Statistical Framework for Intrusion Detection in Ad Hoc Networks
— We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically fail to detect attacks and also gener...
Dhanant Subhadrabandhu, Saswati Sarkar, Farooq Anj...
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
13 years 9 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau