net.sf.phiweave.inference
SumDualDecompositionProblem
class
SumDualDecompositionProblem extends ProjectableProblem
Inherited
- Hide All
- Show all
- ProjectableProblem
- AnyRef
- Any
Instance constructors
-
new
SumDualDecompositionProblem(globalFacPots: Array[Array[Double]], globalVarPots: Array[Array[Double]], treeFacPots: Array[Array[Array[Double]]], treeVarPots: Array[Array[Array[Double]]], problems: Array[SumProductBeliefPropagation], options: Options)
Value Members
-
def
!=(arg0: AnyRef): Boolean
-
def
!=(arg0: Any): Boolean
-
def
##(): Int
-
def
$asInstanceOf[T0](): T0
-
def
$isInstanceOf[T0](): Boolean
-
def
==(arg0: AnyRef): Boolean
-
def
==(arg0: Any): Boolean
-
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
computeDimension(): Int
-
var
dim: Int
-
def
dimension: Int
-
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
val
facMargs: Array[Array[Array[Double]]]
-
def
finalize(): Unit
-
def
getClass(): java.lang.Class[_]
-
def
getMarginalsAndValue(fmargs: Array[Array[Array[Double]]], vmargs: Array[Array[Array[Double]]]): Double
-
def
globalMarginals: (Array[Array[Double]], Array[Array[Double]])
-
-
def
guessWarmStart(gp: Array[Array[Double]], treesForNode: Array[Array[Int]], in: DenseVector, out: DenseVector, startIn: Int, startOut: Int): (Int, Int)
-
-
def
hasConverged: Boolean
-
def
hashCode(): Int
-
def
isInstanceOf[T0]: Boolean
-
def
ne(arg0: AnyRef): Boolean
-
def
notify(): Unit
-
def
notifyAll(): Unit
-
val
numFacs: Int
-
def
numPots(pots: Array[Double]): Int
-
val
numTrees: Int
-
val
numVars: Int
-
var
overhead: Long
-
-
def
project(gp: Array[Array[Double]], treesForNode: Array[Array[Int]], x: DenseVector, startIndex: Int): Int
-
val
rho: Double
-
def
setGradient(fp: Array[Array[Array[Double]]], vp: Array[Array[Array[Double]]], x: DenseVector, scale: Double): Unit
-
def
setGradient(gp: Array[Array[Double]], tp: Array[Array[Array[Double]]], treesForNode: Array[Array[Int]], x: DenseVector, scale: Double, startIndex: Int): Int
-
def
setMarginals(denseMarg: DenseVector, globalMarg: Array[Array[Double]], treesForNode: Array[Array[Int]], startIndex: Int): Int
-
def
setPotentials(fp: Array[Array[Array[Double]]], vp: Array[Array[Array[Double]]], x: DenseVector): Unit
-
def
setPotentials(gp: Array[Array[Double]], tp: Array[Array[Array[Double]]], treesForNode: Array[Array[Int]], x: DenseVector, startIndex: Int): Int
-
def
synchronized[T0](arg0: T0): T0
-
var
time: Long
-
def
toString(): String
-
val
treesForFac: Array[Array[Int]]
-
def
treesForIndex(treePots: Array[Array[Array[Double]]]): Array[Array[Int]]
-
val
treesForVar: Array[Array[Int]]
-
-
val
varMargs: Array[Array[Array[Double]]]
-
def
wait(): Unit
-
def
wait(arg0: Long, arg1: Int): Unit
-
def
wait(arg0: Long): Unit
-