60 search results - page 6 / 12 » Bounds for parametric sequence comparison |
COCOON
2009
Springer
14 years 2 months ago
2009
Springer
We provide a smoothed analysis of Hoare’s find algorithm and we revisit the smoothed analysis of quicksort. Hoare’s find algorithm – often called quickselect – is an easy...
WSDM
2010
ACM
14 years 4 months ago
2010
ACM
We study the problem of designing a mechanism to rank items in forums by making use of the user reviews such as thumb and star ratings. We compare mechanisms where forum users rat...
ALGORITHMICA
2005
13 years 7 months ago
2005
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
AI
1998
Springer
13 years 7 months ago
1998
Springer
The absolute loss is the absolute difference between the desired and predicted outcome. This paper demonstrates worst-case upper bounds on the absolute loss for the Perceptron le...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Competitive on-line prediction (also known as universal prediction of individual sequences) is a strand of learning theory avoiding making any stochastic assumptions about the way...