# Polynomial delay

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- IEEE 28th International Conference on Dataâ€¦
- 2012

A system for efficient keyword search in graphs is demonstrated. The system has two components, a search through only the nodesâ€¦Â (More)

Is this relevant?

2009

2009

- Journal of Machine Learning Research
- 2009

Algorithms that list graphs such that no two listed graphs are isomorphic, are important building blocks of systems for miningâ€¦Â (More)

Is this relevant?

2009

2009

- PAKDD
- 2009

In this paper, we study the problem of mining frequent diamond episodes efficiently from an input event sequence with sliding aâ€¦Â (More)

Is this relevant?

2008

2008

- PAKDD
- 2008

Mining frequently appearing patterns in a database is a basic problem in recent informatics, especially in data miningâ€¦Â (More)

Is this relevant?

2007

2007

- MLG
- 2007

Of many graph mining algorithms an essential component is its procedure for enumerating graphs such that no two enumerated graphsâ€¦Â (More)

Is this relevant?

2007

2007

- J. Comb. Optim.
- 2007

In this paper, we consider the problem of enumerating all maximal motifs in an input string for the class of repeated motifs withâ€¦Â (More)

Is this relevant?

2007

2007

- Discovery Science
- 2007

Mining frequently appearing patterns in a database is a basic problem in informatics, especially in data mining. Particularlyâ€¦Â (More)

Is this relevant?

2006

2006

- VLDB
- 2006

Full disjunctions are an associative extension of the outer-join operator to an arbitrary number of relations. Their mainâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- J. Artif. Intell. Res.
- 2001

Description Logics (DLs) are suitable, well-known, logics for managing structured knowledge. They allow reasoning aboutâ€¦Â (More)

Is this relevant?

1993

1993

- STOC
- 1993

The main result of this paper is a method that turns any almost sure sentence in the first order language of graphs into aâ€¦Â (More)

Is this relevant?