Sciweavers

13 search results - page 1 / 3
» Large Simple Binary Equality Words
Sort
View
DLT
2008
13 years 7 months ago
Large Simple Binary Equality Words
Abstract. Let w be an equality word of two nonperiodic binary morphisms g, h : {a, b} . Suppose that no overflow occurs twice in w and that w contains at least 9 occurrences of a ...
Jana Hadravová, Stepan Holub
MLQ
2010
65views more  MLQ 2010»
13 years 3 months ago
Tautologies over implication with negative literals
We consider logical expressions built on the single binary connector of implication and a finite number of literals (boolean variables and their negations). We prove that asympto...
Hervé Fournier, Danièle Gardy, Antoi...
EUROSSC
2008
Springer
13 years 7 months ago
Gaussian Process Person Identifier Based on Simple Floor Sensors
Abstract. This paper describes methods and sensor technology used to identify persons from their walking characteristics. We use an array of simple binary switch floor sensors to d...
Jaakko Suutala, Kaori Fujinami, Juha Röning
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
13 years 9 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen
KDD
2005
ACM
166views Data Mining» more  KDD 2005»
14 years 5 months ago
A general model for clustering binary data
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...
Tao Li