Sciweavers

5634 search results - page 252 / 1127
» About Abstract Classes
Sort
View
MFCS
2001
Springer
15 years 9 months ago
Characterization of Context-Free Languages with Polynomially Bounded Ambiguity
Abstract. We prove that the class of context-free languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections...
Klaus Wich
ADBIS
1999
Springer
104views Database» more  ADBIS 1999»
15 years 9 months ago
Mining Various Patterns in Sequential Data in an SQL-like Manner
Abstract. One of the most important data mining tasks is discovery of frequently occurring patterns in sequences of events. Many algorithms for finding various patterns in sequenti...
Marek Wojciechowski
ICSE
1999
IEEE-ACM
15 years 8 months ago
Polymorphism Measures for Early Risk Prediction
Abstract. Polymorphism is a key feature of the objectoriented paradigm. However, polymorphism induces hidden forms of class dependencies, which may impact software quality. In this...
Saïda Benlarbi, Walcélio L. Melo
SAS
1999
Springer
15 years 8 months ago
Binary Decision Graphs
Abstract. Binary Decision Graphs are an extension of Binary Decision Diagrams that can represent some infinite boolean functions. Three refinements of BDGs corresponding to class...
Laurent Mauborgne
VISUAL
1999
Springer
15 years 8 months ago
Highly Discriminative Invariant FEatures for Image Matching
Abstract. In this paper, we present novel image-derived, invariant features that accurately capture both the geometric and color properties of an imaged object. These features can ...
Ronald-Bryan O. Alferez, Yuan-Fang Wang