14386 search results - page 97 / 2878 » The Chinese Generals Problem |
154
Voted
AOR
2010
15 years 25 days ago
2010
We study the problem of computing general static-arbitrage bounds for European basket options; that is, computing bounds on the price of a basket option, given the only assumption...
112
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Ì × Ô Ô Ö × Ö × × Ò Ò Ô Ö ÐÐ Ð Û Ø ÈÍ Óѹ ÔÙØ Ø ÓÒ ØÓ ×ÓÐÚ Ø ÕÙ Ö Ø ×× ÒÑ ÒØ ÔÖÓ Ð Ñ ´É ȵ Û × ÓÒ Ó Ø Ö ×Ø ÓÔØ ...
125
Voted
KDD
2005
ACM
16 years 3 months ago
2005
ACM
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
130
click to vote
COLT
2005
Springer
15 years 9 months ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
115
Voted
ECAI
2004
Springer
15 years 8 months ago
2004
Springer
The standard SVM formulation for binary classification is based on the Hinge loss function, where errors are considered not correlated. Due to this, local information in the featu...