2487 search results - page 241 / 498 » Partitions of Graphs into Trees |
165
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
141
Voted
JGT
2011
14 years 11 months ago
2011
A graph G = (V, E) is called (k, k )-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, an...
118
Voted
SIGGRAPH
1999
ACM
15 years 8 months ago
1999
ACM
Using multiple reference images in 3D image warping has been a challenging problem. Recently, the Layered Depth Image (LDI) was proposed by Shade et al. to merge multiple referenc...
151
click to vote
COCO
2006
Springer
15 years 7 months ago
2006
Springer
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
105
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: Orthology is one of the cornerstones of gene function prediction. Dividing the phylogenetic relations between genes into either orthologs or paralogs is however an ove...