Sciweavers

1740 search results - page 116 / 348
» Minimal structures for stories
Sort
View
143
Voted
EUROPAR
2007
Springer
15 years 9 months ago
Content-Based Publish/Subscribe Using Distributed R-Trees
Publish/subscribe systems provide a useful paradigm for selective data dissemination and most of the complexity related to addressing and routing is encapsulated within the network...
Silvia Bianchi, Pascal Felber, Maria Gradinariu
GI
2007
Springer
15 years 9 months ago
A New Approach for Estimating Depth by Fusing Stereo and Defocus Information
: Several algorithms are common for estimating depth from stereo series, but many of them have difficulties when determining depth of objects having periodical structure. This con...
Ioana Gheta, Christian Frese, Michael Heizmann, J&...
ACSD
2006
IEEE
106views Hardware» more  ACSD 2006»
15 years 9 months ago
Synchronous + Concurrent + Sequential = Earlier than + Not later than
In this paper, we show how to obtain causal semantics distinguishing ”earlier than” and ”not later than” causality between events from algebraic semantics of Petri nets. J...
Gabriel Juhás, Robert Lorenz, Sebastian Mau...
104
Voted
IWSOC
2003
IEEE
99views Hardware» more  IWSOC 2003»
15 years 8 months ago
Template Generation and Selection Algorithms
The availability of high-level design entry tooling is crucial for the viability of any reconfigurable SoC architecture. This paper presents a template generation method to extra...
Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Pa...
104
Voted
PG
2003
IEEE
15 years 8 months ago
Voxelization in Common Sampling Lattices
In this paper we introduce algorithms to voxelize polygonal meshes in common sampling lattices. In the case of Cartesian lattices, we complete the separability and minimality proo...
Haris Widjaya, Torsten Möller, Alireza Enteza...