Sciweavers

3044 search results - page 287 / 609
» Linear logical approximations
Sort
View
COCOON
2010
Springer
15 years 5 months ago
On Sorting Permutations by Double-Cut-and-Joins
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
Xin Chen
MOC
2010
15 years 1 months ago
On the convergence of Hill's method
Hill's method is a means to numerically approximate spectra of linear differential operators with periodic coefficients. In this paper, we address different issues related to...
Christopher W. Curtis, Bernard Deconinck
184
Voted
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 10 months ago
Large-Scale Convex Minimization with a Low-Rank Constraint
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
Shai Shalev-Shwartz, Alon Gonen, Ohad Shamir
CISS
2010
IEEE
14 years 10 months ago
Turbo reconstruction of structured sparse signals
—This paper considers the reconstruction of structured-sparse signals from noisy linear observations. In particular, the support of the signal coefficients is parameterized by h...
Philip Schniter
SRDS
2007
IEEE
16 years 29 days ago
Customizable Fault Tolerance for Wide-Area Replication
Constructing logical machines out of collections of physical machines is a well-known technique for improving the robustness and fault tolerance of distributed systems. We present...
Yair Amir, Brian A. Coan, Jonathan Kirsch, John La...