Sciweavers

283 search results - page 26 / 57
» On the Accuracy and Running Time of GSAT
Sort
View
SODA
2004
ACM
102views Algorithms» more  SODA 2004»
15 years 1 months ago
An exact subexponential-time lattice algorithm for Asian options
Asian options are path-dependent derivatives. How to price them efficiently and accurately has been a longstanding research and practical problem. Asian options can be priced on t...
Tian-Shyr Dai, Yuh-Dauh Lyuu
IJBIDM
2007
91views more  IJBIDM 2007»
14 years 11 months ago
An efficient weighted nearest neighbour classifier using vertical data representation
: The k-nearest neighbour (KNN) technique is a simple yet effective method for classification. In this paper, we propose an efficient weighted nearest neighbour classification algo...
William Perrizo, Qin Ding, Maleq Khan, Anne Denton...
COLING
2010
14 years 6 months ago
An Efficient Shift-Reduce Decoding Algorithm for Phrased-Based Machine Translation
In statistical machine translation, decoding without any reordering constraint is an NP-hard problem. Inversion Transduction Grammars (ITGs) exploit linguistic structure and can w...
Yang Feng, Haitao Mi, Yang Liu, Qun Liu
DAM
2011
14 years 6 months ago
Noisy colored point set matching
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
Yago Diez, Joan Antoni Sellarès
JMLR
2011
106views more  JMLR 2011»
14 years 6 months ago
A Bayesian Approximation Method for Online Ranking
This paper describes a Bayesian approximation method to obtain online ranking algorithms for games with multiple teams and multiple players. Recently for Internet games large onli...
Ruby C. Weng, Chih-Jen Lin