Sciweavers

5149 search results - page 1003 / 1030
» Timed Asynchronous Distributed Systems
Sort
View
PPOPP
2009
ACM
14 years 8 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
SPAA
2009
ACM
14 years 8 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
HPCA
2009
IEEE
14 years 8 months ago
A first-order fine-grained multithreaded throughput model
Analytical modeling is an alternative to detailed performance simulation with the potential to shorten the development cycle and provide additional insights. This paper proposes a...
Xi E. Chen, Tor M. Aamodt
MOBISYS
2009
ACM
14 years 8 months ago
Leveraging smart phones to reduce mobility footprints
Mobility footprint refers to the size, weight, and energy demand of the hardware that must be carried by a mobile user to be effective at any time and place. The ideal of a zero m...
Stephen Smaldone, Benjamin Gilbert, Nilton Bila, L...
KDD
2004
ACM
209views Data Mining» more  KDD 2004»
14 years 8 months ago
Tracking dynamics of topic trends using a finite mixture model
In a wide range of business areas dealing with text data streams, including CRM, knowledge management, and Web monitoring services, it is an important issue to discover topic tren...
Satoshi Morinaga, Kenji Yamanishi
« Prev « First page 1003 / 1030 Last » Next »