Sciweavers

97 search results - page 19 / 20
» Approximate center points with proofs
Sort
View
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 7 months ago
Dial a Ride from k-forest
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 × ...
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath ...
COMPGEOM
2009
ACM
14 years 2 months ago
Coresets for polytope distance
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...
Bernd Gärtner, Martin Jaggi
TCS
2011
13 years 2 months ago
On the relationship between fuzzy and Boolean cellular automata
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...
Heather Betel, Paola Flocchini
NAR
2002
67views more  NAR 2002»
13 years 7 months ago
The TRIPLES database: a community resource for yeast molecular biology
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...
NN
1998
Springer
177views Neural Networks» more  NN 1998»
13 years 7 months ago
Soft vector quantization and the EM algorithm
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...
Ethem Alpaydin