Sciweavers

8728 search results - page 170 / 1746
» On Reduct Construction Algorithms
Sort
View
CC
2008
Springer
133views System Software» more  CC 2008»
15 years 6 months ago
Hardness Amplification via Space-Efficient Direct Products
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
Venkatesan Guruswami, Valentine Kabanets
IS
2011
15 years 1 months ago
Optimized query routing trees for wireless sensor networks
In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with ...
Panayiotis Andreou, Demetrios Zeinalipour-Yazti, A...
ISLPED
2005
ACM
96views Hardware» more  ISLPED 2005»
16 years 1 days ago
Region-level approximate computation reuse for power reduction in multimedia applications
ABSTRACT Motivated by data value locality and quality tolerance present in multimedia applications, we propose a new micro-architecture, Region-level Approximate Computation Buffer...
Xueqi Cheng, Michael S. Hsiao
BMCBI
2008
157views more  BMCBI 2008»
15 years 6 months ago
Dimension reduction with redundant gene elimination for tumor classification
Background: Analysis of gene expression data for tumor classification is an important application of bioinformatics methods. But it is hard to analyse gene expression data from DN...
Xue-Qiang Zeng, Guo-Zheng Li, Jack Y. Yang, Mary Q...
LCN
2003
IEEE
15 years 11 months ago
Improving Multicast Tree Construction in Static Ad Hoc Networks
We consider wireless multicast tree construction for energy efficiency. We introduce a novel algorithm, Incremental Shortest Path Tree (ISPT), to generate source-based multicast ...
Aleksi Penttinen, Jorma T. Virtamo