Sciweavers

5221 search results - page 54 / 1045
» An On-line Problem Database
Sort
View
CI
1998
78views more  CI 1998»
13 years 8 months ago
Pattern Databases
A pattern database is a lookup table that stores an exact evaluation function for a relaxed search problem, which provides an admissible heuristic for the original search problem....
Joseph C. Culberson, Jonathan Schaeffer
CIIA
2009
13 years 10 months ago
Appling A Discrete Particle Swarm Optimization Algorithm to Database Vertical Partition
Vertical partition is an important technique in database design used to enhance performance in database systems. Vertical fragmentation is a combinatorial optimization problem that...
Bilal Benmessahel, Mohamed Touahria
KDD
1995
ACM
216views Data Mining» more  KDD 1995»
14 years 18 days ago
Robust Decision Trees: Removing Outliers from Databases
Finding and removingoutliers is an important problem in data mining. Errors in large databases can be extremely common,so an important property of a data mining algorithm is robus...
George H. John
SIGMOD
2000
ACM
143views Database» more  SIGMOD 2000»
14 years 1 months ago
Closest Pair Queries in Spatial Databases
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
ACTA
2007
85views more  ACTA 2007»
13 years 9 months ago
The complexity of satisfying constraints on databases of transactions
Abstract Computing frequent itemsets is one of the most prominent problems in data mining. Recently, a new related problem, called FREQSAT, was introduced and studied: given some i...
Toon Calders