The following pages link to (Q4091421):
Displaying 50 items.
- Comparing composite likelihood methods based on pairs for spatial Gaussian random fields (Q69394) (← links)
- On some transformations of high dimension, low sample size data for nearest neighbor classification (Q255361) (← links)
- Automaton semigroups: the two-state case. (Q290910) (← links)
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint (Q312667) (← links)
- Computing covers using prefix tables (Q313747) (← links)
- Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations (Q313770) (← links)
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space (Q316167) (← links)
- Dynamic matchings in left vertex weighted convex bipartite graphs (Q328682) (← links)
- Algebraic phase unwrapping along the real axis: extensions and stabilizations (Q336021) (← links)
- Approximation of smallest linear tree grammar (Q342719) (← links)
- Courcelle's theorem for triangulations (Q346450) (← links)
- An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths (Q350723) (← links)
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants (Q360469) (← links)
- Modular composition modulo triangular sets and applications (Q371190) (← links)
- Extended regular expressions: succinctness and decidability (Q372977) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- Testing probabilistic equivalence through reinforcement learning (Q383369) (← links)
- Linear codes on posets with extension property (Q393354) (← links)
- Linear computation of unbordered conjugate on unordered alphabet (Q393901) (← links)
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
- On demand string sorting over unbounded alphabets (Q418735) (← links)
- A direct calculation of moments of the sample variance (Q419424) (← links)
- Minmax regret bottleneck problems with solution-induced interval uncertainty structure (Q429655) (← links)
- Learning high-dimensional directed acyclic graphs with latent and selection variables (Q450035) (← links)
- Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism (Q450558) (← links)
- Dominating induced matchings for \(P_7\)-free graphs in linear time (Q476446) (← links)
- Arbitrary sequence RAMs (Q477622) (← links)
- 2-approximation algorithm for finding a clique with minimum weight of vertices and edges (Q483409) (← links)
- Recognition of functions invariant under Moebius transformation and even functions defined in polynomial form. (Q487196) (← links)
- Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings (Q507391) (← links)
- Efficient computation of the characteristic polynomial of a threshold graph (Q507427) (← links)
- Maximum cardinality neighbourly sets in quadrilateral free graphs (Q511689) (← links)
- Broadcasting on cactus graphs (Q512890) (← links)
- From imperative to rule-based graph programs (Q516038) (← links)
- Limitations of incremental dynamic programming (Q517805) (← links)
- Orientable edge colorings of graphs (Q531600) (← links)
- The randomized complexity of indefinite integration (Q544127) (← links)
- New complexity results for the \(k\)-covers problem (Q545371) (← links)
- Analysis and synthesis of abstract automata (Q548753) (← links)
- Decision problems for convex languages (Q553302) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Building species trees from larger parts of phylogenomic databases (Q553332) (← links)
- Fast multiplication of a recursive block Toeplitz matrix by a vector and its application (Q578851) (← links)
- Computing the composition factors of a permutation group in polynomial time (Q581532) (← links)
- Efficient memo-table management strategies (Q582879) (← links)
- The theory and practice of distance geometry (Q594021) (← links)
- A note on cake cutting (Q595538) (← links)
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- Concurrent search and insertion in 2-3 trees (Q598814) (← links)
- Finding a homomorphism between two words is NP-complete (Q599499) (← links)
