12 citations · 14 across the 3 of their papers we have counts for
3 papers
cs.DB2005★ 12 cited
Summarization Techniques for Pattern Collections in Data Mining
Taneli Mielikäinen
Discovering patterns from data is an important task in data mining. There exist techniques to find large collections of many kinds of patterns from data very efficiently. A collect…
cs.DS2004★ 2 cited
The Computational Complexity of Orientation Search Problems in Cryo-Electron Microscopy
Taneli Mielikäinen, Janne Ravantti, Esko Ukkonen
In this report we study the problem of determining three-dimensional orientations for noisy projections of randomly oriented identical particles. The problem is of central importan…
cs.DS2004
The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization
Taneli Mielikäinen, Esko Ukkonen
The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown -hard by expressing the satisfiability of boolean formulas in 3-conjun…