4860 search results - page 311 / 972 » SNPs Problems, Complexity, and Algorithms |
85
Voted
RECSYS
2009
ACM
15 years 7 months ago
2009
ACM
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
105
click to vote
ISAAC
2007
Springer
15 years 7 months ago
2007
Springer
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
110
Voted
STOC
2005
ACM
15 years 6 months ago
2005
ACM
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
111
click to vote
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
Cooperative coevolution has proven to be a promising technique for solving complex combinatorial optimization problems. In this paper, we present four different strategies which i...
142
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
In this paper, we develop a low-complexity message passing algorithm for joint support and signal recovery of approximately sparse signals. The problem of recovery of strictly spa...