522 search results - page 6 / 105 » The 3-Steiner Root Problem |
ICA
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. A new dictionary learning method for exact sparse representation is presented in this paper. As the dictionary learning methods often iteratively update the sparse coeffi...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
EOR
2007
13 years 8 months ago
2007
The stability domain is a feasible set for numerous optimization problems. D-decomposition technique is targeted to describe the stability domain in the parameter space for linear...
ICONIP
1998
13 years 10 months ago
1998
Many real processes are composed of a n-fold repetition of some simpler process. If the whole process can be modelled with a neural network, we present a method to derive a model ...
DAM
2010
13 years 8 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...