Sciweavers

565 search results - page 74 / 113
» Incremental query evaluation for support vector machines
Sort
View
KDD
2009
ACM
165views Data Mining» more  KDD 2009»
15 years 10 months ago
Pricing guidance in ad sale negotiations: the PrintAds example
We consider negotiations between publishers and advertisers in a marketplace for ads. Motivated by Google’s online PrintAds system which is such a marketplace, we focus on the r...
Adam Isaac Juda, S. Muthukrishnan, Ashish Rastogi
NLPRS
2001
Springer
15 years 10 months ago
Ensembling based on Feature Space Restructuring with Application to WSD
We propose a new ensembling method of Support Vector Machines (SVMs) based on Feature Space Restructuring. In the proposed method, the weighted majority voting method is applied f...
Hiroya Takamura, Hiroyasu Yamada, Taku Kudo, Kaoru...
DAGM
2007
Springer
15 years 10 months ago
Greedy-Based Design of Sparse Two-Stage SVMs for Fast Classification
Cascades of classifiers constitute an important architecture for fast object detection. While boosting of simple (weak) classifiers provides an established framework, the design of...
Rezaul Karim, Martin Bergtholdt, Jörg H. Kapp...
SIGIR
2010
ACM
15 years 9 months ago
Spatial relationships in visual graph modeling for image categorization
In this paper, a language model adapted to graph-based representation of image content is proposed and assessed. The full indexing and retrieval processes are evaluated on two diï...
Trong-Ton Pham, Philippe Mulhem, Loïc Maisonn...
DIS
2008
Springer
15 years 8 months ago
String Kernels Based on Variable-Length-Don't-Care Patterns
Abstract. We propose a new string kernel based on variable-lengthdon't-care patterns (VLDC patterns). A VLDC pattern is an element of ({}) , where is an alphabet and is the ...
Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Shu...