93 search results - page 12 / 19 » Making k-means Even Faster |
179
click to vote
OOPSLA
2009
Springer
16 years 15 days ago
2009
Springer
Software has spent the bounty of Moore’s law by solving harder problems and exploiting abstractions, such as highlevel languages, virtual machine technology, binary rewritdynami...
151
click to vote
MICRO
2009
IEEE
16 years 18 days ago
2009
IEEE
Transactional Memory aims to provide a programming model that makes parallel programming easier. Hardware implementations of transactional memory (HTM) suffer from fewer overhead...
167
click to vote
CADE
2007
Springer
16 years 4 days ago
2007
Springer
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
143
click to vote
SSDBM
2010
IEEE
15 years 11 months ago
2010
IEEE
Abstract. Scientists’ ability to generate and collect massive-scale datasets is increasing. As a result, constraints in data analysis capability rather than limitations in the av...
197
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
Network operators are reluctant to share traffic data due to security and privacy concerns. Consequently, there is a lack of publicly available traces for validating and generaliz...