Sciweavers

74 search results - page 10 / 15
» Regret Bounds for Gaussian Process Bandit Problems
Sort
View
ICML
2007
IEEE
14 years 8 months ago
Information-theoretic metric learning
In this paper, we present an information-theoretic approach to learning a Mahalanobis distance function. We formulate the problem as that of minimizing the differential relative e...
Jason V. Davis, Brian Kulis, Prateek Jain, Suvrit ...
CORR
2006
Springer
95views Education» more  CORR 2006»
13 years 7 months ago
Optimal Distortion-Power Tradeoffs in Gaussian Sensor Networks
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements ...
Nan Liu, Sennur Ulukus
ICASSP
2009
IEEE
14 years 2 months ago
TDOA estimation for cyclostationary sources: New correlations-based bounds and estimators
We consider the problem of Time Difference of Arrival (TDOA) estimation for cyclostationary signals in additive white Gaussian noise. Classical approaches to the problem either ig...
Moshe Teplitsky, Arie Yeredor
ICASSP
2008
IEEE
14 years 2 months ago
Link throughput of multi-channel opportunistic access with limited sensing
—We aim to characterize the maximum link throughput of a multi-channel opportunistic communication system. The states of these channels evolve as independent and identically dist...
Keqin Liu, Qing Zhao
CORR
2006
Springer
107views Education» more  CORR 2006»
13 years 7 months ago
Dense Gaussian Sensor Networks: Minimum Achievable Distortion and the Order Optimality of Separation
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements...
Nan Liu, Sennur Ulukus