Sciweavers

746 search results - page 105 / 150
» Fast (Structured) Newton Computations
Sort
View
GRAPHITE
2007
ACM
14 years 26 days ago
Visibility map for global illumination in point clouds
Point-sampled geometry has gained significant interest due to their simplicity. The lack of connectivity touted as a plus, however, creates difficulties in many operations like ge...
Rhushabh Goradia, Anil Kanakanti, Sharat Chandran,...
GD
2008
Springer
13 years 10 months ago
The Binary Stress Model for Graph Drawing
We introduce a new force-directed model for computing graph layout. The model bridges the two more popular force directed approaches – the stress and the electrical-spring models...
Yehuda Koren, Ali Civril
CVPR
2012
IEEE
11 years 11 months ago
Fixed-rank representation for unsupervised visual learning
Subspace clustering and feature extraction are two of the most commonly used unsupervised learning techniques in computer vision and pattern recognition. State-of-theart technique...
Risheng Liu, Zhouchen Lin, Fernando De la Torre, Z...
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
14 years 18 days ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
IVC
2007
164views more  IVC 2007»
13 years 9 months ago
Locality preserving CCA with applications to data visualization and pose estimation
- Canonical correlation analysis (CCA) is a major linear subspace approach to dimensionality reduction and has been applied to image processing, pose estimation and other fields. H...
Tingkai Sun, Songcan Chen