1763 search results - page 294 / 353 » Dependent random choice |
144
click to vote
TSP
2011
14 years 10 months ago
2011
—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...
129
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
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...
146
click to vote
INFOCOM
2011
IEEE
14 years 7 months ago
2011
IEEE
—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...
126
click to vote
IACR
2011
14 years 3 months ago
2011
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 ...
185
click to vote
JMLR
2012
13 years 6 months ago
2012
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...