Sciweavers

2925 search results - page 7 / 585
» Information Complexity of Online Problems
Sort
View
ICPR
2008
IEEE
16 years 3 months ago
Training sequential on-line boosting classifier for visual tracking
On-line boosting allows to adapt a trained classifier to changing environmental conditions or to use sequentially available training data. Yet, two important problems in the on-li...
Helmut Grabner, Horst Bischof, Jan Sochman, Jiri M...
ESA
2005
Springer
125views Algorithms» more  ESA 2005»
15 years 7 months ago
Online Primal-Dual Algorithms for Covering and Packing Problems
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
Niv Buchbinder, Joseph Naor
107
Voted
TSMC
2002
80views more  TSMC 2002»
15 years 1 months ago
Performance metric alerting: a new design approach for complex alerting problems
Alerting systems and related decision-making automation are widely used to enhance the safety and capability of controlled processes across many applications. Traditional alerting ...
L. C. Yang, J. K. Kuchar
165
Voted
ICONIP
2010
14 years 11 months ago
Online Gesture Recognition for User Interface on Accelerometer Built-in Mobile Phones
Recently, several smart phones are equipped with a 3D-accelerometer that can be used for gesture-based user interface (UI). In order to utilize the gesture UI for the real-time sys...
BongWhan Choe, Jun-Ki Min, Sung-Bae Cho
CORR
2011
Springer
196views Education» more  CORR 2011»
14 years 5 months ago
Privacy-Enhanced Reputation-Feedback Methods to Reduce Feedback Extortion in Online Auctions
In this paper, we study methods for improving the utility and privacy of reputation scores for online auctions, such as used in eBay, so as to reduce the effectiveness of feedbac...
Michael T. Goodrich, Florian Kerschbaum