Sciweavers

1541 search results - page 42 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
SAGA
2007
Springer
15 years 10 months ago
Randomized Algorithms and Probabilistic Analysis in Wireless Networking
Abstract. Devices connected wirelessly, in various forms including computers, hand-held devices, ad hoc networks, and embedded systems, are expected to become ubiquitous all around...
Aravind Srinivasan
AUTOMATICA
2004
92views more  AUTOMATICA 2004»
15 years 4 months ago
Randomized algorithms for quadratic stability of quantized sampled-data systems,
In this paper, we present a novel development of randomized algorithms for quadratic stability analysis of sampled-data systems with memoryless quantizers. The speci
Hideaki Ishii, Tamer Basar, Roberto Tempo
ICASSP
2011
IEEE
14 years 7 months ago
Fast network querying algorithm for searching large-scale biological networks
Network querying aims to search a large network for subnetwork regions that are similar to a given query network. In this paper, we propose a novel algorithm for querying large sc...
Sayed Mohammad Ebrahim Sahraeian, Byung-Jun Yoon
FOCS
2006
IEEE
15 years 10 months ago
Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization
We prove that the hit-and-run random walk is rapidly mixing for an arbitrary logconcave distribution starting from any point in the support. This extends the work of [26], where t...
László Lovász, Santosh Vempal...
ICML
2006
IEEE
16 years 4 months ago
Fast direct policy evaluation using multiscale analysis of Markov diffusion processes
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
Mauro Maggioni, Sridhar Mahadevan