Sciweavers

1763 search results - page 89 / 353
» Dependent random choice
Sort
View
IWCIA
2004
Springer
14 years 2 months ago
Corner Detection and Curve Partitioning Using Arc-Chord Distance
Abstract. Several authors have proposed algorithms for curve partitioning using the arc-chord distance formulation, where a chord whose associated arc spans k pixels is moved along...
Majed Marji, Reinhard Klette, Pepe Siy
UAI
2008
13 years 10 months ago
The Phylogenetic Indian Buffet Process: A Non-Exchangeable Nonparametric Prior for Latent Features
Nonparametric Bayesian models are often based on the assumption that the objects being modeled are exchangeable. While appropriate in some applications (e.g., bag-ofwords models f...
Kurt T. Miller, Thomas L. Griffiths, Michael I. Jo...
ICGA
1993
140views Optimization» more  ICGA 1993»
13 years 10 months ago
Expected Allele Coverage and the Role of Mutation in Genetic Algorithms
It is part of the traditional lore of genetic algorithms that low mutation rates lead to efficient search of the solution space, while high mutation rates result in diffusion of s...
David M. Tate, Alice E. Smith
AAECC
2008
Springer
63views Algorithms» more  AAECC 2008»
13 years 9 months ago
Probabilistic algorithms for computing resolvent representations of regular differential ideals
In a previous article [14], we proved the existence of resolvent representations for regular differential ideals. The present paper provides practical algorithms for computing suc...
Thomas Cluzeau, Evelyne Hubert
IJISMD
2010
135views more  IJISMD 2010»
13 years 6 months ago
On the Usage of Labels and Icons in Business Process Modeling
The value of business process models is dependent not only on the choice of graphical elements in the model, but also on their annotation with additional textual and graphical inf...
Jan Mendling, Jan Recker, Hajo A. Reijers