Database Paper Browser

Back to papers

Testing Complex Temporal Relationships Involving Multiple Granularities and Its Application to Data Mining

Summary: Defines event-structure temporal-constraint graphs with multiple granularities (TCGs), proves TCG consistency NP-hard and provides an approximation algorithm. Introduces timed automata with granularities (TAGs) to detect TCG instantiations in sequences for temporal-pattern mining. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1078
Venue
PODS
Year
1996
Pagerank
-
Overall Rank
14,013 | 2.52%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers