835 search results - page 143 / 167 » Adaptive Bound Optimization for Online Convex Optimization |
ICAL
2011
12 years 10 months ago
2011
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
SPAA
2005
ACM
14 years 4 months ago
2005
ACM
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
PVLDB
2010
13 years 8 months ago
2010
We introduce the proximity rank join problem, where we are given a set of relations whose tuples are equipped with a score and a real-valued feature vector. Given a target feature...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Scoring rules for eliciting expert predictions of random variables are usually developed assuming that experts derive utility only from the quality of their predictions (e.g., sco...
CIKM
2009
Springer
14 years 3 months ago
2009
Springer
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...