Taneli Mielikäinen

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
45Scheduling for real-time mobile MapReduce systems. Adam Ji Dou, Vana Kalogeraki, Dimitrios Gunopulos, Taneli Mielikäinen, Ville H. Tuulos. DEBS 2011, 347-358. Web SearchBibTeXDownload
44Computing Atom Mappings for Biochemical Reactions without Subgraph Isomorphism. Markus Heinonen, Sampsa Lappalainen, Taneli Mielikäinen, Juho Rousu. Journal of Computational Biology (18): 43-58 (2011). Web SearchBibTeXDownload
43Data Clustering on a Network of Mobile Smartphones. Adam Ji Dou, Vana Kalogeraki, Dimitrios Gunopulos, Taneli Mielikäinen, Ville H. Tuulos, Sean Foley, Curtis Yu. SAINT 2011, 118-127. Web SearchBibTeXDownload
2010
42Misco: a MapReduce framework for mobile systems. Adam Ji Dou, Vana Kalogeraki, Dimitrios Gunopulos, Taneli Mielikäinen, Ville H. Tuulos. PETRA 2010. Web SearchBibTeXDownload
2008
41The Discrete Basis Problem. Pauli Miettinen, Taneli Mielikäinen, Aristides Gionis, Gautam Das, Heikki Mannila. IEEE Trans. Knowl. Data Eng. (20): 1348-1362 (2008). Cited by 19Web SearchBibTeXDownload
40Probabilistic Logic Learning from Haplotype Data. Niels Landwehr, Taneli Mielikäinen. Probabilistic Inductive Logic Programming 2008, 263-286. Web SearchBibTeXDownload
2007
39Constrained hidden Markov models for population-based haplotyping. Niels Landwehr, Taneli Mielikäinen, Lauri Eronen, Hannu Toivonen, Heikki Mannila. BMC Bioinformatics (8) (2007). Cited by 14Web SearchBibTeXDownload
38Combining haplotypers. Matti Kääriäinen, Niels Landwehr, Sampsa Lappalainen, Taneli Mielikäinen. CoRR (abs/0710.5116) (2007). Web SearchBibTeXDownload
37Finding low-entropy sets and trees from binary data. Hannes Heikinheimo, Jouni K. Seppänen, Eino Hinkkanen, Heikki Mannila, Taneli Mielikäinen. KDD 2007, 350-359. Cited by 7Web SearchBibTeXDownload
36Assessing data mining results via swap randomization. Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, Panayiotis Tsaparas. TKDD (1) (2007). Cited by 36Web SearchBibTeXDownload
2006
35Planning optimal measurements of isotopomer distributions for estimation of metabolic fluxes. Ari Rantanen, Taneli Mielikäinen, Juho Rousu, Hannu Maaheimo, Esko Ukkonen. Bioinformatics (22): 1198-1206 (2006). Web SearchBibTeXDownload
34Itemset Support Queries Using Frequent Itemsets and Their Condensed Representations. Taneli Mielikäinen, Pance Panov, Saso Dzeroski. Discovery Science 2006, 161-172. Web SearchBibTeXDownload
33Frequency-based views to pattern collections. Taneli Mielikäinen. Discrete Applied Mathematics (154): 1113-1139 (2006). Web SearchBibTeXDownload
32The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization, . Taneli Mielikäinen, Esko Ukkonen. Discrete Applied Mathematics (154): 684-691 (2006). Web SearchBibTeXDownload
31Ab Initio Prediction of Molecular Fragments from Tandem Mass Spectrometry Data. Markus Heinonen, Ari Rantanen, Taneli Mielikäinen, Esa Pitkänen, Juha Kokkonen, Juho Rousu. German Conference on Bioinformatics 2006, 40-53. Web SearchBibTeXDownload
30Cryptographically Private Support Vector Machines. Sven Laur, Helger Lipmaa, Taneli Mielikäinen. IACR Cryptology ePrint Archive (2006): 198 (2006). Web SearchBibTeXDownload
29What is the Dimension of Your Binary Data?. Nikolaj Tatti, Taneli Mielikäinen, Aristides Gionis, Heikki Mannila. ICDM 2006, 603-612. Cited by 12Web SearchBibTeXDownload
28Aggregating time partitions. Taneli Mielikäinen, Evimaria Terzi, Panayiotis Tsaparas. KDD 2006, 347-356. Web SearchBibTeXDownload
27Cryptographically private support vector machines. Sven Laur, Helger Lipmaa, Taneli Mielikäinen. KDD 2006, 618-624. Web SearchBibTeXDownload
26Assessing data mining results via swap randomization. Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, Panayiotis Tsaparas. KDD 2006, 167-176. Cited by 36Web SearchBibTeXDownload
25The Discrete Basis Problem. Pauli Miettinen, Taneli Mielikäinen, Aristides Gionis, Gautam Das, Heikki Mannila. PKDD 2006, 335-346. Cited by 19Web SearchBibTeXDownload
2005
24Summarization Techniques for Pattern Collections in Data Mining. Taneli Mielikäinen. CoRR (abs/cs/0505071) (2005). Web SearchBibTeXDownload
23Planning isotopomer measurements for estimation of metabolic fluxes. Ari Rantanen, Taneli Mielikäinen, Juho Rousu, Esko Ukkonen. German Conference on Bioinformatics 2005, 177-191. Web SearchBibTeXDownload
22Sinogram Denoising of Cryo-Electron Microscopy Images. Taneli Mielikäinen, Janne Ravantti. ICCSA (4) 2005, 1251-1261. Web SearchBibTeXDownload
21Mining Chains of Relations. Foto N. Afrati, Gautam Das, Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, Panayiotis Tsaparas. ICDM 2005, 553-556. Cited by 4Web SearchBibTeXDownload
20Private Itemset Support Counting. Sven Laur, Helger Lipmaa, Taneli Mielikäinen. ICICS 2005, 97-111. Web SearchBibTeXDownload
19Transaction Databases, Frequent Itemsets, and Their Condensed Representations. Taneli Mielikäinen. KDID 2005, 139-164. Web SearchBibTeXDownload
2004
18The Computational Complexity of Orientation Search Problems in Cryo-Electron Microscopy. Taneli Mielikäinen, Janne Ravantti, Esko Ukkonen. CoRR (cs.DS/0406043) (2004). Web SearchBibTeXDownload
17The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization. Taneli Mielikäinen, Esko Ukkonen. CoRR (cs.DS/0405094) (2004). Web SearchBibTeXDownload
16Inductive Databases as Ranking. Taneli Mielikäinen. DaWaK 2004, 149-158. Web SearchBibTeXDownload
15Privacy Problems with Anonymized Transaction Databases. Taneli Mielikäinen. Discovery Science 2004, 219-229. Web SearchBibTeXDownload
14Tiling Databases. Floris Geerts, Bart Goethals, Taneli Mielikäinen. Discovery Science 2004, 278-289. Cited by 31Web SearchBibTeXDownload
13On Private Scalar Product Computation for Privacy-Preserving Data Mining. Bart Goethals, Sven Laur, Helger Lipmaa, Taneli Mielikäinen. ICISC 2004, 104-120. Web SearchBibTeXDownload
12The Computational Complexity of Orientation Search in Cryo-Electron Microscopy. Taneli Mielikäinen, Janne Ravantti, Esko Ukkonen. International Conference on Computational Science 2004, 231-238. Web SearchBibTeXDownload
11An Automata Approach to Pattern Collections. Taneli Mielikäinen. KDID 2004, 130-149. Web SearchBibTeXDownload
10Implicit Enumeration of Patterns. Taneli Mielikäinen. KDID 2004, 150-172. Web SearchBibTeXDownload
9Separating Structure from Interestingness. Taneli Mielikäinen. PAKDD 2004, 476-485. Web SearchBibTeXDownload
8Discovery of Serial Episodes from Streams of Events. Taneli Mielikäinen. SSDBM 2004, 447-448. Web SearchBibTeXDownload
2003
7Chaining Patterns. Taneli Mielikäinen. Discovery Science 2003, 233-244. Web SearchBibTeXDownload
6Intersecting data to closed sets with constraints. Taneli Mielikäinen. FIMI 2003. Web SearchBibTeXDownload
5Change Profiles. Taneli Mielikäinen. ICDM 2003, 219-226. Web SearchBibTeXDownload
4Finding All Occurring Patterns of Interest. Taneli Mielikäinen. KDID 2003, 97-106. Web SearchBibTeX
3What You Store is What You Get. Floris Geerts, Bart Goethals, Taneli Mielikäinen. KDID 2003, 60-69. Cited by 3Web SearchBibTeX
2The Pattern Ordering Problem. Taneli Mielikäinen, Heikki Mannila. PKDD 2003, 327-338. Cited by 26Web SearchBibTeXDownload
2001
1The Complexity of Maximum Matroid-Greedoid Intersection. Taneli Mielikäinen, Esko Ukkonen. FCT 2001, 535-540. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research