Finding a Latent K–simplex in O* (K · Nnz(data)) Time via Subset Smoothing

doi 10.1137/1.9781611975994.8
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Finding Top-K Preferable Products

IEEE Transactions on Knowledge and Data Engineering
Computational TheoryComputer Science ApplicationsInformation SystemsMathematics
2012English

Finding the K Smallest Spanning Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1990English

Finding a Nonempty Algebraic Subset of an Edge Set in Linear Time

Journal of Graph Algorithms and Applications
GeometryComputer Science ApplicationsComputer ScienceMathematicsComputational TheoryTheoretical Computer ScienceTopology
2007English

Finding K-Shortest Paths With Limited Overlap

VLDB Journal
HardwareInformation SystemsArchitecture
2020English

A K-Median Algorithm With Running Time Independent of Data Size

Machine Learning
Artificial IntelligenceSoftware
2004English

Detecting Feedback Vertex Sets of Size K in O*(2.7k) Time

2020English

A New Algorithm for Finding the K Shortest Paths in a Time-Schedule Network With Constraints on Arcs

Journal of Algorithms and Computational Technology
Computational MathematicsApplied MathematicsNumerical Analysis
2016English

A Simple Algorithm for Finding All K-Edge-Connected Components

PLoS ONE
Multidisciplinary
2015English

Index K À O

Revue d'Histoire de l'Amerique Francaise
History
1957English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy