Sciweavers

3396 search results - page 630 / 680
» Tree representations of graphs
Sort
View
ACSC
2001
IEEE
14 years 1 months ago
Alias Analysis On Type Inference For Class Hierarchy In Java
The integration of alias analysis with type information increases the precision of alias detection, especially for inheritance among classes. This paper presents a compile-time fl...
Jongwook Woo, Jean-Luc Gaudiot, Isabelle Attali, D...
ICPR
2000
IEEE
14 years 1 months ago
MRF Solutions for Probabilistic Optical Flow Formulations
In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncer...
Sébastien Roy, Venu Govindu
DAC
1995
ACM
14 years 1 months ago
Synthesis of Software Programs for Embedded Control Applications
— Software components for embedded reactive real-time applications must satisfy tight code size and runtime constraints. Cooperating finite state machines provide a convenient i...
Massimiliano Chiodo, Paolo Giusto, Attila Jurecska...
LICS
1997
IEEE
14 years 1 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
ASPDAC
2008
ACM
109views Hardware» more  ASPDAC 2008»
13 years 12 months ago
TCG-based multi-bend bus driven floorplanning
Abstract--In this paper, the problem of bus driven floorplanning is addressed. Given a set of modules and bus specifications, a floorplan solution including the bus routes will be ...
Tilen Ma, Evangeline F. Y. Young