5100 search results - page 674 / 1020 » The Linear Complexity of a Graph |
197
click to vote
BIRTHDAY
2008
Springer
15 years 8 months ago
2008
Springer
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...
197
click to vote
ISSTA
2010
ACM
15 years 8 months ago
2010
ACM
This paper investigates the application of causal inference methodology for observational studies to software fault localization based on test outcomes and profiles. This methodo...
214
Voted
AAAI
2010
15 years 8 months ago
2010
Gaussian Mixture Model (GMM) is one of the most popular data clustering methods which can be viewed as a linear combination of different Gaussian components. In GMM, each cluster ...
177
click to vote
IPCO
2010
15 years 8 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
194
click to vote
NIPS
2008
15 years 8 months ago
2008
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...