1068 search results - page 142 / 214 » Extremely randomized trees |
GECCO
2008
Springer
14 years 7 days ago
2008
Springer
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
JMLR
2006
13 years 11 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
CN
2002
13 years 11 months ago
2002
We present an approach to building multicast services at the network layer using unicast forwarding and two additional building blocks: (i) ephemeral state probes, i.e. extremely l...
FSTTCS
2010
Springer
13 years 9 months ago
2010
Springer
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...
MP
2011
13 years 6 months ago
2011
We consider a quadratic programming (QP) problem (Π) of the form min xT Cx subject to Ax ≥ b where C ∈ Rn×n + , rank(C) = 1 and A ∈ Rm×n , b ∈ Rm . We present an FPTAS ...