HCI Logo
Heidelberg University Logo
IWR Logo

Publications

Export 9 results:
Author Title Type [ Year(Asc)]
Filters: Author is Schnörr, C. and First Letter Of Title is E  [Clear All Filters]
2016
M. Desana and Schnörr, C., “Expectation Maximization for Sum-Product Networks as Exponential Family Mixture Models”. 2016.
2008
S. Petra, Popa, C., and Schnörr, C., “Enhancing Sparsity by Constraining Strategies: Constrained SIRT versus Spectral Projected Gradient Methods”, in Proc. 7th Workshop on Modelling of Environmental and Life Sciences Problems (WMM 08), Constanta, Romania, 2008.
S. Petra, Popa, C., and Schnörr, C., “Enhancing Sparsity by Constraining Strategies: Constrained SIRT versus Spectral Projected Gradient Methods”, in Proc. 7th Workshop on Modelling of Environmental and Life Sciences Problems (WMM 08), Bucharest, Romania, 2008.
2007
C. Schellewald, Roth, S., and Schnörr, C., “Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views”, Image Vision Comp., vol. 25, pp. 1301–1314, 2007.
2005
J. Neumann, Schnörr, C., and Steidl, G., “Efficient Wavelet Adaption for Hybrid Wavelet-Large Margin Classifiers”, Pattern Recognition, vol. 38, pp. 1815-1830, 2005.
2003
J. Neumann, Schnörr, C., and Steidl, G., “Effectively Finding the Optimal Wavelet for Hybrid Wavelet - Large Margin Signal Classification”, Dept. Math. and Comp. Science, University of Mannheim, Germany, 5, 2003.
2001
M. Heiler, Cremers, D., and Schnörr, C., “Efficient Feature Subset Selection for Support Vector Machines”, Dept. Math. and Comp. Science, University of Mannheim, Germany, 21/2001, 2001.
C. Schellewald, Roth, S., and Schnörr, C., “Evaluation of Convex Optimization Techniques for the Weighted Graph–Matching Problem in Computer Vision”, in Mustererkennung 2001, Munich, Germany, 2001, vol. 2191, pp. 361–368.
1992
C. Schnörr and Neumann, B., “Ein Ansatz zur effizienten und eindeutigen Rekonstruktion stückweise glatter Funktionen”, in Mustererkennung 1992, 14. DAGM-Symposium, Dresden, 1992, pp. 411–416.