5372 search results - page 325 / 1075 » complexity 2007 |
114
Voted
ICCS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Hierarchical (H)-matrices approximate full or sparse matrices using a hierarchical data sparse format. The corresponding H-matrix arithmetic reduces the time complexity o...
118
Voted
ICCS
2007
Springer
15 years 8 months ago
2007
Springer
We briefly give an overview of Dynamic Epistemic Logic (DEL), mainly in semantic terms. We focus on the simplest of epistemic actions in DEL, called public announcements. We also ...
110
Voted
ISAAC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We consider the problems of hypergraph and minor crossing minimization, and point out a relation between these two problems which has not been exploited before. We presen...
88
Voted
ISVC
2007
Springer
15 years 8 months ago
2007
Springer
Schlick’s approximation of the term xp is used primarily to reduce the complexity of specular lighting calculations in graphics applications. Since moment functions have a kernel...
ISVC
2007
Springer
15 years 8 months ago
2007
Springer
Video event understanding requires a formalism that can model complex logical temporal and spatial relations between composing sub-events. In this paper we argue that the Petri-Net...