Sciweavers

3172 search results - page 57 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
GVD
2004
142views Database» more  GVD 2004»
15 years 7 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
15 years 7 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»
15 years 6 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»
15 years 6 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
ICDM
2008
IEEE
96views Data Mining» more  ICDM 2008»
16 years 18 days ago
Filling in the Blanks - Krimp Minimisation for Missing Data
Many data sets are incomplete. For correct analysis of such data, one can either use algorithms that are designed to handle missing data or use imputation. Imputation has the bene...
Jilles Vreeken, Arno Siebes