1326 search results - page 174 / 266 » Approximate Tree Kernels |
DAGSTUHL
2007
15 years 4 months ago
2007
We examine the question of solving the extinction probability of a particular class of continuous-time multi-type branching processes, named Markovian binary trees (MBT). The exti...
117
Voted
AAAI
2004
15 years 4 months ago
2004
Temperature Discovery Search (TDS) is a new minimaxbased game tree search method designed to compute or approximate the temperature of a combinatorial game. TDS is based on the co...
120
click to vote
DAM
2008
15 years 2 months ago
2008
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
133
Voted
ICASSP
2010
IEEE
15 years 1 months ago
2010
IEEE
We design lifting-based wavelet transforms for any arbitrary communication graph in a wireless sensor network (WSN). Since transmitting raw data bits along the routing trees in WS...
139
click to vote
JACM
2010
15 years 1 months ago
2010
clustering of documents according to sharing of topics at multiple levels of abstraction. Given a corpus of documents, a posterior inference algorithm finds an approximation to a ...