2434 search results - page 60 / 487 » Algorithmic Randomness of Closed Sets |
113
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
149
click to vote
KDD
2007
ACM
16 years 3 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
114
click to vote
WABI
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Contact maps are a model to capture the core information in the structure of biological molecules, e.g., proteins. A contact map consists of an ordered set ¡ of elements...
132
Voted
CORR
2002
Springer
15 years 3 months ago
2002
Springer
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
125
Voted
IPMU
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...