3455 search results - page 319 / 691 » Generalized Game Trees |
210
click to vote
COR
2008
15 years 6 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
267
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Historical linguistics aims at inferring the most likely language phylogenetic tree starting from information concerning the evolutionary relatedness of languages. The available i...
220
click to vote
PAMI
2011
15 years 1 months ago
2011
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
186
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically ...
210
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...