Sciweavers

6045 search results - page 216 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
TIT
2010
102views Education» more  TIT 2010»
13 years 3 months ago
On instantaneous relaying
Abstract--The Gaussian, three-node relay channel with orthogonal receive components (i.e., the transmitted signals from the source and the relay do not interfere with each other) i...
Majid Nasiri Khormuji, Mikael Skoglund
ECCV
1996
Springer
14 years 10 months ago
Euclidean Reconstruction: From Paraperspective to Perspective
In this paper we describe a method to perform Euclidean reconstruction with a perspective camera model. It incrementally performs reconstruction with a paraperspective camera in or...
Stéphane Christy, Radu Horaud
COMPGEOM
2004
ACM
14 years 1 months ago
On the least median square problem
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...
Jeff Erickson, Sariel Har-Peled, David M. Mount
ICCSA
2003
Springer
14 years 1 months ago
Coarse-Grained Parallel Matrix-Free Solution of a Three-Dimensional Elliptic Prototype Problem
The finite difference discretization of the Poisson equation in three dimensions results in a large, sparse, and highly structured system of linear equations. This prototype prob...
Kevin P. Allen, Matthias K. Gobbert
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
13 years 8 months ago
The Linear Complexity of a Graph
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In th...
David L. Neel, Michael E. Orrison