Sciweavers

2566 search results - page 122 / 514
» The Online Median Problem
Sort
View
120
Voted
ICML
2003
IEEE
16 years 1 months ago
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
Martin Zinkevich
204
Voted
SIGMOD
2006
ACM
170views Database» more  SIGMOD 2006»
16 years 1 months ago
COLT: continuous on-line tuning
Self-tuning is a cost-effective and elegant solution to the important problem of configuring a database to the characteristics of the query load. Existing techniques operate in an...
Karl Schnaitter, Serge Abiteboul, Tova Milo, Neokl...
ICSE
2004
IEEE-ACM
16 years 28 days ago
Dependable Composite Web Services with Components Upgraded Online
Achieving high dependability of Web Services (WSs) dynamically composed from component WSs is an open problem. One of the main difficulties here is due to the fact that the compone...
Anatoliy Gorbenko, Vyacheslav S. Kharchenko, Peter...
114
Voted
WADS
2009
Springer
245views Algorithms» more  WADS 2009»
15 years 7 months ago
Online Square Packing
We analyze the problem of packing squares in an online fashion: Given an semi-infinite strip of width 1 and an unknown sequence of squares with side lengths in [0, 1] that arrive...
Sándor P. Fekete, Tom Kamphans, Nils Schwee...
84
Voted
ICDCSW
2007
IEEE
15 years 7 months ago
Building Trust in Online Rating Systems Through Signal Modeling
Abstract— Online feedback-based rating systems are gaining popularity. Dealing with unfair ratings in such systems has been recognized as an important but difficult problem. Thi...
Yafei Yang, Yan Lindsay Sun, Jin Ren, Qing Yang