The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification" of the local rule of a corresponding Boolean cellula...
TRIPLES is a web-accessible database of TRansposonInsertion Phenotypes, Localization and Expression in Saccharomyces cerevisiae--a relational database housing nearly half a millio...
Anuj Kumar, Kei-Hoi Cheung, Nick P. Tosches, Peter...
The relation between hard c-means (HCM), fuzzy c-means (FCM), fuzzy learning vector quantization (FLVQ), soft competition scheme (SCS) of Yair et al. (1992) and probabilistic Gaus...