6251 search results - page 195 / 1251 » Randomness, Computability, and Density |
130
click to vote
ICPR
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--Multiple instance learning (MIL) is a recently researched technique used for learning a target concept in the presence of noise. Previously, a random set framework for mu...
140
Voted
SIAMDM
2010
14 years 11 months ago
2010
In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected ...
135
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...
187
click to vote
STACS
2012
Springer
13 years 11 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
148
click to vote
SDM
2010
SIAM
15 years 5 months ago
2010
SIAM
Tensors naturally model many real world processes which generate multi-aspect data. Such processes appear in many different research disciplines, e.g, chemometrics, computer visio...