Sciweavers

1176 search results - page 84 / 236
» Implicit Abstraction Heuristics
Sort
View
DAGM
2004
Springer
14 years 3 months ago
Estimation of Multiple Orientations at Corners and Junctions
Abstract. Features like junctions and corners are a rich source of information for image understanding. We present a novel theoretical framework for the analysis of such 2D feature...
Cicero Mota, Ingo Stuke, Til Aach, Erhardt Barth
ESWS
2004
Springer
14 years 3 months ago
S-Match: an Algorithm and an Implementation of Semantic Matching
Abstract. We think of Match as an operator which takes two graph-like structures and produces a mapping between those nodes of the two graphs that correspond semantically to each o...
Fausto Giunchiglia, Pavel Shvaiko, Mikalai Yatskev...
IFIP
2004
Springer
14 years 3 months ago
A Randomised Algorithm for Checking the Normality of Cryptographic Boolean Functions
Abstract A Boolean function is called normal if it is constant on flats of certain dimensions. This property is relevant for the construction and analysis of cryptosystems. This p...
An Braeken, Christopher Wolf, Bart Preneel
ISAAC
2003
Springer
144views Algorithms» more  ISAAC 2003»
14 years 3 months ago
Biconnectivity on Symbolically Represented Graphs: A Linear Solution
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
Raffaella Gentilini, Alberto Policriti
CDC
2009
IEEE
114views Control Systems» more  CDC 2009»
14 years 2 months ago
Design of optimal switching surfaces for switched autonomous systems
Abstract— This paper presents a novel, computationally feasible procedure for computing optimal switching surfaces, i.e. optimal feedback controllers for switched autonomous nonl...
Axel Schild, Xu Chu Ding, Magnus Egerstedt, Jan Lu...