Sciweavers

2343 search results - page 229 / 469
» Structure and Interpretation of Computer Programs
Sort
View
CORR
2012
Springer
218views Education» more  CORR 2012»
14 years 2 months ago
Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...
Yaniv Plan, Roman Vershynin
ECCC
2002
103views more  ECCC 2002»
15 years 6 months ago
Monotone complexity and the rank of matrices
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
Pavel Pudlák
BIB
2011
15 years 1 months ago
Mutational analysis in RNAs: comparing programs for RNA deleterious mutation prediction
Programs for RNA mutational analysis that are structure-based and rely on secondary structure prediction have been developed and expanded in the past several years. They can be us...
Danny Barash, Alexander Churkin
PPPJ
2009
ACM
16 years 1 months ago
Lazy continuations for Java virtual machines
Continuations, or ’the rest of the computation’, are a concept that is most often used in the context of functional and dynamic programming languages. Implementations of such ...
Lukas Stadler, Christian Wimmer, Thomas Würth...
SEFM
2008
IEEE
16 years 25 days ago
Nullness Analysis in Boolean Form
Attempts to dereference null result in an exception or a segmentation fault. Hence it is important to know those program points where this might occur and prove the others (or the...
Fausto Spoto