Sciweavers

3172 search results - page 153 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
ICPR
2002
IEEE
16 years 7 months ago
Prototype Selection for Finding Efficient Representations of Dissimilarity Data
The nearest neighbor (NN) rule is a simple and intuitive method for solving classification problems. Originally, it uses distances to the complete training set. It performs well, ...
Elzbieta Pekalska, Robert P. W. Duin
ICML
2009
IEEE
16 years 7 months ago
Proximal regularization for online and batch learning
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
Chuong B. Do, Quoc V. Le, Chuan-Sheng Foo
RECOMB
2002
Springer
16 years 6 months ago
Deconvolving sequence variation in mixed DNA populations
We present an original approach to identifying sequence variants in a mixed DNA population from sequence trace data. The heart of the method is based on parsimony: given a wildtyp...
Andy Wildenberg, Steven Skiena, Pavel Sumazin
DCC
2008
IEEE
16 years 6 months ago
Asymmetric Multi-level Diversity Coding
Symmetric multilevel diversity coding was introduced by Roche et al, where a set of K information sources is encoded by K encoders and the decoders reconstruct sources 1, . . . , ...
Soheil Mohajer, Chao Tian, Suhas N. Diggavi
CIAC
2010
Springer
251views Algorithms» more  CIAC 2010»
16 years 3 months ago
A parameterized algorithm for Chordal Sandwich
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
Pinar Heggernes, Federico Mancini, Jesper Nederlof...