Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
111
search results - page 23 / 23
»
Perspectives on Sparse Bayesian Learning
Sort
relevance
views
votes
recent
update
View
thumb
title
127
click to vote
COLT
2005
Springer
106
views
Machine Learning
»
more
COLT 2005
»
General Polynomial Time Decomposition Algorithms
15 years 8 months ago
Download
www.ruhr-uni-bochum.de
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
claim paper
Read More »
« Prev
« First
page 23 / 23
Last »
Next »