English
Related papers

Related papers: Query Results over Ongoing Databases that Remain V…

200 papers

Utility mining emerged to overcome the limitations of frequent itemset mining by considering the utility of an item. Utility of an item is based on user's interest or preference. Recently, temporal data mining has become a core technical…

Databases · Computer Science 2015-07-08 Anjali N. Radkar , S. S. Pawar

A new class of critical points, termed as perpetual points, where acceleration becomes zero but the velocity remains non-zero, are observed in dynamical systems. The velocity at these points is either maximum or minimum or of inflection…

Chaotic Dynamics · Physics 2015-06-22 Awadhesh Prasad

Continual learning is the problem of learning and retaining knowledge through time over multiple tasks and environments. Research has primarily focused on the incremental classification setting, where new tasks/classes are added at discrete…

Machine Learning · Computer Science 2021-09-23 Zhipeng Cai , Ozan Sener , Vladlen Koltun

Continual learning, the setting where a learning agent is faced with a never ending stream of data, continues to be a great challenge for modern machine learning systems. In particular the online or "single-pass through the data" setting…

Machine Learning · Computer Science 2019-10-31 Rahaf Aljundi , Lucas Caccia , Eugene Belilovsky , Massimo Caccia , Min Lin , Laurent Charlin , Tinne Tuytelaars

Fungible tokens with time-to-live (TTL) semantics require tracking individual expiration times for each deposited unit. A naive implementation creates a new balance record per deposit, leading to unbounded storage growth and vulnerability…

Data Structures and Algorithms · Computer Science 2025-12-25 Shaun Scovil , Bhargav Chickmagalur Nanjundappa

Query execution over the Web of Linked Data has attracted much attention recently. A particularly interesting approach is link traversal based query execution which proposes to integrate the traversal of data links into the construction of…

Databases · Computer Science 2012-04-23 Olaf Hartig , Johann-Christoph Freytag

Verification of temporal logic properties plays a crucial role in proving the desired behaviors of continuous systems. In this paper, we propose an interval method that verifies the properties described by a bounded signal temporal logic.…

Logic in Computer Science · Computer Science 2016-02-09 Daisuke Ishii , Naoki Yonezaki , Alexandre Goldsztejn

Modern recommender systems operate in uniquely dynamic settings: user interests, item pools, and popularity trends shift continuously, and models must adapt in real time without forgetting past preferences. While existing tutorials on…

Information Retrieval · Computer Science 2025-07-08 Hyunsik Yoo , SeongKu Kang , Hanghang Tong

Neural marked temporal point processes have been a valuable addition to the existing toolbox of statistical parametric models for continuous-time event data. These models are useful for sequences where each event is associated with a single…

Machine Learning · Computer Science 2024-03-20 Yuxin Chang , Alex Boyd , Padhraic Smyth

We present a different approach to developing a concept of time for specifying temporality in the conceptual modeling of software and database systems. In the database field, various proposals and products address temporal data. The…

Software Engineering · Computer Science 2021-02-02 Sabah Al-Fedaghi

Anytime-valid tests allow evidence to be checked during data collection: one can either continue testing or stop and reject the null while still controlling type-I error. Yet, in many applications rejection is useful only if it comes soon…

Statistics Theory · Mathematics 2026-05-08 Eugenio Clerico , Tobias Wegel , Iskander Azangulov , Patrick Rebeschini

The relational data model requires a theory of relations in which tuples are not only many-sorted, but can also have indexes that are not necessarily numerical. In this paper we develop such a theory and define operations on relations that…

Databases · Computer Science 2012-02-08 Philip Kelly , M. H. van Emden

Ontology-based query answering (OBQA) augments classical query answering in databases by domain knowledge encoded in an ontology. Systems for OBQA use the ontological knowledge to infer new information that is not explicitly given in the…

Logic in Computer Science · Computer Science 2020-03-24 Stefan Borgwardt , Veronika Thost

Internet search engines function in a present which changes continuously. The search engines update their indices regularly, overwriting Web pages with newer ones, adding new pages to the index, and losing older ones. Some search engines…

Information Retrieval · Computer Science 2009-11-19 Iina Hellsten , Loet Leydesdorff , Paul Wouters

Continuous-time event sequences play a vital role in real-world domains such as healthcare, finance, online shopping, social networks, and so on. To model such data, temporal point processes (TPPs) have emerged as the most natural and…

Users issue queries to Search Engines, and try to find the desired information in the results produced. They repeat this process if their information need is not met at the first place. It is crucial to identify the important words in a…

Information Retrieval · Computer Science 2020-01-06 Kishaloy Halder , Heng-Tze Cheng , Ellie Ka In Chio , Georgios Roumpos , Tao Wu , Ritesh Agarwal

Conventional time is modelled as the one dimensional continuum R^1 of real numbers. This continuity, however, does {\em not} stem from {\em any} fundamental principle. On the other hand, natural time is {\em not} continuous and its values…

Other Condensed Matter · Physics 2007-05-23 P. A. Varotsos

Modern applications often manage time-varying data. Despite decades of research on temporal databases, which culminated in the addition of temporal data operations into the SQL:2011 standard, temporal data query and manipulation operations…

Programming Languages · Computer Science 2022-10-24 Simon Fowler , Vashti Galpin , James Cheney

Object queries are essential in information seeking and decision making in vast areas of applications. However, a query may involve complex conditions on objects and sets, which can be arbitrarily nested and aliased. The objects and sets…

Programming Languages · Computer Science 2020-12-25 Yanhong A. Liu , Jon Brandvein , Scott D. Stoller , Bo Lin

In today's databases, previous query answers rarely benefit answering future queries. For the first time, to the best of our knowledge, we change this paradigm in an approximate query processing (AQP) context. We make the following…

Databases · Computer Science 2017-03-30 Yongjoo Park , Ahmad Shahab Tajik , Michael Cafarella , Barzan Mozafari
‹ Prev 1 3 4 5 6 7 10 Next ›