Region‐based estimation of the partition functions for hybrid Bayesian network models
Sign Up to like & getrecommendations! Published in 2022 at "International Journal of Intelligent Systems"
DOI: 10.1002/int.22973
Abstract: The partition function Ƶ ${\boldsymbol{Ƶ}}$ is a normalization constant for normalizing all the distributions in probabilistic inference. Ƶ ${\boldsymbol{Ƶ}}$ is closely related to the log probability of evidence ( log p ( e ) $\mathrm{log}\unicode{x0200A}p(e)$… read more here.
Keywords: partition; mathrm log; log; log mathrm ... See more keywords
Packing returning secretaries
Sign Up to like & getrecommendations! Published in 2021 at "Networks"
DOI: 10.1002/net.22000
Abstract: We study online secretary problems with returns in combinatorial packing domains with n candidates that arrive sequentially over time in random order. The goal is to determine a feasible packing of candidates of maximum total… read more here.
Keywords: returning secretaries; log; packing returning; candidate ... See more keywords
An efficient algorithm to estimate the pith location on an untreated end face image of a rubberwood log taken with a normal camera
Sign Up to like & getrecommendations! Published in 2019 at "European Journal of Wood and Wood Products"
DOI: 10.1007/s00107-019-01433-8
Abstract: Sawmills in Thailand demand an automatic approach to correctly detect rubberwood pith. This is a starting point to maximize the yield of slabs. Knowing the pith location at both end faces of a log makes… read more here.
Keywords: normal camera; rubberwood; pith location; log ... See more keywords
Logarithmic Kodaira dimension and zeros of holomorphic log-one-forms
Sign Up to like & getrecommendations! Published in 2017 at "Mathematische Annalen"
DOI: 10.1007/s00208-020-02031-3
Abstract: In this paper, we prove that the zero-locus of any global holomorphic log-one-form on a projective log-smooth pair ( X ; D ) of log-general type must be non-empty. read more here.
Keywords: holomorphic log; dimension zeros; log one; logarithmic kodaira ... See more keywords
Monochromatic sums of squares
Sign Up to like & getrecommendations! Published in 2018 at "Mathematische Zeitschrift"
DOI: 10.1007/s00209-017-1943-7
Abstract: For any integer $$K\ge 1$$K≥1 let s(K) be the smallest integer such that in any colouring of the set of squares of the integers in K colours every large enough integer can be written as… read more here.
Keywords: log log; integer; monochromatic sums; sums squares ... See more keywords
Longest Increasing Subsequence under Persistent Comparison Errors
Sign Up to like & getrecommendations! Published in 2020 at "Theory of Computing Systems"
DOI: 10.1007/s00224-020-09966-9
Abstract: We study the problem of computing a longest increasing subsequence in a sequence S of n distinct elements in the presence of persistent comparison errors. In this model, Braverman and Mossel ( Noisy sorting without… read more here.
Keywords: persistent comparison; log; subsequence; longest increasing ... See more keywords
On delocalization of eigenvectors of random non-Hermitian matrices
Sign Up to like & getrecommendations! Published in 2018 at "Probability Theory and Related Fields"
DOI: 10.1007/s00440-019-00956-8
Abstract: We study delocalization of null vectors and eigenvectors of random matrices with i.i.d entries. Let A be an $$n\times n$$ n × n random matrix with i.i.d real subgaussian entries of zero mean and unit… read more here.
Keywords: vert mathbf; log log; vert; log ... See more keywords
Cutoff for product replacement on finite groups
Sign Up to like & getrecommendations! Published in 2018 at "Probability Theory and Related Fields"
DOI: 10.1007/s00440-020-00962-1
Abstract: We analyze a Markov chain, known as the product replacement chain , on the set of generating n -tuples of a fixed finite group G . We show that as $$n \rightarrow \infty $$ n… read more here.
Keywords: chain; product; log; product replacement ... See more keywords
A Clustering-Based Approach to Kinetic Closest Pair
Sign Up to like & getrecommendations! Published in 2017 at "Algorithmica"
DOI: 10.1007/s00453-017-0338-9
Abstract: Given a set P of n moving points in fixed dimension d, where the trajectory of each point is a polynomial of degree bounded by some constant, we present a kinetic data structure (KDS) for… read more here.
Keywords: log log; closest pair; log vardelta; log ... See more keywords
Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs
Sign Up to like & getrecommendations! Published in 2018 at "Algorithmica"
DOI: 10.1007/s00453-018-0464-z
Abstract: We present space-efficient algorithms for computing cut vertices in a given graph with n vertices and m edges in linear time using $$O(n+\min \{m,n\log \log n\})$$O(n+min{m,nloglogn}) bits. With the same time and using $$O(n+m)$$O(n+m) bits,… read more here.
Keywords: biconnected components; log; outerplanar graphs; space efficient ... See more keywords
The Complex Parameter Landscape of the Compact Genetic Algorithm
Sign Up to like & getrecommendations! Published in 2021 at "Algorithmica"
DOI: 10.1007/s00453-020-00778-4
Abstract: The compact Genetic Algorithm (cGA) evolves a probability distribution favoring optimal solutions in the underlying search space by repeatedly sampling from the distribution and updating it according to promising samples. We study the intricate dynamics… read more here.
Keywords: sqrt log; population size; compact genetic; log ... See more keywords