- Full text PDF available (8)
- This year (1)
- Last 5 years (3)
- Last 10 years (8)
Journals and Conferences
A new algorithm for building decision tree classifiers is proposed. The algorithm is executed in a distributed environment and is especially designed for classifying large datasets and streaming data. It is empirically shown to be as accurate as standard decision tree classifiers, while being scalable to infinite streaming data and multiple processors.
Exact Minimum Density of Codes Identifying Vertices in the Square Grid Yael Ben-Haim and Simon Litsyn School of Electrical Engineering Tel-Aviv University Tel-Aviv 69978 Israel An identifying code C is a subset of the vertices of the square grid Z with the property that for each element v of Z, the collection of elements from C at distance at most one from… (More)
One of the major challenges in regenerative medicine is the ability to recreate the stem cell niche, which is defined by its signaling molecules, the creation of cytokine gradients, and the modulation of matrix stiffness. A wide range of scaffolds has been developed in order to recapitulate the stem cell niche, among them hydrogels. This paper reports the… (More)
We study the problem of encoding cardinality constraints (threshold functions) on Boolean variables into CNF. Specifically, we propose new encodings based on (perfect) hashing that are efficient in terms of the number of clauses, auxiliary variables, and propagation strength. We compare the properties of our encodings to known ones, and provide experimental… (More)
New bounds on the rate of non-binary codes and non-binary constant weight codes are derived. The asymptotic forms of these bounds outperform known bounds in a wide range of distances. The method is based on analysis of subsets in products of Hamming and Johnson association schemes
Upper bounds are derived for codes in Stiefel and Grassmann manifolds with given minimum chordal distance. They stem from upper bounds for codes in the product of unit spheres and projective spaces. The new bounds are asymptotically better than the previously known ones.
A new lower bound on the distance distribution of spherical codes is derived. This yields two new upper bounds on the reliability function of the Gaussian channel. These bounds outperform previously known bounds, and imply a new range of rates for which the exact value of the reliability function is known.
Recent advances in single-cell RNA-sequencing (scRNA-seq) technology increase the understanding of immune differentiation and activation processes, as well as the heterogeneity of immune cell types. Although the number of available immune-related scRNA-seq datasets increases rapidly, their large size and various formats render them hard for the wider… (More)