Sciweavers

324 search results - page 64 / 65
» Bounds for Functions of Dependent Risks
Sort
View
NIPS
2008
13 years 8 months ago
Automatic online tuning for fast Gaussian summation
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to...
Vlad I. Morariu, Balaji Vasan Srinivasan, Vikas C....
AUTOMATICA
2007
145views more  AUTOMATICA 2007»
13 years 7 months ago
Decentralized adaptive output-feedback stabilization for large-scale stochastic nonlinear systems
In this paper, the problem of decentralized adaptive output-feedback stabilization is investigated for large-scale stochastic nonlinear systems with three types of uncertainties, ...
Shu-Jun Liu, Ji-Feng Zhang, Zhong-Ping Jiang
JCSS
2008
90views more  JCSS 2008»
13 years 7 months ago
Fault tolerance in cellular automata at high fault rates
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply ...
Mark McCann, Nicholas Pippenger
MONET
2006
103views more  MONET 2006»
13 years 7 months ago
Minimum-Energy Broadcasting in Multi-hop Wireless Networks Using a Single Broadcast Tree
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the s...
Ioannis Papadimitriou, Leonidas Georgiadis
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 7 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck