3946 search results - page 337 / 790 » The computational complexity of choice sets |
226
click to vote
TWC
2010
15 years 1 months ago
2010
This paper proposes a framework for distributed sequential parameter estimation in wireless sensor networks. In the proposed scheme, the estimator is updated sequentially at the c...
194
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. Suppose one has access to oracles generating samples from two unknown probability distributions p and q on some N-element set. How many samples does one need to test whet...
170
click to vote
ACSAC
2003
IEEE
16 years 4 days ago
2003
IEEE
In-depth analysis of network security vulnerability must consider attacker exploits not just in isolation, but also in combination. The general approach to this problem is to comp...
177
click to vote
MFCS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggre...
330
click to vote
ECCV
2004
Springer
16 years 8 months ago
2004
Springer
The problem of tracking a varying number of non-rigid objects has two major difficulties. First, the observation models and target distributions can be highly non-linear and non-Ga...