Sciweavers

929 search results - page 136 / 186
» heuristics 2008
Sort
View
WWW
2008
ACM
14 years 9 months ago
Budget constrained bidding in keyword auctions and online knapsack problems
We consider the budget-constrained bidding optimization problem for sponsored search auctions, and model it as an online (multiple-choice) knapsack problem. We design both determi...
Yunhong Zhou, Deeparnab Chakrabarty, Rajan M. Luko...
WWW
2008
ACM
14 years 9 months ago
Mining the search trails of surfing crowds: identifying relevant websites from user activity
The paper proposes identifying relevant information sources from the history of combined searching and browsing behavior of many Web users. While it has been previously shown that...
Mikhail Bilenko, Ryen W. White
WWW
2008
ACM
14 years 9 months ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan
WWW
2008
ACM
14 years 9 months ago
A graph-theoretic approach to webpage segmentation
We consider the problem of segmenting a webpage into visually and semantically cohesive pieces. Our approach is based on formulating an appropriate optimization problem on weighte...
Deepayan Chakrabarti, Ravi Kumar, Kunal Punera
KDD
2008
ACM
167views Data Mining» more  KDD 2008»
14 years 9 months ago
A sequential dual method for large scale multi-class linear svms
Efficient training of direct multi-class formulations of linear Support Vector Machines is very useful in applications such as text classification with a huge number examples as w...
S. Sathiya Keerthi, S. Sundararajan, Kai-Wei Chang...