311 search results - page 31 / 63 » Exploiting Decomposition in Constraint Optimization Problems |
DAWAK
2005
Springer
14 years 1 months ago
2005
Springer
Discovery of frequent patterns is a very important data mining problem with numerous applications. Frequent pattern mining is often regarded as advanced querying where a user speci...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
Learning general functional dependencies is one of the main goals in machine learning. Recent progress in kernel-based methods has focused on designing flexible and powerful input...
ALGORITHMICA
2007
13 years 7 months ago
2007
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
AICCSA
2007
IEEE
14 years 2 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
DCC
2011
IEEE
13 years 2 months ago
2011
IEEE
The effect of quantization of prior probabilities in a collection of distributed Bayesian binary hypothesis testing problems over which the priors themselves vary is studied. In ...