Sciweavers

1389 search results - page 162 / 278
» Improved Approximation Algorithms for Label Cover Problems
Sort
View
ICMLA
2009
15 years 28 days ago
Structured Prediction with Relative Margin
In structured prediction problems, outputs are not confined to binary labels; they are often complex objects such as sequences, trees, or alignments. Support Vector Machine (SVM) ...
Pannagadatta K. Shivaswamy, Tony Jebara
EMNLP
2009
15 years 1 months ago
Domain adaptive bootstrapping for named entity recognition
Bootstrapping is the process of improving the performance of a trained classifier by iteratively adding data that is labeled by the classifier itself to the training set, and retr...
Dan Wu, Wee Sun Lee, Nan Ye, Hai Leong Chieu
CORR
2010
Springer
152views Education» more  CORR 2010»
15 years 3 months ago
Neuroevolutionary optimization
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
Eva Volná
WSCG
2004
156views more  WSCG 2004»
15 years 4 months ago
Efficient Collision Detection between 2D Polygons
Collision detection between moving objects is an open question which raises major problems concerning its algorithmic complexity. In this paper we present a polygon collision dete...
Juan José Jiménez, Rafael Jesú...
KDD
2008
ACM
195views Data Mining» more  KDD 2008»
16 years 3 months ago
Learning from multi-topic web documents for contextual advertisement
Contextual advertising on web pages has become very popular recently and it poses its own set of unique text mining challenges. Often advertisers wish to either target (or avoid) ...
Yi Zhang, Arun C. Surendran, John C. Platt, Mukund...