Pages that link to "Item:Q735649"

The following pages link to Off-line detection of a quasi-periodically recurring fragment in a numerical sequence (Q735649):

Displaying 9 items.

• An approximation polynomial-time algorithm for a sequence bi-clustering problem (Q498594) (← links)
• A randomized algorithm for two-cluster partition of a set of vectors (Q2354448) (← links)
• A randomized algorithm for a sequence 2-clustering problem (Q2420934) (← links)
• Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem (Q2630015) (← links)
• (Q2998997) (← links)
• (Q3161901) (← links)
• An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors (Q3186839) (← links)
• A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem (Q3186861) (← links)
• (Q5393721) (← links)