2434 search results - page 234 / 487 » Algorithmic Randomness of Closed Sets |
123
click to vote
AUTOMATICA
2006
15 years 4 months ago
2006
This paper examines a problem related to the optimal risk management of banks in a stochastic dynamic setting. In particular, we minimize7 market and capital adequacy risk that in...
JGT
2006
15 years 4 months ago
2006
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
143
click to vote
SPIRE
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. A palindrome is a symmetric string that reads the same forward and backward. Let Pals(w) denote the set of maximal palindromes of a string w in which each palindrome is r...
120
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
Consider a set of sensors that wish to consent on the message broadcasted by a multi-antenna transmitter in the presence of white-noise jamming. The jammer’s interference introd...
122
click to vote
ICDM
2010
IEEE
15 years 2 months ago
2010
IEEE
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...