Sciweavers

1031 search results - page 8 / 207
» Broadcasting with Selective Reduction
Sort
View
DSN
2006
IEEE
14 years 1 months ago
Solving Atomic Broadcast with Indirect Consensus
In previous work, it has been shown how to solve atomic broadcast by reduction to consensus on messages. While this solution is theoretically correct, it has its limitations in pr...
Richard Ekwall, André Schiper
ICML
2010
IEEE
13 years 8 months ago
From Transformation-Based Dimensionality Reduction to Feature Selection
Many learning applications are characterized by high dimensions. Usually not all of these dimensions are relevant and some are redundant. There are two main approaches to reduce d...
Mahdokht Masaeli, Glenn Fung, Jennifer G. Dy
ATAL
2008
Springer
13 years 9 months ago
Strategyproof deterministic lotteries under broadcast communication
The design of deterministic and fair mechanisms for selection among a set of self-motivated agents based solely on these agents' input is a major challenge in multiagent syst...
Alon Altman, Moshe Tennenholtz
RSKT
2009
Springer
14 years 16 hour ago
A Time-Reduction Strategy to Feature Selection in Rough Set Theory
In rough set theory, the problem of feature selection aims to retain the discriminatory power of original features. Many feature selection algorithms have been proposed, however, q...
Hongxing Chen, Yuhua Qian, Jiye Liang, Wei Wei, Fe...
ISQED
2006
IEEE
107views Hardware» more  ISQED 2006»
14 years 1 months ago
Impact of Gate-Length Biasing on Threshold-Voltage Selection
Gate-length biasing is a runtime leakage reduction technique that leverages on the short-channel effect by marginally increasing the gate-length of MOS devices to significantly ...
Andrew B. Kahng, Swamy Muddu, Puneet Sharma