Publications

Search for publications at Department of Computer Science

Below you find a complete list of publications published and edited by scientists at the Department of Computer Science

Moeslund, J. E., Arge, L., Bøcher, P. K., Dalgaard, T. & Svenning, J.-C. (2013). Topography as a driver of local terrestrial vascular plant diversity patterns. Nordic Journal of Botany, 31(2), 129-144. https://doi.org/10.1111/j.1756-1051.2013.00082.x

Aehnelt, M., Schulz, H.-J. & Urban, B. (2013). Towards a Contextualized Visual Analysis of Heterogeneous Manufacturing Data. In Advances in Visual Computing : 9th International Symposium, ISVC 2013, Rethymnon, Crete, Greece, July 29-31, 2013. Proceedings, Part II (pp. 76-85). Springer. https://doi.org/10.1007/978-3-642-41939-3_8

Derczynski, L., Yang, B. & Jensen, C. S. (2013). Towards Context-Aware Search and Analysis on Social Media Data. In G. Guerrini & N. W. Paton (Eds.), Proceedings of The 16th International Conference on Extending Database Technology: EDBT 2013 (pp. 137-142 ). Association for Computing Machinery. https://doi.org/10.1145/2452376.2452393

Radaelli, L. & Jensen, C. S. (2013). Towards Fully Organic Indoor Positioning. In Proceedings of the Fifth ACM SIGSPATIAL International Workshop on Indoor Spatial Awareness (pp. 16-20). Association for Computing Machinery.

Picozzi, M., Verdezoto, N., Pouke, M., Vatjus-Anttila, J. & Quigley, A. (2013). Traffic Visualization: Applying Information Visualization Techniques to Enhance Traffic Planning. In GRAPP 2013 IVAPP 2013 : Proceedings of the 8thInternational Conference on Computer Graphics Theory and Applications (pp. 554-557). SCITEPRESS Digital Library. https://doi.org/10.5220/0004291605540557

Li, X., Ceikute, V., Jensen, C. S. & Tan, K.-L. (2013). Trajectory Based Optimal Segment Computation in Road Network Databases. (1303.2310v1 ed.) arxiv.org. http://arxiv.org/abs/1303.2310

Li, X., Ceikute, V., Jensen, C. S. & Tan, K.-L. (2013). Trajectory Based Optimal Segment Computation in Road Network Databases. In C. Knoblock & M. Schneider (Eds.), Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, SIGSPATIAL'13 (pp. 396-399 ). Association for Computing Machinery. https://doi.org/10.1145/2525314.2525444

Jensen, K., Aalst, W. M. V. D., Balbo, G., Koutny, M. & Wolf, K. (Eds.) (2013). Transactions on Petri Nets and Other Models of Concurrency VII: ToPNoC. Springer VS. Lecture Notes in Computer Science Vol. 7480 https://doi.org/10.1007/978-3-642-38143-0

Yang, B., Guo, C. & Jensen, C. S. (2013). Travel cost inference from sparse, spatio-temporally correlated time series using markov models. Proceedings of the VLDB Endowment, 6(9), 769-780. http://dl.acm.org/citation.cfm?id=2536360.2536375&coll=DL&dl=ACM&CFID=383343957&CFTOKEN=67321284

Scheder, D. (2013). Trivial, tractable, hard. A not so sudden complexity jump in neighborhood restricted CNF formulas. In L. Cai, S.-W. Cheng & A.-W. Lam (Eds.), Algorithms and Computation: 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings (pp. 251-261). Springer VS. https://doi.org/10.1007/978-3-642-45030-3_24

Filos-Ratsika, A. & Miltersen, P. B. (2013). Truthful approximations to range voting. (1307.1766v1 ed.) arxiv.org. http://arxiv.org/pdf/1307.1766v1.pdf

Damgård, I. B. & Scafuro, A. (2013). Unconditionally Secure and Universally Composable Commitments from Physical Assumptions. In K. Sako & P. Sarkar (Eds.), Advances in Cryptology - ASIACRYPT 2013: 19th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India, December 1-5, 2013, Proceedings, Part II (pp. 100-119 ). Springer VS. https://doi.org/10.1007/978-3-642-42045-0_6

Meldgaard, S. T. (2013). Unconditionally Secure Protocols. Institut for Datalogi, Aarhus Universitet.

Grönvall, E. & Verdezoto, N. (2013). Understanding Challenges and Opportunities of Preventive Blood Pressure Self-Monitoring at Home. In P. Palanque , F. Détienne & A. Tricot (Eds.), Proceedings of the 31st European Conference on Cognitive Ergonomics (ACM ECCE 2013) Association for Computing Machinery. https://doi.org/10.1145/2501907.2501962

Turon, A., Dreyer , D. & Birkedal, L. (2013). Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency. In G. Morrisett & T. Uustalu (Eds.), Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming, ICFP '13 (pp. 377-390 ). Association for Computing Machinery. https://doi.org/10.1145/2500365.2500600

Dahl, M. & Damgård, I. B. (2013). Universally Composable Symbolic Analysis for Two-Party Protocols based on Homomorphic Encryption. Cryptology ePrint Archive. http://eprint.iacr.org/2013/296.pdf

Scheder, D. (2013). Unsatisfiable CNF formulas contain many conflicts. In L. Cai, S.-W. Cheng & T.-W. Lam (Eds.), Algorithms and Computation: 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings (pp. 273-283). Springer VS. https://doi.org/10.1007/978-3-642-45030-3_26

Ceikute, V. & Jensen, C. S. (2013). Vehicle Routing With User Generated Trajectory Data. http://www.sciencegate.ch/. http://nelanth.cvt.dk/cgi-bin/das-oai/ddf

Klokmose, C. N. (2013). Visual Attributes for Face Images: A review of Describable Visual Attributes for Face Images, by Neraaj Kumar. Dissertation Reviews, (10. January). http://dissertationreviews.org/archives/2053

Brewster, S. & Bødker, S. (2013). Welcome to CHI 2013! Conference on Human Factors in Computing Systems - Proceedings, 2013-April, vii.

Eagan, J. R., Lecolinet, E. & Klokmose, C. N. (2013). What are Applications in Multi-Surface Environments. Paper presented at POWERWALL, Paris, France. http://www.powerwall.mdx.ac.uk/papers/POWERWALL-Eagan.pdf

Gao, X. A. G., Zhang, J. & Chen, Y. (2013). What you jointly know determines how you act: Strategic interactions in prediction markets. In Proceedings of of the fourteenth ACM Conference on Electronic Commerce, EC '13 (pp. 489-506). Association for Computing Machinery. https://doi.org/10.1145/2482540.2482592

Pastro, V. (2013). Zero-Knowledge Protocols and Multiparty Computation. Department of Computer Science, Aarhus University.

Jawurek, M., Kerschbaum, F. & Orlandi, C. (2013). Zero-knowledge using garbled circuits: Or how to prove non-algebraic statements efficiently. In A.-R. Sadeghi , V. Gligor & M. Yung (Eds.), Proceedings of the ACM Conference on Computer and Communications Security, CCS '13 (pp. 955-966). Association for Computing Machinery. https://doi.org/10.1145/2508859.2516662

Sand, A., Kristiansen, M., Pedersen, C. N. S. & Mailund, T. (2013). zipHMMlib: a highly optimised HMM library exploiting repetitions in the input to speed up the forward algorithm. BMC Bioinformatics , 14(339), 339-348. https://doi.org/10.1186/1471-2105-14-339

Bernstein, P. A., Jensen, C. S. & Tan, K.-L. (2012). A call for surveys. SIGMOD Record, 41(2), 47-47. http://www.sigmod.org/publications/sigmod-record/1206/pdfs/07.announce.vldbj.pdf

Urazimbetova, S. (2012). A Case Study - On Patient Empowerment and Integration of Telemedicine to National Healthcare Services. Paper presented at International Conference on Health Informatics, Vilamoura, Algarve, Portugal. https://doi.org/10.5220/0003870902630269

Toftkjær, T. (2012). Accurate positioning of pedestrains in mixed indoor/outdoor settings : A particle filter approach to sensor and map fusion. Department of Computer Science, Aarhus University.

Šidlauskas, D., Jensen, C. S. & Šaltenis , S. (2012). A comparison of the use of virtual versus physical snapshots for supporting update-intensive workloads. In Proceedings of the Eighth International Workshop on Data Management on New Hardware: DaMoN '12 (pp. 1-8). Association for Computing Machinery. https://doi.org/10.1145/2236584.2236585

Sergey, I. & Clark, D. (2012). A correspondence between type checking via reduction and type checking via evaluation. Information Processing Letters, 112(1-2), 13-20. https://doi.org/10.1016/j.ipl.2011.10.008

Dupuis, F., Nielsen, J. B. & Salvail, L. (2012). Actively Secure Two-Party Evaluation of Any Quantum Operation. Lecture Notes in Computer Science, 7417, 794-811. https://doi.org/10.1007/978-3-642-32009-5_46

Backes, M., Goldberg, I., Kate, A. & Toft, T. (2012). Adding query privacy to robust DHTs. In ASIACCS '12 Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security (pp. 30-31 ). Association for Computing Machinery. https://doi.org/10.1145/2414456.2414473

Bitsch, J. E. & Bouvin, N. O. (2012). Ad-hoc Symbiotic Interactive Displays through DLNA. In IEEE International Conference on Pervasive Computing and Communications (PerCom), 2012 (pp. 57-65). IEEE Computer Society Press. https://doi.org/10.1109/PerCom.2012.6199849

Alrøe, T. F., Grann, J., Grönvall, E., Petersen, M. G. & L. Rasmussen, J. (2012). Aerial Tunes : Exploring Interaction Qualities of Mid-air Displays. In Proceedings of the 7th Nordic Conference on Human-Computer Interaction: Making sense through design (NordiCHI 2012), (pp. 514-523). Association for Computing Machinery. https://doi.org/10.1145/2399016.2399095

Hansen, T. D., Ibsen-Jensen, R. & Miltersen, P. B. (2012). A Faster Algorithm for Solving One-Clock Priced Timed Games. http://arxiv.org/abs/1201.3498

Lu, H., Cao, X. & Jensen, C. S. (2012). A Foundation for Efficient Indoor Distance-Aware Query Processing. In IEEE 28th International Conference on Data Engineering (ICDE) (pp. 438 -449). IEEE Press. https://doi.org/10.1109/ICDE.2012.44

Wu, D., Cong, G. & Jensen, C. S. (2012). A framework for efficient spatial web object retrieval. V L D B Journal, 21(6), 797-822 . https://doi.org/10.1007/s00778-012-0271-0

Bohøj, M., Bouvin, N. O. & Gammelmark, H. (2012). A Framework for Interactively Helpful Web Forms. Journal of Web Engineering, 11(1), 1-22. http://www.rintonpress.com/journals/jweonline.html#v11n1

Dang, X.-H., Ong, K.-L. & Lee, V. (2012). An Adaptive Algorithm for Finding Frequent Sets in Landmark Windows. Lecture Notes in Computer Science, 7520, 590-597 . https://doi.org/10.1007/978-3-642-33362-0_47

Nielsen, J. B., Nordholt, P. S., Orlandi, C. & Burra, S. S. (2012). A New Approach to Practical Active-Secure Two-Party Computation. Lecture Notes in Computer Science, 7417, 681-700 . https://doi.org/10.1007/978-3-642-32009-5_40

Mailund, T., Halager, A. E., Westergaard, M., Dutheil, J. Y., Munch, K., Andersen, L. N., Lunter, G., Prüfer, K., Scally, A., Hobolth, A. & Schierup, M. H. (2012). A New Isolation with Migration Model along Complete Genomes Infers Very Different Divergence Processes among Closely Related Great Ape Species. P L o S Genetics, 8(12), e1003125. https://doi.org/10.1371/journal.pgen.1003125

Kranen, P., Assent, I. & Seidl, T. (2012). An Index-Inspired Algorithm for Anytime Classification on Evolving Data Streams. Datenbank-Spektrum, 12(1), 43-50 . https://doi.org/10.1007/s13222-012-0083-9

Agarwal, P. K., Arge, L., Kaplan, H., Molad, E., Tarjan, R. E. & Yi, K. (2012). An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries. S I A M Journal on Computing, 41(1), 104–127. https://doi.org/10.1137/10078791X

Assent, I., Kranen, P., Baldauf, C. & Seidl, T. (2012). AnyOut : Anytime Outlier Detection Approach for High-dimensional Data. Lecture Notes in Computer Science, 7238, 228-242. https://doi.org/10.1007/978-3-642-29038-1_18

Magnani, M., Assent, I. & Mortensen, M. L. (2012). Anytime skyline query processing for interactive systems. Paper presented at International Workshop on Ranking in Databases, Istanbul, Turkey. http://chenwsdb.fulton.ad.asu.edu/DBRank2012/

Sitchinava, N. & Zeh, N. (2012). A parallel buffer tree. In Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA (pp. 214-223). Association for Computing Machinery. https://doi.org/10.1145/2312005.2312046

Hachisuka, T., Pantaleoni, J. & Jensen, H. W. (2012). A Path Space Extension for Robust Light Transport Simulation. A C M Transactions on Graphics, 31(6), Article 191. https://doi.org/10.1145/2366145.2366210

Cao, X., Cong, G., Cui, B., Jensen, C. S. & Yuan, Q. (2012). Approaches to Exploring Category Information for Question Retrieval in Community Question-Answer Archives. A C M Transactions on Information Systems, 30(2), Article No. 7 . https://doi.org/10.1145/2180868.2180869

Eickmeyer, K., Hansen, K. A. & Verbin, E. (2012). Approximating the minmax value of 3-player games within a constant is as hard as detecting planted cliques. Electronic Colloquium on Computational Complexity, (TR12-25). http://eccc.hpi-web.de/report/2012/025/

Eickmeyer, K., Hansen, K. A. & Verbin, E. (2012). Approximating the minmax value of Three-player games within a constant is as hard as detecting planted cliques. Lecture Notes in Computer Science, 7615, 96-107. https://doi.org/10.1007/978-3-642-33996-7_9

Displaying results 2501 to 2550 out of 5737

Revised 17.04.2023

Marianne Dammand Iversen

Publications

Search for publications at Department of Computer Science

Search for publications at Aarhus University