Sciweavers

495 search results - page 79 / 99
» Probability Trees
Sort
View
SODA
2010
ACM
176views Algorithms» more  SODA 2010»
14 years 4 months ago
Self-improving Algorithms for Convex Hulls
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri
WEA
2009
Springer
139views Algorithms» more  WEA 2009»
14 years 2 months ago
Fast Algorithm for Graph Isomorphism Testing
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
José Luis López-Presa, Antonio Fern&...
ACG
2009
Springer
14 years 2 months ago
Evaluation Function Based Monte-Carlo LOA
Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In the game of Lines of Action (LOA), which has been dominated in the past by αβ, M...
Mark H. M. Winands, Yngvi Björnsson
BIOTECHNO
2008
IEEE
14 years 2 months ago
Combining Boundaries and Ratings from Multiple Observers for Predicting Lung Nodule Characteristics
We use the data collected by the Lung Image Database Consortium (LIDC) for modeling the radiologists’ nodule interpretations based on image content of the nodule by using decisi...
Ekarin Varutbangkul, Vesna Mitrovic, Daniela Stan ...
QEST
2008
IEEE
14 years 1 months ago
Hintikka Games for PCTL on Labeled Markov Chains
We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational se...
Harald Fecher, Michael Huth, Nir Piterman, Daniel ...