Sciweavers

4315 search results - page 845 / 863
» Sorting in linear time
Sort
View
CAD
2006
Springer
13 years 7 months ago
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
Stephane Redon, Ming C. Lin
CORR
2006
Springer
132views Education» more  CORR 2006»
13 years 7 months ago
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. ...
CORR
2006
Springer
117views Education» more  CORR 2006»
13 years 7 months ago
Distributed Transmit Beamforming using Feedback Control
The concept of distributed transmit beamforming is implicit in many key results of network information theory. However, its implementation in a wireless network involves the funda...
Raghuraman Mudumbai, J. Hespanha, Upamanyu Madhow,...
CORR
2006
Springer
152views Education» more  CORR 2006»
13 years 7 months ago
On Reduced Complexity Soft-Output MIMO ML detection
In multiple-input multiple-output (MIMO) fading channels maximum likelihood (ML) detection is desirable to achieve high performance, but its complexity grows exponentially with th...
Massimiliano Siti, Michael P. Fitz
DATAMINE
2006
127views more  DATAMINE 2006»
13 years 7 months ago
Computing LTS Regression for Large Data Sets
Least trimmed squares (LTS) regression is based on the subset of h cases (out of n) whose least squares t possesses the smallest sum of squared residuals. The coverage h may be se...
Peter Rousseeuw, Katrien van Driessen