Sciweavers

1201 search results - page 212 / 241
» Linear Probing and Graphs
Sort
View
CGO
2004
IEEE
14 years 2 months ago
Optimizing Translation Out of SSA Using Renaming Constraints
Static Single Assignment form is an intermediate representation that uses instructions to merge values at each confluent point of the control flow graph. instructions are not ma...
Fabrice Rastello, François de Ferriè...
ATVA
2006
Springer
191views Hardware» more  ATVA 2006»
14 years 2 months ago
Automatic Verification of Hybrid Systems with Large Discrete State Space
We address the problem of model checking hybrid systems which exhibit nontrivial discrete behavior and thus cannot be treated by considering the discrete states one by one, as most...
Werner Damm, Stefan Disch, Hardi Hungar, Jun Pang,...
EKAW
2000
Springer
14 years 2 months ago
KIDS: An Iterative Algorithm to Organize Relational Knowledge
The goal of conceptual clustering is to build a set of embedded classes, which cluster objects based on their similarities. Knowledge organization aims at generating the set of mos...
Isabelle Bournaud, Mélanie Courtine, Jean-D...
ICPR
2000
IEEE
14 years 2 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
INFOCOM
2000
IEEE
14 years 2 months ago
Heuristic Algorithms for Joint Configuration of the Optical and Electrical Layer in Multi-Hop Wavelength Routing Networks
An efficient and general graph-theoretic model (the Wavelength-Graph (WG)) has been proposed which enables solving the static Routing and Wavelength Assignment (RWA) problems in Mu...
Tibor Cinkler, Dániel Marx, Claus Popp Lars...