Sciweavers

1969 search results - page 19 / 394
» Financial Theory 1
Sort
View
ACMSE
2010
ACM
13 years 2 months ago
Learning to rank using 1-norm regularization and convex hull reduction
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
Xiaofei Nan, Yixin Chen, Xin Dang, Dawn Wilkins
BCSHCI
2008
13 years 9 months ago
Low cost prototyping: part 1, or how to produce better ideas faster by getting user reactions early and often
Although approaches to User Centered Software Development have existed for almost 20 years a rift still exists between theory and practice. In practice, many software projects are...
Stephen Brown, Andreas Holzinger
JSYML
2006
79views more  JSYML 2006»
13 years 7 months ago
Local-global properties of positive primitive formulas in the theory of spaces of orderings
f spaces of signs (abstract real spectra) developed in [1] [18]. We consider pp (positive primitive) formulas in the language of reduced special groups as in [20]. We denote the pp...
M. Marshall
FOCS
2008
IEEE
14 years 2 months ago
Near-Optimal Sparse Recovery in the L1 Norm
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
Piotr Indyk, Milan Ruzic
CORR
2012
Springer
218views Education» more  CORR 2012»
12 years 3 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