222 search results - page 22 / 45 » The Parameterized Complexity of Regular Subgraph Problems an... |
AAAI
1994
13 years 8 months ago
1994
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
For computer-automated design systems to scale to complex designs they must be able to produce designs that exhibit the characteristics of modularity, regularity and hierarchy –...
SIGMOD
2010
ACM
14 years 11 days ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
NIPS
2000
13 years 9 months ago
2000
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
IDA
2010
Springer
13 years 6 months ago
2010
Springer
We propose a clustering algorithm that effectively utilizes feature order preferences, which have the form that feature s is more important than feature t. Our clustering formulati...