2466 search results - page 160 / 494 » Concurrent Clustered Programming |
131
click to vote
NIPS
2004
15 years 3 months ago
2004
We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...
122
Voted
ECOOP
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. An important application of unique object references is safe and efficient message passing in concurrent object-oriented programming. However, to prevent the ill effects...
94
Voted
PPOPP
2009
ACM
15 years 7 months ago
2009
ACM
Boosted transactions offer an attractive method that enables programmers to create larger transactions that scale well and offer deadlock-free guarantees. However, as boosted tran...
115
click to vote
PPOPP
2012
ACM
13 years 10 months ago
2012
ACM
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
126
click to vote
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
Peer-to-Peer (P2P) cycle sharing over the Internet has become increasingly popular as a way to share idle cycles. A fundamental problem faced by P2P cycle sharing systems is how t...