Sciweavers

16430 search results - page 478 / 3286
» On Computable Tree Functions
Sort
View
ICGA
2008
208views Optimization» more  ICGA 2008»
15 years 7 months ago
Cross-Entropy for Monte-Carlo Tree Search
Recently, Monte-Carlo Tree Search (MCTS) has become a popular approach for intelligent play in games. Amongst others, it is successfully used in most state-of-the-art Go programs....
Guillaume Chaslot, Mark H. M. Winands, Istvan Szit...
CGF
2006
107views more  CGF 2006»
15 years 7 months ago
Volume-Surface Trees
Many algorithms in computer graphics improve their efficiency by using Hierarchical Space Subdivision Schemes (HS3), such as octrees, kD-trees or BSP trees. Such HS3 usually provi...
Tamy Boubekeur, Wolfgang Heidrich, Xavier Granier,...
EOR
2006
66views more  EOR 2006»
15 years 7 months ago
Using intervals for global sensitivity and worst-case analyses in multiattribute value trees
Sensitivity analyses have long been used to assess the impacts of uncertainties on outcomes of decision models. Several approaches have been suggested, but it has been problematic...
Jyri Mustajoki, Raimo P. Hämäläinen...
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
15 years 4 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
IACR
2011
94views more  IACR 2011»
14 years 6 months ago
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov,...