18 search results - page 2 / 4 » Memory Intensive Branch-and-Bound Search for Graphical Model... |
BIRTHDAY
2008
Springer
13 years 6 months ago
2008
Springer
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...
ACG
2009
Springer
13 years 11 months ago
2009
Springer
With the recent success of Monte-Carlo tree search algorithms in Go and other games, and the increasing number of cores in standard CPUs, the efficient parallelization of the sear...
ICRA
2009
IEEE
13 years 2 months ago
2009
IEEE
Contextual reasoning through graphical models such as Markov Random Fields often show superior performance against local classifiers in many domains. Unfortunately, this performanc...
AMDO
2008
Springer
13 years 6 months ago
2008
Springer
Recently many methods for human articulated body tracking were proposed in the literature. These techniques are often computationally intensive and cannot be used for Human-Compute...
IPPS
2008
IEEE
13 years 11 months ago
2008
IEEE
Our digital universe is growing, creating exploding amounts of data which need to be searched, protected and filtered. String searching is at the core of the tools we use to curb...