5962 search results - page 269 / 1193 » Efficient Clustering for Orders |
185
click to vote
IDEAS
1999
IEEE
15 years 11 months ago
1999
IEEE
Data-warehousing applications cope with enormous data sets in the range of Gigabytes and Terabytes. Queries usually either select a very small set of this data or perform aggregat...
162
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
We study the problem of clustering discrete probability distributions with respect to the Kullback-Leibler (KL) divergence. This problem arises naturally in many applications. Our...
208
click to vote
IJCAI
2001
15 years 8 months ago
2001
Supervised and unsupervised learning methods have traditionally focused on data consisting of independent instances of a single type. However, many real-world domains are best des...
175
click to vote
CASCON
1992
15 years 8 months ago
1992
Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maint...
161
click to vote
CCGRID
2010
IEEE
15 years 7 months ago
2010
IEEE
Applications structured as parallel task graphs exhibit both data and task parallelism, and arise in many domains. Scheduling these applications on parallel platforms has been a lo...