Sciweavers

2312 search results - page 145 / 463
» The complexity of estimating min-entropy
Sort
View
ICML
2006
IEEE
16 years 7 months ago
Efficient lazy elimination for averaged one-dependence estimators
Semi-naive Bayesian classifiers seek to retain the numerous strengths of naive Bayes while reducing error by weakening the attribute independence assumption. Backwards Sequential ...
Fei Zheng, Geoffrey I. Webb
VLSID
2004
IEEE
135views VLSI» more  VLSID 2004»
16 years 6 months ago
Integrating Self Testability with Design Space Exploration by a Controller based Estimation Technique
Recent research for testable designs has focussed on inserting test structures by re-arranging an Register-TransferLevel (RTL) data path generated from a behavioural description t...
M. S. Gaur, Mark Zwolinski
STOC
2004
ACM
122views Algorithms» more  STOC 2004»
16 years 6 months ago
Estimating the weight of metric minimum spanning trees in sublinear-time
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
Artur Czumaj, Christian Sohler
ICC
2008
IEEE
156views Communications» more  ICC 2008»
16 years 28 days ago
Cross-Layer Design for the MIMO System with Zero-Forcing Receiver in the Presence of Channel Estimation Error
—Multiple input multiple output (MIMO) system has been recognized as a promising candidate for future wireless communication. The adaptive modulation which adjusts the transmitte...
Feng Jiang, Ying Wang, Xi Fang, Kai Sun, Guona Hu,...
ADHOCNOW
2008
Springer
16 years 26 days ago
DIN: An Ad-Hoc Algorithm to Estimate Distances in Wireless Sensor Networks
Abstract. A current challenge in wireless sensor networks is the positioning of sensor nodes for indoor environments without dedicated hardware. Especially in this domain, many app...
Freddy López Villafuerte, Jochen H. Schille...