Collections in this community

Recent Submissions

  • Existence of solutions for a class of semilinear polyharmonic equations with critical exponential growth 

    Lakkis O (1999)
    The author considers the semilinear elliptic equation (−∆)mu = g(x, u), subject to Dirichlet boundary conditions u = Du = ··· = D^{m−1}u = 0, on a bounded domain Ω ⊂ R^{2m}. The notion of nonlinearity of critical growth ...
  • Early-stage software startups: Main challenges and possible answers 

    Melegati J; Kon F (Springer, 2020)
    Software startups have a low probability of success. In their early-stage days, they face several challenges from different types that make it even harder to progress to the following stages. Some papers in the scientific ...
  • Mapping research in assisted reproduction worldwide 

    García D; Massucci FA; Mosca A; Ràfols I; Rodríguez A; Vassena R (2020)
    Research question: What are the current research trends in human assisted reproduction around the world? Design: An analysis of 26,000+ scientific publications (articles, letters and reviews) produced worldwide between ...
  • Secure E-government web services 

    Mitrakas A; Hengeveld P; Polemi D; Gamper J (Idea Group Publishing, 2007)
    As e-government applications are coming of age, security has been gradually becoming more demanding a requirement for users, administrators, and service providers. The increasingly widespread use of Web services facilitates ...
  • Similarity of chemotherapy histories based on imputed values 

    Khayati M; Anderson JM; Böhlen MH; Gamper J; Mitterer M (2012)
    The comparison of time series of multivariate data is a long-standing problem in many applications in the clinical domain. We propose two approaches to retrieve from a hospital data warehouse the k patients P1, ⋯, Pn with ...
  • Sequenced event set pattern matching 

    Cadonna B; Gamper J; Böhlen MH (ACM, 2011)
    Event pattern matching is a query technique where a sequence of input events is matched against a complex pattern that specifies constraints on extent, order, values, and quantification of matching events. The increasing ...
  • Theta-constrained multi-dimensional aggregation 

    Akinde M; Böhlen MH; Chatziantoniou D; Gamper J (2011)
    The SQL:2003 standard introduced window functions to enhance the analytical processing capabilities of SQL. The key concept of window functions is to sort the input relation and to compute the aggregate results during a ...
  • Windowed pq-grams for approximate joins of data-centric XML 

    Augsten N; Böhlen MH; Dyreson C; Gamper J (2012)
    In data integration applications, a join matches elements that are common to two data sources. Since elements are represented slightly different in each source, an approximate join must be used to do the matching. For XML ...
  • MOUNA: Mining opinions to unveil neglected arguments 

    Kacimi El Hassani M; Gamper J (ACM, 2012)
    A query topic can be subjective involving a variety of opinions, judgments, arguments, and many other debatable aspects. Typically, search engines process queries independently from the nature of their topics using a ...
  • Workshop for doctoral students in Fuzzy-Based Systems 

    Gamper J; Moser B (Springer, 1993)
    This one-day-workshop held in conjunction with the FLAI’93 conference is intended to enhance the personal and professional development of Ph.D.-level students who are working in the field of fuzzy-based systems. It will ...
  • Prototype of web-based OSTAR application for itinerary planning in tourism (http://ostar.unibz.it/) 

    Bolzoni P; Gamper J; Helmer S; Mitterer H; Wellenzohn K (2014)
  • Finding k-dissimilar paths with minimum collective length 

    Chondrogiannis T; Bouros P; Gamper J; Leser U; Blumenthal DB (ACM, 2018)
    Shortest path computation is a fundamental problem in road networks. However, in many real-world scenarios, determining solely the shortest path is not enough. In this paper, we study the problem of finding k-Dissimilar ...
  • Period Index: A Learned 2D Hash Index for Range and Duration Queries 

    Behrend A; Dignös A; Gamper J; Schmiegelt P; Voigt H; Rottmann M; Kahl K (ACM, 2019)
    Today, most commercial database systems provide some support for the management of temporal data, but the index support for efficiently accessing such data is rather limited. Existing access paths neglect the fact that ...
  • Individualized Hiking Time Estimation 

    Pitman A; Zanker M; Gamper J; Andritsos P (IEEE, 2012)
    Route planning algorithms attempt to find the optimum path between two nodes in a graph, where a cost function specifies a weight for each edge. In many situations cost is related to distance or time. While time estimates ...
  • Query Time Scaling of Attribute Values in Interval Timestamped Databases 

    Dignös A; Böhlen M; Gamper J (IEEE, 2013)
    In valid-time databases with interval timestamping each tuple is associated with a time interval over which the recorded fact is true in the modeled reality. The adjustment of these intervals is an essential part of ...
  • HotPeriods: Visual Correlation Analysis of Interval Data 

    Duran N; Mahlknecht G; Dignös A; Gamper J (ACM, 2019)
    With the ever increasing amount and complexity of data, visual correlation analysis is a fundamental tool to find correlations and relationships in the data. Most of the previous techniques (e.g., scatter plots or heat ...
  • Scalable computation of isochrones with network expiration 

    Gamper J; Böhlen MH; Innerebner M (Springer, 2012)
    An isochrone in a spatial network is the possibly disconnected set of all locations from where a query point is reachable within a given time span and by a given arrival time. In this paper we propose an efficient and ...
  • Efficient event pattern matching with match windows 

    Cadonna B; Gamper J; Böhlen MH (ACM, 2012)
    In event pattern matching a sequence of input events is matched against a complex query pattern that specifies constraints on extent, order, values, and quantification of matching events. In this paper we propose a general ...
  • Defining isochrones in multimodal spatial networks 

    Gamper J; Böhlen MH; Cometti W; Innerebner M (ACM, 2011)
    An isochrone in a spatial network is the minimal, possibly disconnected subgraph that covers all locations from where a query point is reachable within a given time span and by a given arrival time. In this paper we formally ...
  • Developing Mashup Tools for End-Users: On the Importance of the Application Domain 

    Daniel F; Imran M; Soi S; De Angeli A; Wilkinson CR; Casati F; Marchese M (2012)
    The recent emergence of mashup tools has refueled research on end-user development, i.e., on enabling end-users without programming skills to compose their own applications. Yet, similar to what happened with analogous ...

View more