Sciweavers

405 search results - page 21 / 81
» On the Simulation of Tikhonov Random Processes
Sort
View
WSC
2001
14 years 11 months ago
Deterministic fluid models of congestion control in high-speed networks
Congestion control algorithms, such as TCP or the closelyrelated additive increase-multiplicative decrease algorithms, are extremely difficult to simulate on a large scale. The re...
Sanjay Shakkottai, R. Srikant
APPROX
2008
Springer
83views Algorithms» more  APPROX 2008»
14 years 11 months ago
Sampling Hypersurfaces through Diffusion
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
Hariharan Narayanan, Partha Niyogi
BMCBI
2008
138views more  BMCBI 2008»
14 years 10 months ago
Information transfer in signaling pathways: A study using coupled simulated and experimental data
Background: The topology of signaling cascades has been studied in quite some detail. However, how information is processed exactly is still relatively unknown. Since quite divers...
Jürgen Pahle, Anne K. Green, C. Jane Dixon, U...
ICIP
1994
IEEE
15 years 11 months ago
Joint Parameter Estimation and Restoration using MRF Models and Homotopy Continuation Method
This paper presents a joint strategy for parameter estimation of Markov Random Field (MRF) model and image restoration. The proposed scheme is an unsupervised one in the sense tha...
P. K. Nanda, Uday B. Desai, P. G. Poonacha
CORR
2008
Springer
139views Education» more  CORR 2008»
14 years 10 months ago
The Secrecy Graph and Some of its Properties
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
Martin Haenggi