Sciweavers

564 search results - page 86 / 113
» Some Results on the Expressive Power and Complexity of LSCs
Sort
View
FQAS
2004
Springer
146views Database» more  FQAS 2004»
15 years 1 months ago
Discovering Representative Models in Large Time Series Databases
The discovery of frequently occurring patterns in a time series could be important in several application contexts. As an example, the analysis of frequent patterns in biomedical ...
Simona E. Rombo, Giorgio Terracina
AHS
2006
IEEE
175views Hardware» more  AHS 2006»
14 years 11 months ago
Face Recognition Using a Gabor Filter Bank Approach
Face recognition is a challenging field of research not only because of the complexity of this subject, but also because of its numerous practical applications. Much progress has ...
Walid Riad Boukabou, Lahouari Ghouti, Ahmed Bourid...
JCT
2007
133views more  JCT 2007»
14 years 9 months ago
Biased graphs. VII. Contrabalance and antivoltages
Abstract. We develop linear representation theory for bicircular matroids, a chief example being a matroid associated with forests of a graph, and bicircular lift matroids, a chief...
Thomas Zaslavsky
PE
1998
Springer
104views Optimization» more  PE 1998»
14 years 9 months ago
Analysis of Transient of the Datagram Traffic for a Demand Assignment TDMA
- A modified version of the datagram capacity assignment of the FODA access scheme, named FODA/IBEA, is briefly presented. The main difference from the previous version (besides th...
Nedo Celandroni
ML
1998
ACM
14 years 9 months ago
On Restricted-Focus-of-Attention Learnability of Boolean Functions
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jac...