Sciweavers

841 search results - page 123 / 169
» Approximability of Minimum AND-Circuits
Sort
View
STOC
2002
ACM
115views Algorithms» more  STOC 2002»
14 years 10 months ago
Reimer's inequality and tardos' conjecture
Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...
Clifford D. Smyth
GLOBECOM
2007
IEEE
14 years 4 months ago
Low Complexity Soft-Input Soft-Output Block Decision Feedback Equalization
— A low complexity soft-input soft-output (SISO) block decision feedback equalization (BDFE) algorithm is presented for Turbo equalization. Based on minimum mean square error (MM...
Jingxian Wu, Yahong Rosa Zheng
COCOON
2005
Springer
14 years 3 months ago
Fault-Tolerant Relay Node Placement in Wireless Sensor Networks
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in an Euclidean plane, our objective is to place minimum nu...
Hai Liu, Peng-Jun Wan, Xiaohua Jia
COMPGEOM
2004
ACM
14 years 3 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
SOFSEM
2004
Springer
14 years 3 months ago
Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: For a fixed “forbidden submatrix” B, the question is, given an input matrix A (both A and B have ent...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...