Sciweavers

4218 search results - page 45 / 844
» Complete sets of cooperations
Sort
View
DMIN
2006
138views Data Mining» more  DMIN 2006»
13 years 9 months ago
Mining Complete Hybrid Sequential Patterns
We discovered that the set of frequent hybrid sequential patterns obtained by previous researches is incomplete, due to the inapplicability of the Apriori principle. We design and ...
Chichang Jou
GVD
2004
142views Database» more  GVD 2004»
13 years 9 months ago
Semantic Errors in SQL Queries: A Quite Complete List
We investigate classes of SQL queries which are syntactically correct, but certainly not intended, no matter for which task the query was written. For instance, queries that are c...
Christian Goldberg, Stefan Brass
IJCAI
1997
13 years 9 months ago
Towards a Complete Classification of Tractability in Allen's Algebra
We characterise the set of subalgebras of Allen's algebra which have a tractable satisfiability problem, and in addition contain certain basic relations. The conclusion is th...
Thomas Drakengren, Peter Jonsson
DAM
2008
109views more  DAM 2008»
13 years 7 months ago
Minimal comparability completions of arbitrary graphs
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of th...
Pinar Heggernes, Federico Mancini, Charis Papadopo...
COMBINATORICS
2006
133views more  COMBINATORICS 2006»
13 years 7 months ago
Completion of the Wilf-Classification of 3-5 Pairs Using Generating Trees
A permutation is said to avoid the permutation if no subsequence in has the same order relations as . Two sets of permutations 1 and 2 are Wilfequivalent if, for all n, the numb...
Mark Lipson