5221 search results - page 256 / 1045 » An On-line Problem Database |
172
click to vote
PODS
2003
ACM
16 years 6 months ago
2003
ACM
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
145
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
In this paper we consider the on-line max and min query auditing problem: given a private association between fields in a data set, a sequence of max and min queries that have alr...
179
click to vote
SIGMOD
2004
ACM
16 years 1 days ago
2004
ACM
Clustering is one of the most important analysis tasks in spatial databases. We study the problem of clustering objects, which lie on edges of a large weighted spatial network. Th...
191
click to vote
ER
2004
Springer
16 years 1 hour ago
2004
Springer
Abstract. Relationships are an essential part of the design of a database because they capture associations between things. Comparing and integrating relationships from heterogeneo...
203
click to vote
SSD
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we formalize the novel concept of incremental reverse nearest neighbor ranking and suggest an original solution for this problem. We propose an efficient approach f...