16404 search results - page 733 / 3281 » A set coverage problem |
182
click to vote
CPAIOR
2008
Springer
15 years 9 months ago
2008
Springer
A domino portrait is an approximation of an image using a given number of sets of dominoes. This problem was first stated in
181
Voted
AI
2006
Springer
15 years 7 months ago
2006
Springer
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint type...
179
click to vote
ECCC
2006
15 years 7 months ago
2006
In our problem we are given a set of customers, their positions on the plane and their demands. Geometrically, the area covered by a directional antenna with parameters , ,
199
Voted
INFORMATICALT
2008
15 years 7 months ago
2008
This paper studies an adaptive clustering problem. We focus on re-clustering an object set, previously clustered, when the feature set characterizing the objects increases. We prop...
223
Voted
IJAR
2010
15 years 5 months ago
2010
We consider the problem of learning Bayesian network models in a non-informative setting, where the only available information is a set of observational data, and no background kn...