Sciweavers

20126 search results - page 3850 / 4026
» Timed Transition Systems
Sort
View
SPAA
2009
ACM
16 years 3 months ago
Scalable reader-writer locks
We present three new reader-writer lock algorithms that scale under high read-only contention. Many previous reader-writer locks suffer significant degradation when many readers a...
Yossi Lev, Victor Luchangco, Marek Olszewski
106
Voted
SPAA
2009
ACM
16 years 3 months ago
Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures
Work stealing is a popular method of scheduling fine-grained parallel tasks. The performance of work stealing has been extensively studied, both theoretically and empirically, but...
Daniel Spoonhower, Guy E. Blelloch, Phillip B. Gib...
KDD
2009
ACM
152views Data Mining» more  KDD 2009»
16 years 3 months ago
TANGENT: a novel, 'Surprise me', recommendation algorithm
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...
Kensuke Onuma, Hanghang Tong, Christos Faloutsos
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
16 years 3 months ago
Efficient methods for topic model inference on streaming document collections
Topic models provide a powerful tool for analyzing large text collections by representing high dimensional data in a low dimensional subspace. Fitting a topic model given a set of...
Limin Yao, David M. Mimno, Andrew McCallum
145
Voted
KDD
2009
ACM
269views Data Mining» more  KDD 2009»
16 years 3 months ago
Extracting discriminative concepts for domain adaptation in text mining
One common predictive modeling challenge occurs in text mining problems is that the training data and the operational (testing) data are drawn from different underlying distributi...
Bo Chen, Wai Lam, Ivor Tsang, Tak-Lam Wong
« Prev « First page 3850 / 4026 Last » Next »