Sciweavers

406 search results - page 68 / 82
» Fast Increment Registers
Sort
View
AAAI
2008
14 years 11 months ago
From Comparing Clusterings to Combining Clusterings
This paper presents a fast simulated annealing framework for combining multiple clusterings (i.e. clustering ensemble) based on some measures of agreement between partitions, whic...
Zhiwu Lu, Yuxin Peng, Jianguo Xiao
DAMON
2008
Springer
14 years 11 months ago
Modeling the performance of algorithms on flash memory devices
NAND flash memory is fast becoming popular as a component of large scale storage devices. For workloads requiring many random I/Os, flash devices can provide two orders of magnitu...
Kenneth A. Ross
AAAI
2006
14 years 11 months ago
Anytime Induction of Decision Trees: An Iterative Improvement Approach
Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decisi...
Saher Esmeir, Shaul Markovitch
USENIX
2003
14 years 10 months ago
Multiprocessor Support for Event-Driven Programs
This paper presents a new asynchronous programming library (libasync-smp) that allows event-driven applications to take advantage of multiprocessors by running code for event hand...
Nickolai Zeldovich, Alexander Yip, Frank Dabek, Ro...
100
Voted
OSDI
2000
ACM
14 years 10 months ago
Overcast: Reliable Multicasting with an Overlay Network
Overcast is an application-level multicasting system that can be incrementally deployed using today's Internet infrastructure. These properties stem from Overcast's impl...
John Jannotti, David K. Gifford, Kirk L. Johnson, ...