3946 search results - page 714 / 790 » The computational complexity of choice sets |
295
click to vote
POPL
2009
ACM
16 years 7 months ago
2009
ACM
Transactional memory (TM) is a promising paradigm for concurrent programming. Whereas the number of TM implementations is growing, however, little research has been conducted to p...
199
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
197
click to vote
KDD
2003
ACM
16 years 6 months ago
2003
ACM
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technolog...
188
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
211
click to vote
IUI
2009
ACM
16 years 3 months ago
2009
ACM
Recent years have seen a resurgence of interest in programming by demonstration. As end users have become increasingly sophisticated, computer and artificial intelligence technolo...