Sciweavers

588 search results - page 114 / 118
» Computing the Dimension of Linear Subspaces
Sort
View
CORR
2012
Springer
218views Education» more  CORR 2012»
12 years 5 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
CORR
2008
Springer
190views Education» more  CORR 2008»
13 years 8 months ago
Chain-Based Representations for Solid and Physical Modeling
In this paper we show that the (co)chain complex associated with a decomposition of the computational domain, commonly called a mesh in computational science and engineering, can b...
Antonio DiCarlo, Franco Milicchio, Alberto Paoluzz...
VISUALIZATION
2005
IEEE
14 years 3 months ago
Evolutionary Morphing
We introduce a technique to visualize the gradual evolutionary change of the shapes of living things as a morph between known three-dimensional shapes. Given geometric computer mo...
David F. Wiley, Nina Amenta, Dan A. Alcantara, Deb...
CAE
2010
13 years 4 months ago
Learning about Shadows from Artists
Renaissance artists discovered methods for imaging realistic depth on a two dimensional surface by re-inventing linear perspective. In solving the problem of depth depiction, they...
Elodie Fourquet
COMPGEOM
2006
ACM
14 years 3 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...