Sciweavers

3247 search results - page 137 / 650
» Randomized smoothing networks
Sort
View
IJCNN
2007
IEEE
15 years 10 months ago
Random Feature Subset Selection for Analysis of Data with Missing Features
Abstract - We discuss an ensemble-of-classifiers based algorithm for the missing feature problem. The proposed approach is inspired in part by the random subspace method, and in pa...
Joseph DePasquale, Robi Polikar
CDC
2009
IEEE
181views Control Systems» more  CDC 2009»
15 years 8 months ago
Stability of switched linear systems and the convergence of random products
— In this paper we give conditions that a discrete time switched linear systems must satisfy if it is stable. We do this by calculating the mean and covariance of the set of matr...
Ning Wang, Magnus Egerstedt, Clyde F. Martin
FPGA
2008
ACM
146views FPGA» more  FPGA 2008»
15 years 5 months ago
FPGA-optimised high-quality uniform random number generators
This paper introduces a method of constructing random number generators from four of the basic primitives provided by FPGAs: Flip-Flips, Lookup-Tables, Shift Registers, and RAMs. ...
David B. Thomas, Wayne Luk
152
Voted
IM
2008
15 years 4 months ago
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
Chen Avin
INFOCOM
2010
IEEE
15 years 2 months ago
Random Walks on Digraphs: A Theoretical Framework for Estimating Transmission Costs in Wireless Routing
—In this paper we develop a unified theoretical framework for estimating various transmission costs of packet forwarding in wireless networks. Our framework can be applied to th...
Yanhua Li, Zhi-Li Zhang