318 search results - page 53 / 64 » Decomposition of Domains |
CP
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
AUSAI
2008
Springer
15 years 4 days ago
2008
Springer
Abstract. The much-publicized Netflix competition has put the spotlight on the application domain of collaborative filtering and has sparked interest in machine learning algorithms...
ECAI
2008
Springer
14 years 12 months ago
2008
Springer
We extend the resistance distance kernel to the domain of signed dissimilarity values, and show how it can be applied to collaborative rating prediction. The resistance distance is...
81
Voted
GRAPHICSINTERFACE
2007
14 years 11 months ago
2007
Acquired data often provides the best knowledge of a material’s bidirectional reflectance distribution function (BRDF). Its integration into most real-time rendering systems re...
IJCAI
1997
14 years 11 months ago
1997
This paper presents an algorithm for extract ing propositions from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural networ...