1964 search results - page 299 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
130
click to vote
SODA
2003
ACM
15 years 4 months ago
2003
ACM
Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of...
130
Voted
SCFBM
2008
15 years 2 months ago
2008
The main problem in any model-building situation is to choose from a large set of covariates those that should be included in the "best" model. A decision to keep a vari...
115
Voted
ECCC
2006
15 years 2 months ago
2006
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...
113
Voted
RECOMB
2005
Springer
16 years 2 months ago
2005
Springer
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficien...
216
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In this paper we present a method for reformulating the Recommender Systems problem in an Information Retrieval one. In our tests we have a dataset of users who give ratings for s...