2079 search results - page 312 / 416 » Universality of random graphs |
156
click to vote
ECCV
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper we introduce a new salient object segmentation method, which is based on combining a saliency measure with a conditional random field (CRF) model. The propo...
146
click to vote
TOC
2008
15 years 4 months ago
2008
: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound ...
136
click to vote
SIGMETRICS
2002
ACM
15 years 4 months ago
2002
ACM
Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise contro...
115
click to vote
CORR
2010
Springer
15 years 3 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...
118
click to vote
MOR
2010
15 years 2 months ago
2010
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...