Sciweavers

1566 search results - page 11 / 314
» On a Cone Covering Problem
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Discrete regression methods on the cone of positive-definite matrices
We consider the problem of fitting a discrete curve to time-labeled data points on the set Pn of all n-by-n symmetric positive-definite matrices. The quality of a curve is measu...
Nicolas Boumal, Pierre-Antoine Absil
CMPB
2010
186views more  CMPB 2010»
13 years 7 months ago
GPU-based cone beam computed tomography
The use of cone beam computed tomography (CBCT) is growing in the clinical arena due to its ability to provide 3-D information during interventions, its high diagnostic quality (su...
Peter B. Noël, Alan M. Walczak, Jinhui Xu, Ja...
MOR
2002
72views more  MOR 2002»
13 years 7 months ago
An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
Semidefinite feasibility problems arise in many areas of operations research. The abstract form of these problems can be described as finding a point in a nonempty bounded convex b...
Jie Sun, Kim-Chuan Toh, Gongyun Zhao
CCCG
2004
13 years 8 months ago
On computing enclosing isosceles triangles and related problems
Given a set of n points in the plane, we show how to compute various enclosing isosceles triangles where different parameters such as area or perimeter are optimized. We then stud...
Prosenjit Bose, Carlos Seara, Saurabh Sethia
NIPS
2003
13 years 8 months ago
When Does Non-Negative Matrix Factorization Give a Correct Decomposition into Parts?
We interpret non-negative matrix factorization geometrically, as the problem of finding a simplicial cone which contains a cloud of data points and which is contained in the posi...
David L. Donoho, Victoria Stodden