2434 search results - page 63 / 487 » Algorithmic Randomness of Closed Sets |
144
Voted
FGCS
2006
15 years 3 months ago
2006
We consider a model where commodity service providers are offering commodity computational services to a set of customers. We provide a solution for the efficient distribution of ...
127
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
190
Voted
ICIP
2001
IEEE
16 years 4 months ago
2001
IEEE
The HMM (Hidden Markov Model) is a probabilistic model of the joint probability of a collection of random variables with both observations and states. The GMM (Gaussian Mixture Mo...
122
click to vote
AAAI
2010
15 years 3 months ago
2010
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
147
Voted
GLOBECOM
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract— Many techniques for constructing unitary spacetime constellations have been proposed. To minimize bit-error rate (BER) in a wireless communication system, constellation...