6800 search results - page 888 / 1360 » On optimizing collective communication |
172
click to vote
ICML
2005
IEEE
16 years 8 months ago
2005
IEEE
We present a novel unsupervised learning scheme that simultaneously clusters variables of several types (e.g., documents, words and authors) based on pairwise interactions between...
183
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
205
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
226
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Multinomial distributions over words are frequently used to model topics in text collections. A common, major challenge in applying all such topic models to any text mining proble...
185
click to vote
CHI
2008
ACM
16 years 7 months ago
2008
ACM
Because most animation tools are complex and timeconsuming to learn and use, most animations today are created by experts. To help novices create a wide range of animations quickl...