1640 search results - page 67 / 328 » Conditional Independence Trees |
CPC
2006
15 years 2 months ago
2006
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
129
click to vote
HIPEAC
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Designers of large parallel computers and clusters are becoming increasingly concerned with the cost and power consumption of the interconnection network. A simple way to...
135
click to vote
CI
2005
15 years 2 months ago
2005
TRACT SPECIFICATIONS FEI XIA AND MARTHA PALMER Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA 19104 K. VIJAY-SHANKER Department of Com...
100
Voted
MP
2007
15 years 2 months ago
2007
Let Bi be deterministic real symmetric m × m matrices, and ξi be independent random scalars with zero mean and “of order of one” (e.g., ξi ∼ N(0, 1)). We are interested to...
137
click to vote
MA
2010
Springer
15 years 1 months ago
2010
Springer
This paper deals with the quantization problem of a random variable X taking values in a separable and re exive Banach space, and with the related question of clustering independ...