Sciweavers

598 search results - page 85 / 120
» The Structure of Sparse Resultant Matrices
Sort
View
FOCS
2008
IEEE
13 years 9 months ago
Matrix Sparsification for Rank and Determinant Computations via Nested Dissection
The nested dissection method developed by Lipton, Rose, and Tarjan is a seminal method for quickly performing Gaussian elimination of symmetric real positive definite matrices who...
Raphael Yuster
CVPR
2006
IEEE
14 years 11 months ago
Multiview Geometry for Texture Mapping 2D Images Onto 3D Range Data
The photorealistic modeling of large-scale scenes, such as urban structures, requires a fusion of range sensing technology and traditional digital photography. This paper presents...
Lingyun Liu, Gene Yu, George Wolberg, Siavash Zoka...
PLDI
2003
ACM
14 years 2 months ago
Compile-time composition of run-time data and iteration reorderings
Many important applications, such as those using sparse data structures, have memory reference patterns that are unknown at compile-time. Prior work has developed runtime reorderi...
Michelle Mills Strout, Larry Carter, Jeanne Ferran...
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 9 months ago
Sequential Compressed Sensing
Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sens...
Dmitry M. Malioutov, Sujay Sanghavi, Alan S. Wills...
GECCO
2000
Springer
101views Optimization» more  GECCO 2000»
14 years 13 days ago
Polynomial Time Summary Statistics for Two general Classes of Functions
In previous work we showed, by Walsh analysis, that summary statistics such as mean, variance, skew, and higher order statistics can be computed in polynomial time for embedded la...
Robert B. Heckendorn