Sciweavers

1763 search results - page 294 / 353
» Dependent random choice
Sort
View
TSP
2011
170views more  TSP 2011»
13 years 2 months ago
Model Selection for Sinusoids in Noise: Statistical Analysis and a New Penalty Term
—Detection of the number of sinusoids embedded in noise is a fundamental problem in statistical signal processing. Most parametric methods minimize the sum of a data fit (likeli...
Boaz Nadler, Leonid Kontorovich
ICASSP
2011
IEEE
12 years 11 months ago
MIMO radar diversity with Neyman-Pearson signal detection in non-Gaussian circumstance with non-orthogonal waveforms
The diversity gain of a multiple-input multiple-output (MIMO) system adopting the Neyman-Pearson (NP) criterion is derived for a signal-present versus signal-absent scalar hypothe...
Qian He, Rick S. Blum
INFOCOM
2011
IEEE
12 years 11 months ago
SelectCast: Scalable data aggregation scheme in wireless sensor networks
—In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gat...
Cheng Wang, ShaoJie Tang, Xiang-Yang Li, Changjun ...
IACR
2011
94views more  IACR 2011»
12 years 7 months ago
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov,...
JMLR
2012
11 years 10 months ago
Beyond Logarithmic Bounds in Online Learning
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
Francesco Orabona, Nicolò Cesa-Bianchi, Cla...