Sciweavers

1029 search results - page 16 / 206
» Compact representations of ordered sets
Sort
View
SCIA
2005
Springer
158views Image Analysis» more  SCIA 2005»
15 years 8 months ago
A Graph Representation of Filter Networks
Abstract. Filter networks, i.e. decomposition of a filter set into a layered structure of sparse subfilters has been proven successful for e.g. efficient convolution using finit...
Björn Svensson, Mats T. Andersson, Hans Knuts...
AAAI
2006
15 years 3 months ago
Approximate Compilation for Embedded Model-based Reasoning
The use of embedded technology has become widespread. Many complex engineered systems comprise embedded features to perform self-diagnosis or self-reconfiguration. These features ...
Barry O'Sullivan, Gregory M. Provan
159
Voted
CVPR
2010
IEEE
15 years 10 months ago
Efficient Action Spotting based on a Spacetime Oriented Structure Representation
This paper addresses action spotting, the spatiotemporal detection and localization of human actions in video. A novel compact local descriptor of video dynamics in the context of...
Konstantinos Derpanis, Mikhail Sizintsev, Kevin Ca...
DAC
2003
ACM
16 years 3 months ago
Symbolic representation with ordered function templates
Binary Decision Diagrams (BDDs) often fail to exploit sharing between Boolean functions that differ only in their support variables. In a memory circuit, for example, the function...
Amit Goel, Gagan Hasteer, Randal E. Bryant
113
Voted
ESOP
2000
Springer
15 years 6 months ago
Improving the Representation of Infinite Trees to Deal with Sets of Trees
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne