Sciweavers

2342 search results - page 310 / 469
» Sublinear geometric algorithms
Sort
View
143
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Grassmannian predictive coding for limited feedback multiuser MIMO systems
Grassmannian beamforming is an efficient way to quantize channel state information in multiple-input multiple-output wireless systems. Unfortunately, multiuser systems require la...
Takao Inoue, Robert W. Heath Jr.
ICIP
2009
IEEE
16 years 3 months ago
Efficient Distance Estimation For Fitting Implicit Quadric Surfaces
This paper presents a novel approach for estimating the shortest Euclidean distance from a given point to the corresponding implicit quadric fitting surface. It first estimates t...
Angel D. Sappa, Mohammad Rouhani
224
Voted

Publication
519views
14 years 1 months ago
The Finite Volume, Finite Difference, and Finite Elements Methods as Numerical Methods for Physical Field Problems
I. Introduction II. Foundations A. The Mathematical Structure of Physical Field Theories B. Geometric Objects and Orientation 1. Space-Time Object...
Claudio Mattiussi
SMA
2009
ACM
132views Solid Modeling» more  SMA 2009»
15 years 9 months ago
Robust Voronoi-based curvature and feature estimation
Many algorithms for shape analysis and shape processing rely on accurate estimates of differential information such as normals and curvature. In most settings, however, care must...
Quentin Mérigot, Maks Ovsjanikov, Leonidas ...
PPOPP
2012
ACM
13 years 10 months ago
Deterministic parallel random-number generation for dynamic-multithreading platforms
Existing concurrency platforms for dynamic multithreading do not provide repeatable parallel random-number generators. This paper proposes that a mechanism called pedigrees be bui...
Charles E. Leiserson, Tao B. Schardl, Jim Sukha