Sciweavers

282 search results - page 38 / 57
» Approximation algorithms for facility location problems
Sort
View
IPSN
2009
Springer
15 years 4 months ago
Near-optimal Bayesian localization via incoherence and sparsity
This paper exploits recent developments in sparse approximation and compressive sensing to efficiently perform localization in a sensor network. We introduce a Bayesian framework...
Volkan Cevher, Petros Boufounos, Richard G. Barani...
CORR
2010
Springer
138views Education» more  CORR 2010»
14 years 10 months ago
On building minimal automaton for subset matching queries
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
Kimmo Fredriksson
APPT
2005
Springer
15 years 3 months ago
Principal Component Analysis for Distributed Data Sets with Updating
Identifying the patterns of large data sets is a key requirement in data mining. A powerful technique for this purpose is the principal component analysis (PCA). PCA-based clusteri...
Zheng-Jian Bai, Raymond H. Chan, Franklin T. Luk
ICA
2010
Springer
14 years 10 months ago
An Alternating Minimization Method for Sparse Channel Estimation
The problem of estimating a sparse channel, i.e. a channel with a few non-zero taps, appears in many fields of communication including acoustic underwater or wireless transmissions...
Rad Niazadeh, Massoud Babaie-Zadeh, Christian Jutt...
INFOCOM
2007
IEEE
15 years 4 months ago
Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks
— Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically assumes homogeneous wireless sensor nodes with an identica...
Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chu...