Sciweavers

2698 search results - page 397 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
COCO
2006
Springer
96views Algorithms» more  COCO 2006»
15 years 10 months ago
Optimal Hardness Results for Maximizing Agreements with Monomials
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
Vitaly Feldman
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
15 years 8 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti
KSEM
2009
Springer
16 years 29 days ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
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
LICS
2006
IEEE
16 years 13 days ago
Managing Digital Rights using Linear Logic
Digital music players protect songs by enforcing licenses that convey specific rights for individual songs or groups of songs. For licenses specified in industry, we show that d...
Adam Barth, John C. Mitchell
PAMI
2010
249views more  PAMI 2010»
15 years 4 months ago
Fast Keypoint Recognition Using Random Ferns
While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle pe...
Mustafa Özuysal, Michael Calonder, Vincent Le...