4843 search results - page 257 / 969 » The Shortcut Problem - Complexity and Approximation |
113
Voted
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
Recent approaches to learning structured predictors often require approximate inference for tractability; yet its effects on the learned model are unclear. Meanwhile, most learnin...
111
Voted
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
This paper addresses the problem of approximate singular value decomposition of large dense matrices that arises naturally in many machine learning applications. We discuss two re...
106
Voted
ASM
2010
ASM
15 years 10 months ago
2010
ASM
Identifying a minimal unsatisfiable core in an Alloy model proved to be a very useful feature in many scenarios. We extend this concept to hot core, an approximation to unsat core...
126
Voted
DFG
2009
Springer
15 years 10 months ago
2009
Springer
In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
143
Voted
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...