Sciweavers

44651 search results - page 16 / 8931
» A Generalization of the Least General Generalization
Sort
View
ILP
1997
Springer
15 years 1 months ago
A Logical Framework for Graph Theoretical Decision Tree Learning
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
Peter Geibel, Fritz Wysotzki
CSSE
2008
IEEE
15 years 4 months ago
Embedding in Two Least Significant Bits with Wet Paper Coding
In this paper, we present three embedding schemes for extensions of least significant bit overwriting to both of the two lowest bit planes in digital images. Our approaches are in...
Xin Liao, Qiao-Yan Wen
CALCO
2005
Springer
98views Mathematics» more  CALCO 2005»
15 years 3 months ago
The Least Fibred Lifting and the Expressivity of Coalgebraic Modal Logic
Every endofunctor B on the category Set can be lifted to a fibred functor on the category (fibred over Set) of equivalence relations and relation-preserving functions. In this pa...
Bartek Klin
DAGM
1999
Springer
15 years 2 months ago
A Total Least Squares Framework for Low-Level Analysis of Dynamic Scenes and Processes
Abstract. We present a new method to simultaneously estimate optical flow fields and parameters of dynamic processes, violating the standard brightness change constraint equation...
Horst W. Haussecker, Christoph S. Garbe, Hagen Spi...
DLOG
2001
14 years 11 months ago
TBoxes do not Yield a Compact Representation of Least Common Subsumers
For Description Logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the input descripti...
Franz Baader, Anni-Yasmin Turhan