4377 search results - page 483 / 876 » Mass problems and randomness |
205
click to vote
TSP
2008
15 years 6 months ago
2008
We consider the problem of estimating the covariance matrix of an observation vector, using heterogeneous training samples, i.e., samples whose covariance matrices are not exactly ...
157
click to vote
ENTCS
2002
15 years 6 months ago
2002
Solovay showed that there are noncomputable reals such that H( n) H(1n) + O(1), where H is prefix-free Kolmogorov complexity. Such H-trivial reals are interesting due to the conn...
176
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
164
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract—We introduce a new class of exact MinimumBandwidth Regenerating (MBR) codes for distributed storage systems, characterized by a low-complexity uncoded repair process tha...
181
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—We consider a widely applicable model of resource allocation where two sequences of events are coupled: on a continuous time axis (t), network dynamics evolve over time. On a di...