Pages that link to "Item:Q5305869"
From MaRDI portal
The following pages link to Learning Theory and Kernel Machines (Q5305869):
Displaying 6 items.
- Finding biclusters by random projections (Q859851) (← links)
- Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
- Efficient approximation for restricted biclique cover problems (Q2331611) (← links)
- Parameterized algorithms for edge biclique and related problems (Q2636505) (← links)
- Inapproximability of Maximum Weighted Edge Biclique and Its Applications (Q3502654) (← links)
- Parameterized Algorithms for Maximum Edge Biclique and Related Problems (Q4632171) (← links)
