1144 search results - page 151 / 229 » Logic programming for combinatorial problems |
ICDM
2008
IEEE
15 years 9 months ago
2008
IEEE
Zero-norm, defined as the number of non-zero elements in a vector, is an ideal quantity for feature selection. However, minimization of zero-norm is generally regarded as a combi...
128
click to vote
EMMCVPR
2005
Springer
15 years 8 months ago
2005
Springer
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
115
click to vote
CINQ
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
140
click to vote
MOZ
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Although Constraint Programming (CP) is considered a useful tool for tackling combinatorial problems, its lack of flexibility when dealing with uncertainties and prefere...
106
click to vote
ISCC
2002
IEEE
15 years 7 months ago
2002
IEEE
In this paper, we study the problems of resource and performance management in channelized wireless networks. For identifying research issues systematically, we propose a research...