Sciweavers

227 search results - page 2 / 46
» Deterministic Sampling Algorithms for Network Design
Sort
View
IPPS
1998
IEEE
13 years 9 months ago
On Randomized and Deterministic Schemes for Routing and Sorting on Fixed-Connection Networks
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
Torsten Suel
TNN
2008
82views more  TNN 2008»
13 years 5 months ago
Deterministic Learning for Maximum-Likelihood Estimation Through Neural Networks
In this paper, a general method for the numerical solution of maximum-likelihood estimation (MLE) problems is presented; it adopts the deterministic learning (DL) approach to find ...
Cristiano Cervellera, Danilo Macciò, Marco ...
AAAI
2006
13 years 6 months ago
Sound and Efficient Inference with Probabilistic and Deterministic Dependencies
Reasoning with both probabilistic and deterministic dependencies is important for many real-world problems, and in particular for the emerging field of statistical relational lear...
Hoifung Poon, Pedro Domingos
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
13 years 1 days ago
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...
HIS
2001
13 years 6 months ago
Global Optimisation of Neural Networks Using a Deterministic Hybrid Approach
Selection of the topology of a neural network and correct parameters for the learning algorithm is a tedious task for designing an optimal artificial neural...
Gleb Beliakov, Ajith Abraham