287 search results - page 5 / 58 » Exact Cover with light |
PKDD
2007
Springer
14 years 1 months ago
2007
Springer
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
ANTSW
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
WAOA
2005
Springer
14 years 26 days ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
TCOM
2011
13 years 2 months ago
2011
Abstract—We consider decode-and-forward cooperative networks and we derive analytical expressions as well as tractable asymptotic approximations for the outage probability of a n...