Sciweavers

7773 search results - page 137 / 1555
» On generalized Frame-Stewart numbers
Sort
View
DLT
2009
14 years 7 months ago
On Negative Bases
Abstract. We study expansions in non-integer negative base - introduced by Ito and Sadahiro [7]. Using countable automata associated with (-)-expansions, we characterize the case w...
Christiane Frougny, Anna Chiara Lai
SIAMJO
2010
125views more  SIAMJO 2010»
14 years 4 months ago
Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
Shai Shalev-Shwartz, Nathan Srebro, Tong Zhang
GLOBECOM
2009
IEEE
15 years 4 months ago
Feasibility Conditions for Interference Alignment
—The degrees of freedom (DoF) of K-user MIMO interference networks with constant channel coefficients are not known in general. Determining the feasibility of a linear interfere...
Cenk M. Yetis, Tiangao Gou, Syed Ali Jafar, Ahmet ...
MKM
2009
Springer
15 years 4 months ago
Combined Decision Techniques for the Existential Theory of the Reals
Methods for deciding quantifier-free non-linear arithmetical conjectures over R are crucial in the formal verification of many realworld systems and in formalised mathematics. Wh...
Grant Olney Passmore, Paul B. Jackson
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Fast Algorithms for Computing the Tripartition-Based Distance Between Phylogenetic Networks
Consider two phylogenetic networks N and N′ of size n. The tripartition-based distance finds the proportion of tripartitions which are not shared by N and N′ . This distance i...
Nguyen Bao Nguyen, C. Thach Nguyen, Wing-Kin Sung