Sciweavers

322 search results - page 41 / 65
» Least Expected Cost Query Optimization: What Can We Expect
Sort
View
ICML
2003
IEEE
14 years 9 months ago
Unsupervised Learning with Permuted Data
We consider the problem of unsupervised learning from a matrix of data vectors where in each row the observed values are randomly permuted in an unknown fashion. Such problems ari...
Sergey Kirshner, Sridevi Parise, Padhraic Smyth
SIGIR
2010
ACM
14 years 16 days ago
The demographics of web search
How does the web search behavior of “rich” and “poor” people differ? Do men and women tend to click on different results for the same query? What are some queries almost...
Ingmar Weber, Carlos Castillo
SCP
2008
86views more  SCP 2008»
13 years 8 months ago
Quantifying the yield of risk-bearing IT-portfolios
We proposed a method to quantify the yield of an IT-investment portfolio in an environment of uncertainty and risk. For various common implementation scenarios such as growing dem...
R. J. Peters, Chris Verhoef
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 7 months ago
Stochastic Budget Optimization in Internet Advertising
Internet advertising is a sophisticated game in which the many advertisers "play" to optimize their return on investment. There are many "targets" for the adve...
Bhaskar DasGupta, S. Muthukrishnan
ILP
2004
Springer
14 years 2 months ago
A Monte Carlo Study of Randomised Restarted Search in ILP
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
Filip Zelezný, Ashwin Srinivasan, David Pag...