5962 search results - page 337 / 1193 » Efficient Clustering for Orders |
155
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
In the On Line Analytical Processing (OLAP) context, exploration of huge and sparse data cubes is a tedious task which does not always lead to efficient results. In this paper, we...
197
click to vote
SIGMOD
2004
ACM
16 years 7 months ago
2004
ACM
In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coe...
125
click to vote
ICMCS
2005
IEEE
16 years 13 days ago
2005
IEEE
In this paper, we present an efficient 3D shape rejection algorithm for unlabeled 3D markers. The problem is important in domains such as rehabilitation and the performing arts. T...
168
click to vote
PATMOS
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. The load-store queue (LQ-SQ) of modern superscalar processors is responsible for keeping the order of memory operations. As the performance gap between processing speed a...
189
click to vote
RSP
1998
IEEE
15 years 11 months ago
1998
IEEE
This paper presents an algorithm for the automatic mapping of problem specifications to existing architecture templates. The proposed methodology supports the combination of exist...