Sciweavers

877 search results - page 38 / 176
» Structural Cut Elimination
Sort
View
IJCAI
1997
13 years 9 months ago
Probabilistic Partial Evaluation: Exploiting Rule Structure in Probabilistic Inference
Bayesian belief networks have grown to prominence because they provide compact representations of many domains, and there are algorithms to exploit this compactness. The next step...
David Poole
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
13 years 11 months ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil
JCDCG
2000
Springer
13 years 11 months ago
Volume Queries in Polyhedra
We present a simple and practical data structure for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron, determine the volume...
John Iacono, Stefan Langerman
ICML
2004
IEEE
14 years 8 months ago
Support vector machine learning for interdependent and structured output spaces
Learning general functional dependencies is one of the main goals in machine learning. Recent progress in kernel-based methods has focused on designing flexible and powerful input...
Ioannis Tsochantaridis, Thomas Hofmann, Thorsten J...
ICVGIP
2004
13 years 9 months ago
Learning Layered Pictorial Structures from Video
We propose a new unsupervised learning method to obtain a layered pictorial structure (LPS) representation of an articulated object from video sequences. It will be seen that this...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...