Sciweavers

4103 search results - page 239 / 821
» Some results on the Collatz problem
Sort
View
ICC
2007
IEEE
120views Communications» more  ICC 2007»
16 years 1 months ago
On the Tails of the Distribution of the Sum of Lognormals
—Finding the distribution of the sum of lognormal We assume in this paper that the terms Yi are independent. The random variables is an important mathematical problem in probabil...
Sebastien S. Szyszkowicz, Halim Yanikomeroglu
GECCO
2005
Springer
130views Optimization» more  GECCO 2005»
16 years 8 days ago
ATNoSFERES revisited
ATNoSFERES is a Pittsburgh style Learning Classifier System (LCS) in which the rules are represented as edges of an Augmented Transition Network. Genotypes are strings of tokens ...
Samuel Landau, Olivier Sigaud, Marc Schoenauer
242
Voted
ECCV
2008
Springer
16 years 11 months ago
Generative Image Segmentation Using Random Walks with Restart
We consider the problem of multi-label, supervised image segmentation when an initial labeling of some pixels is given. In this paper, we propose a new generative image segmentatio...
Tae Hoon Kim (Seoul National University), Kyoung M...
PODS
2001
ACM
135views Database» more  PODS 2001»
16 years 6 months ago
On the Complexity of Join Predicates
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Ka...
FOCS
2007
IEEE
16 years 1 months ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx