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
36
search results - page 8 / 8
»
Solving convex programs by random walks
Sort
relevance
views
votes
recent
update
View
thumb
title
163
click to vote
KSEM
2009
Springer
144
views
Theoretical Computer Science
»
more
KSEM 2009
»
A Competitive Learning Approach to Instance Selection for Support Vector Machines
15 years 10 months ago
Download
www.know-center.tugraz.at
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer
claim paper
Read More »
« Prev
« First
page 8 / 8
Last »
Next »