2635 search results - page 39 / 527 » Algorithms for the Database Layout Problem |
150
Voted
INFOCOM
2012
IEEE
13 years 4 months ago
2012
IEEE
Abstract—Although femtocell deployments in residential buildings have been increasingly prevalent, femtocell deployment in commercial building environments remains in its infancy...
117
click to vote
KDD
1995
ACM
15 years 6 months ago
1995
ACM
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...
130
click to vote
SIGMOD
2000
ACM
15 years 6 months ago
2000
ACM
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...
138
click to vote
KDD
2008
ACM
16 years 2 months ago
2008
ACM
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
134
click to vote
FPL
2008
Springer
15 years 4 months ago
2008
Springer
Association Rules Mining (ARM) algorithms are designed to find sets of frequently occurring items in large databases. ARM applications have found their way into a variety of field...