arxiv.org/abs/1208.3047v1
In this paper, MapReduce programming model is used to parallelize training and tagging proceess in Maximum Entropy part of speech tagging for Bahasa Indonesia. In training process, MapReduce model is implemented dictionary, tagtoken, and feature crea...
arxiv.org/abs/math/0201226v2
This paper proves that the maximum number of rational points on a smooth, absolutely irreducible genus 4 curve over the field of 8 elements is 25. The body of the paper shows that 27 points is not possible using techniques from algebraic geometry....
arxiv.org/abs/2407.03492v1
We consider bounds on maximum nullity of a graph via transversal numbers of compatible collections of forts. Results include generalizations of theorems from symmetric to combinatorially symmetric matrices, special bases of matrix nullspaces derived...
arxiv.org/abs/1904.08625v1
In this paper, the maximum spacing method is considered for multivariate observations. Nearest neighbour balls are used as a multidimensional analogue to univariate spacings. A class of information-type measures is used to generalize the concept of m...
arxiv.org/abs/2204.04757v2
We present a streamlined proof of the foundational result in the theory of exponential random graph models (ERGMs) that the maximum likelihood estimate exists if and only if the target statistic lies in the relative interior of the convex hull of the...
www.bing.com/ck/a?!&&p=c3f7a7e760e639fe3216f712aed290cdc342228a3bc09a3e7b037013610d2f50JmltdHM9MTc3MjY2ODgwMA&ptn=3&ver=2&hsh=4&fclid=0d25cf7f-ae06-6f81-3b84-d86caffb6ea5&u=a1aHR0cHM6Ly93d3cuY29sbGluc2RpY3Rpb25hcnkuY29tL2RpY3Rpb25hcnkvZW5nbGlzaC9tYXhpbWl6ZQ&ntb=1
2 meanings: 1. to make as high or great as possible; increase to a maximum 2. mathematics to find the maximum of (a function)....
en.wikipedia.org/wiki/Expectation%E2%80%93maximization_algorithm
In statistics, an expectation–maximization (EM) algorithm is an iterative method to find (local) maximum likelihood or maximum a posteriori (MAP) estimates
arxiv.org/abs/2303.17215v3
We apply the stabilizer formalism to the Maximum Cut problem, and obtain a new greedy construction heuristic. It turns out to be an elegant synthesis of the edge-contraction and differencing edge-contraction approaches. Utilizing the relation between...
arxiv.org/abs/2602.10461v1
Both the backpropagation algorithm in machine learning and the maximum principle in optimal control theory are posed as a two-point boundary problem, resulting in a "forward-backward" lock. We derive a reformulation of the maximum principle in optima...
arxiv.org/abs/2407.05356v4
This paper studies mean-field control problems with state-control joint law dependence and Poissonian common noise. We develop the stochastic maximum principle (SMP) and establish its connection to the Hamiltonian-Jacobi-Bellman (HJB) equation on the...
arxiv.org/abs/2004.08180v1
In this paper, we formulate newly a hierarchical convex optimization for multiclass SVM achieving maximum pairwise margins with least empirical hinge-loss. This optimization problem is a most faithful as well as robust multiclass extension of an NP-h...
arxiv.org/abs/1506.03782v1
The most common decision criteria for decoding are maximum likelihood decoding and nearest neighbor decoding. It is well-known that maximum likelihood decoding coincides with nearest neighbor decoding with respect to the Hamming metric on the binary...
arxiv.org/abs/2010.02324v2
We design quantum algorithms for maximum matching. Working in the query model, in both adjacency matrix and adjacency list settings, we improve on the best known algorithms for general graphs, matching previously obtained results for bipartite graphs...
arxiv.org/abs/0711.3694v1
The paper concerns the study of the Pontryagin Maximum Principle for an infinite dimensional and infinite horizon boundary control problem for linear partial differential equations. The optimal control model has already been studied both in finite...
arxiv.org/abs/0712.1097v1
Maximum Satisfiability (MaxSAT) is a well-known optimization pro- blem, with several practical applications. The most widely known MAXS AT algorithms are ineffective at solving hard problems instances from practical application domains. Recent work...
arxiv.org/abs/1004.1814v5
We show that the maximum clique problem (decision version) can be expressed in existential second order (ESO) logic, where the first order part is a Horn formula in second-order quantified predicates. Without ordering, the first order part is $Π_2$...
www.bing.com/ck/a?!&&p=337ea59b200715dc662b832f4af2efa119220cd326323c63e4f439f43181d236JmltdHM9MTc3MjU4MjQwMA&ptn=3&ver=2&hsh=4&fclid=0662f86c-b7ac-6e13-3855-ef7eb60a6fe5&u=a1aHR0cHM6Ly9mb3J1bXMubmpwaW5lYmFycmVucy5jb20vdGhyZWFkcy9tYXhpbXVtLXNlY3VyaXR5LjEzMDE5Lw&ntb=1
May 12, 2019 · Since it is a rainy day maybe you may want to discuss this. I watched the video and believe Maximum Security got ripped off...
arxiv.org/abs/2410.07187v1
The current study formulates a convective model of the Lorenz type near the temperature of maximum density. The existence of this temperature actualizes water dynamics in temperate lakes. There is a conceptual interest what this feature induces in Lo...
en.wikipedia.org/wiki/Vital_capacity
Vital capacity (VC) is the maximum amount of air a person can expel from the lungs after a maximum inhalation. It is equal to the sum of inspiratory reserve
arxiv.org/abs/2106.03545v1
In this paper, we consider the task of computing an independent set of maximum weight in a given $d$-claw free graph $G=(V,E)$ equipped with a positive weight function $w:V\rightarrow\mathbb{R}^+$. In doing so, $d\geq 2$ is considered a constant. The...