324 search results - page 42 / 65 » Bounds for Functions of Dependent Risks |
NIPS
2007
15 years 1 months ago
2007
In the online linear optimization problem, a learner must choose, in each round, a decision from a set D ⊂ Rn in order to minimize an (unknown and changing) linear cost function...
123
click to vote
ECBS
1999
IEEE
15 years 4 months ago
1999
IEEE
Engineering systems are becoming increasingly complex as state of the art technologies are incorporated into designs. Surety modeling and analysis is an emerging science which per...
119
click to vote
JCSS
2008
14 years 12 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
PODS
2003
ACM
16 years 6 hour ago
2003
ACM
We formalize the problem of maintaining time-decaying aggregates and statistics of a data stream: the relative contribution of each data item to the aggregate is scaled down by a ...
XIMEP
2005
ACM
15 years 5 months ago
2005
ACM
We report on a compilation procedure that derives relational algebra plans from arbitrarily nested XQuery FLWOR blocks. While recent research was able to develop relational encodi...