568 search results - page 79 / 114 » New bounds for the Cebysev functional |
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
PKDD
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
ISBI
2007
IEEE
14 years 1 months ago
2007
IEEE
Three-dimensional mammary cell culture models offer new opportunities for the development of computational techniques for segmentation, localization, and multicellular organizatio...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
VTC
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we present an asymptotical analysis of channel capacity of Bell labs layered space-time (BLAST) architectures based on a zero-forcing (ZF) criterion in the sense of...