Sciweavers

1425 search results - page 84 / 285
» Beyond Dependency Graphs
Sort
View
ML
2008
ACM
146views Machine Learning» more  ML 2008»
15 years 2 months ago
Improving maximum margin matrix factorization
Abstract. Collaborative filtering is a popular method for personalizing product recommendations. Maximum Margin Matrix Factorization (MMMF) has been proposed as one successful lear...
Markus Weimer, Alexandros Karatzoglou, Alex J. Smo...
122
Voted
DAC
2005
ACM
16 years 3 months ago
Simulation based deadlock analysis for system level designs
In the design of highly complex, heterogeneous, and concurrent systems, deadlock detection and resolution remains an important issue. In this paper, we systematically analyze the ...
Xi Chen, Abhijit Davare, Harry Hsieh, Alberto L. S...
122
Voted
SIMUTOOLS
2008
15 years 4 months ago
Snoopy: a tool to design and animate/simulate graph-based formalisms
We sketch the fundamental properties and features of Snoopy, a tool to model and execute (animate, simulate) hierarchical graph-based system descriptions. The tool comes along wit...
Monika Heiner, Ronny Richter, Martin Schwarick
168
Voted
ICALP
2009
Springer
16 years 2 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
120
Voted
ICML
1995
IEEE
16 years 3 months ago
Stable Function Approximation in Dynamic Programming
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
Geoffrey J. Gordon