9532 search results - page 391 / 1907 » Logic, Graphs, and Algorithms |
194
click to vote
UAI
2004
15 years 8 months ago
2004
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...
183
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...
157
click to vote
CSCLP
2005
Springer
16 years 10 days ago
2005
Springer
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...
159
click to vote
SIGIR
1998
ACM
15 years 11 months ago
1998
ACM
This paper addresses the problem of topic distillation on the World Wide Web, namely, given a typical user query to find quality documents related to the query topic. Connectivity...
168
click to vote
VL
1994
IEEE
15 years 11 months ago
1994
IEEE
Developers of new imageanalysis algorithmstypically require an interactive environment in which the imagedata can be passed through various operators, some of which may involve fe...