Sciweavers

503 search results - page 48 / 101
» Probabilistic Weighted Automata
Sort
View
MOC
2002
131views more  MOC 2002»
13 years 8 months ago
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
Douglas R. Stinson
ACTA
2008
88views more  ACTA 2008»
13 years 7 months ago
Weighted height of random trees
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
Nicolas Broutin, Luc Devroye, Erin McLeish
ASC
2011
13 years 3 months ago
A note on the learning automata based algorithms for adaptive parameter selection in PSO
: PSO, like many stochastic search methods, is very sensitive to efficient parameter setting such that modifying a single parameter may cause a considerable change in the result. I...
Ali B. Hashemi, Mohammad Reza Meybodi
CVPR
2010
IEEE
14 years 2 months ago
Image Retrieval via Probabilistic Hypergraph Ranking
In this paper, we propose a new transductive learning framework for image retrieval, in which images are taken as vertices in a weighted hypergraph and the task of image search is...
Yuchi Huang, Qingshan Liu, Shaoting Zhang, Metaxas...
NETWORKS
2010
13 years 7 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...