90 search results - page 6 / 18 » Symmetry Partition Sort |
SWAT
1992
Springer
15 years 4 months ago
1992
Springer
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
100
Voted
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
Most clustering algorithms operate by optimizing (either implicitly or explicitly) a single measure of cluster solution quality. Such methods may perform well on some data sets bu...
81
Voted
ICDE
2010
IEEE
15 years 7 months ago
2010
IEEE
— Massive data analysis on large clusters presents new opportunities and challenges for query optimization. Data partitioning is crucial to performance in this environment. Howev...
99
Voted
IDEAS
2000
IEEE
15 years 4 months ago
2000
IEEE
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
63
Voted
JGT
2006
15 years 12 days ago
2006
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...