458 search results - page 84 / 92 » Linear Time Algorithms for Clustering Problems in Any Dimens... |
EDBT
2009
ACM
13 years 10 months ago
2009
ACM
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
ADBIS
2003
Springer
13 years 12 months ago
2003
Springer
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
RT
1999
Springer
13 years 11 months ago
1999
Springer
A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially usef...
CPM
1995
Springer
13 years 10 months ago
1995
Springer
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...
APIN
2008
13 years 6 months ago
2008
Abstract-Mining generalized association rules between items in the presence of taxonomy has been recognized as an important model in data mining. Earlier work on mining generalized...