Sciweavers

3088 search results - page 100 / 618
» Online Passive-Aggressive Algorithms
Sort
View
WADS
2007
Springer
89views Algorithms» more  WADS 2007»
15 years 3 months ago
Dynamic TCP Acknowledgment with Sliding Window
The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the ...
Hisashi Koga
ICDAR
2009
IEEE
15 years 4 months ago
A Probabilistic Framework for Soft Target Learning in Online Cursive Handwriting Recognition
To develop effective learning algorithms for online cursive word recognition is still a challenge research issue. In this paper, we propose a probabilistic framework to model the ...
Xiaoyuan Zhu, Yong Ge, Feng-Jun Guo, Li-Xin Zhen
CIMCA
2008
IEEE
15 years 4 months ago
Seller's Strategies for Predicting Winning Bid Prices in Online Auctions
Online auctions have become extremely popular in recent years. Ability to predict winning bid prices accurately can help bidders to maximize their profit. This paper proposes a nu...
Yevgeniya Kovalchuk
NORDICHI
2004
ACM
15 years 3 months ago
On-line adjustment of dwell time for target selection by gaze
In eye typing systems, a dwell time that adjusts to the user’s natural typing speed is highly desirable. We present an algorithm for on-line adjustment of dwell time developed a...
Oleg Spakov, Darius Miniotas
SWAT
2010
Springer
282views Algorithms» more  SWAT 2010»
15 years 2 months ago
Better Bounds on Online Unit Clustering
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
Martin R. Ehmsen, Kim S. Larsen