Sciweavers

28888 search results - page 42 / 5778
» Computability and complexity in analysis
Sort
View
ISSAC
1997
Springer
157views Mathematics» more  ISSAC 1997»
14 years 1 hour ago
On the Worst-case Complexity of Integer Gaussian Elimination
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
Xin Gui Fang, George Havas
ACRI
2010
Springer
13 years 6 months ago
The Complexity of Three-Dimensional Critical Avalanches
In this work we study the complexity of the three-dimensional sandpile avalanches triggered by the addition of two critical configurations. We prove that the algorithmic problem c...
Carolina Mejía, J. Andrés Montoya
GLOBECOM
2007
IEEE
14 years 2 months ago
Time-Varying Channel Complex Gains Estimation and ICI Suppression in OFDM Systems
—In this paper, we present an iterative algorithm for channel complex gains estimation with inter-sub-carrierinterference (ICI) reduction in orthogonal-frequency-divisionmultiple...
Hussein Hijazi, Laurent Ros
MM
2006
ACM
143views Multimedia» more  MM 2006»
14 years 1 months ago
Motion swarms: video interaction for art in complex environments
We create interactive art that can be enjoyed by groups such as audiences at public events with the intent to encourage communication with those around us as we play with the art....
Quoc Nguyen, Scott Novakowski, Jeffrey E. Boyd, Ch...
TCOM
2010
110views more  TCOM 2010»
13 years 6 months ago
Joint data QR-detection and Kalman estimation for OFDM time-varying Rayleigh channel complex gains
—This paper deals with the case of a high speed mobile receiver operating in an orthogonal-frequency-divisionmultiplexing (OFDM) communication system. Assuming the knowledge of d...
Hussein Hijazi, Laurent Ros