820 search results - page 37 / 164 » Inducing Temporal Graphs |
APGV
2009
ACM
14 years 3 months ago
2009
ACM
Texture fractalization is used in many existing approaches to ensure the temporal coherence of a stylized animation. This paper presents the results of a psychophysical user-study...
ICTAI
2007
IEEE
14 years 2 months ago
2007
IEEE
Context-sensitive graph grammar construction tools have been used to develop and study interesting languages. However, the high dimensionality of graph grammars result in costly e...
PRICAI
1998
Springer
14 years 21 days ago
1998
Springer
Weaddress the general problemof finding algorithms for efficient, qualitative, point-basedtemporalreasoning over a set of operations. Weconsider general reasonerstailored for temp...
ISAAC
2009
Springer
14 years 1 months ago
2009
Springer
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
ICCAD
2004
IEEE
14 years 5 months ago
2004
IEEE
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...