Sciweavers

16430 search results - page 98 / 3286
» On Computable Tree Functions
Sort
View
SIAMJO
2000
101views more  SIAMJO 2000»
15 years 6 months ago
An Efficient Algorithm for Minimizing a Sum of p-Norms
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
Guoliang Xue, Yinyu Ye
CG
2008
Springer
15 years 8 months ago
Parallel Monte-Carlo Tree Search
Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the stren...
Guillaume Chaslot, Mark H. M. Winands, H. Jaap van...
ACL
2012
13 years 8 months ago
Strong Lexicalization of Tree Adjoining Grammars
Recently, it was shown (KUHLMANN, SATTA: Tree-adjoining grammars are not closed under strong lexicalization. Comput. Linguist., 2012) that finitely ambiguous tree adjoining gramm...
Andreas Maletti, Joost Engelfriet
ICCV
2005
IEEE
16 years 8 months ago
Finding Tree Structures by Grouping Symmetries
Hiroshi Ishikawa 0002, Davi Geiger, Richard Cole
ICCV
1999
IEEE
16 years 8 months ago
Approximate Tree Matching and Shape Similarity
Tyng-Luh Liu, Davi Geiger