4377 search results - page 116 / 876 » Mass problems and randomness |
323
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
175
click to vote
CVPR
2005
IEEE
16 years 7 months ago
2005
IEEE
Random subspaces are a popular ensemble construction technique that improves the accuracy of weak classifiers. It has been shown, in different domains, that random subspaces combi...
151
click to vote
SOUPS
2009
ACM
16 years 3 days ago
2009
ACM
Randomness is a necessary ingredient in various computational tasks and especially in Cryptography, yet many existing mechanisms for obtaining randomness suffer from numerous pro...
142
click to vote
LOGCOM
2007
15 years 5 months ago
2007
We investigate notions of randomness in the space C[2N ] of nonempty closed subsets of {0, 1}N . A probability measure is given and a version of the Martin-L¨of test for randomne...
206
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...