Sciweavers

19320 search results - page 308 / 3864
» On the complexity of computing determinants
Sort
View
TCOM
2008
127views more  TCOM 2008»
15 years 6 months ago
Low complexity affine MMSE detector for iterative detection-decoding MIMO OFDM systems
Iterative turbo processing between detection and decoding shows near-capacity performance on a multiple-antenna system. Combining iterative processing with optimum frontend detecti...
Daniel N. Liu, Michael P. Fitz
PODC
2012
ACM
13 years 9 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
ICRA
1994
IEEE
98views Robotics» more  ICRA 1994»
15 years 10 months ago
Efficient Distance Computation Between Non-Convex Objects
This paper describes an efficient algorithm for computing the distance between non-convex objects. Objects are modeled as the union of a set of convex components. From this model ...
Sean Quinlan
NA
2008
92views more  NA 2008»
15 years 6 months ago
Computing bivariate splines in scattered data fitting and the finite-element method
A number of useful bivariate spline methods are global in nature, i.e., all of the coefficients of an approximating spline must be computed at one time. Typically this involves sol...
Larry L. Schumaker
SAC
2008
ACM
15 years 6 months ago
Computing H/D-exchange speeds of single residues from data of peptic fragments
Determining the hydrogen-deuterium exchange speeds of single residues from data for peptic fragments obtained by FT-ICS MS is currently mainly done by manual interpretation. We pr...
Ernst Althaus, Stefan Canzar, Mark R. Emmett, Andr...