Sciweavers

139 search results - page 17 / 28
» AdWords and generalized online matching
Sort
View
NIPS
2008
14 years 11 months ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari
86
Voted
WWW
2007
ACM
15 years 10 months ago
A probabilistic semantic approach for discovering web services
Service discovery is one of challenging issues in Service-Oriented computing. Currently, most of the existing service discovering and matching approaches are based on keywords-bas...
Jiangang Ma, Jinli Cao, Yanchun Zhang
CIKM
2003
Springer
15 years 2 months ago
Using titles and category names from editor-driven taxonomies for automatic evaluation
Evaluation of IR systems has always been difficult because of the need for manually assessed relevance judgments. The advent of large editor-driven taxonomies on the web opens the...
Steven M. Beitzel, Eric C. Jensen, Abdur Chowdhury...
SIGIR
2008
ACM
14 years 9 months ago
Optimizing relevance and revenue in ad search: a query substitution approach
The primary business model behind Web search is based on textual advertising, where contextually relevant ads are displayed alongside search results. We address the problem of sel...
Filip Radlinski, Andrei Z. Broder, Peter Ciccolo, ...
WWW
2011
ACM
14 years 4 months ago
A case for query by image and text content: searching computer help using screenshots and keywords
The multimedia information retrieval community has dedicated extensive research effort to the problem of content-based image retrieval (CBIR). However, these systems find their ma...
Tom Yeh, Brandyn White, Jose San Pedro, Boris Katz...