<em id="zlul0"></em><dl id="zlul0"><menu id="zlul0"></menu></dl>

    <em id="zlul0"></em>

      <dl id="zlul0"></dl>
        <div id="zlul0"><tr id="zlul0"><object id="zlul0"></object></tr></div>
        <em id="zlul0"></em>

        <div id="zlul0"><ol id="zlul0"></ol></div>

        Questions tagged [algorithms]

        Informally, an algorithm is a set of explicit instructions used to solve a problem (e.g. Euclid's algorithm for computing the greatest common divisor of two integers). For more specific questions on algorithms, this tag may be used in conjunction with the approximation-algorithms, algorithmic-randomness and algorithmic-topology tags.

        Filter by
        Sorted by
        Tagged with
        2
        votes
        0answers
        49 views

        Iterative algorithms for computing the kernel of a matrix

        Suppose $A$ is an $m \times n$ matrix in the form $$A=\begin{pmatrix} — a_1 —\\ — a_2 —\\ \vdots \\?— a_m — \end{pmatrix}$$ where $a_i \in R^n$ is the $i$-th row of $A$. It is possible to determine ...
        2
        votes
        0answers
        24 views

        Practical calculation of minimum weight vertex-disjoint cycle covers

        How are minimum-weight vertex-disjoint cycle covers of large dense symmetric graphs actually calculated in actual implementations? I know that the problem can be reduced to general matching by ...
        5
        votes
        3answers
        116 views

        Fast computation of a ball with radius r with largest number of input points

        We are given a set S of n points equipped with some metric and an integer $r>0$. We define $B(x,r) \subseteq S$ (the ball with radius r centered in x) to be the set of points in S within distance r ...
        1
        vote
        0answers
        41 views

        Correctly defining a grah problem [closed]

        I would like to solve a graph theory problem but I am struggling finding the most efficient Algo to solve it because I'm not correctly defining it. Here is my problem: I have two sets of data: A={A1,...
        0
        votes
        0answers
        38 views

        Linear-algebraic simplification of the Smallest Grammar Problem

        I don't get any people interested on MSE usually with this type of problem, and it is an untried idea. So I'm testing the waters out here. :) The smallest grammar problem problem once solved will ...
        -1
        votes
        0answers
        83 views

        Computing the number of topologies on a finite set [duplicate]

        Denote by $T(n)$ the number of non-homeomorphic topologies on a set with $n$ elements. I recently noticed that I am not aware of any good way of computing $T(n)$. Is there an interesting lower bound ...
        1
        vote
        0answers
        74 views

        Binary search extension for determining a hyperplane splitting a set of points in $\mathbb{R}^d$

        We are given a set $S$ of $n$ points in $\mathbb{R}^d$ and a (hidden) vector $\mathbf{w}\in\mathbb{R}^d$, where each point $\mathbf{v}\in S$ is associated with a binary label equal to the sign of $\...
        0
        votes
        3answers
        355 views

        Given $N$ integers on a circle, how to choose them in pairs to obtain minimum sum?

        (Added by YCor 2019 July 7): it has been mentioned in the comments that this is part of a contest "Circular merging, July Challenge 2019 Division 1", where an equivalent question (just more clearly ...
        3
        votes
        2answers
        103 views

        Algorithm to list all Kostant partitions

        Let $\Phi_+$ be the set of positive roots in some root system, and let $Q_+$ be the positive part of the root lattice, i.e., the set of elements of the form $\sum_{\beta\in \Phi_+}m_\beta\beta$ with $...
        2
        votes
        1answer
        211 views

        What's the runtime of this method and is this method correct?

        Let $n=pq$ be the prime decomposition. I am searching for $l$ such that there exists a $k$ with: $$n^l = a \cdot 2^k + b$$ and $$ 1 < \gcd(b,n^l) < n^l$$ Edit by comment of @GerryMyerson: If $...
        3
        votes
        0answers
        59 views

        How to inference the dual form of perceptron?

        The model of perceptron is a linear binary classifier, which is $f(x)=\mathbb{sign}(w^Tx+b)$. $x$ is the datapoint as $w$ as well as $b$ are the parameters. The cost function of Primal Perceptron is $...
        0
        votes
        0answers
        42 views

        Jordan Decomposition of Sparse matrix

        Suppose we are given $n \times n$ rational matrix, $A$ with at most $k$ nonzero elements in each row and each column with $k \ll n$. What is the best algorithm to compute its Jordan decomposition? ...
        2
        votes
        0answers
        45 views

        Calculating Minimum Spanning Trees in Very Big Graphs

        I need to determine Minimum Spanning Trees (MST) of very big complete graphs, whose edgeweights can be calculated from data that is associated with the vertices. In the planar euclidean case, for ...
        2
        votes
        1answer
        52 views

        Intersection of sphere with triangle containing moving vertices

        First off, apologies if I cannot properly articulate my question in the most formal way. However, I believe my question should be simple enough to grasp anyhow. In $\mathbb{R}^3$, I would like to ...
        2
        votes
        0answers
        17 views

        Difference Between Total Least Squares Plane and Plane Orthogonal to Principal Axis of Inertia Tensor

        Given a finite set $P$ of points in $\mathbb{E}^3$ , one can calculate an approximating plane either as the solution of a Total Least Squares problem or by interpreting the problem physically, ...

        15 30 50 per page
        山西福彩快乐十分钟
          <em id="zlul0"></em><dl id="zlul0"><menu id="zlul0"></menu></dl>

          <em id="zlul0"></em>

            <dl id="zlul0"></dl>
              <div id="zlul0"><tr id="zlul0"><object id="zlul0"></object></tr></div>
              <em id="zlul0"></em>

              <div id="zlul0"><ol id="zlul0"></ol></div>
                <em id="zlul0"></em><dl id="zlul0"><menu id="zlul0"></menu></dl>

                <em id="zlul0"></em>

                  <dl id="zlul0"></dl>
                    <div id="zlul0"><tr id="zlul0"><object id="zlul0"></object></tr></div>
                    <em id="zlul0"></em>

                    <div id="zlul0"><ol id="zlul0"></ol></div>
                    湖北11选5乐选玩法 入侵黑彩服务器 河南泳坛夺金结果查询200期 下载重庆时时彩手机app网投 青岛红心棋牌游戏 北京赛pk10搜狐 幸福彩双色球推荐号码 优信彩票大发时时彩 吉林时时开奖票控 pk10开奖记录