4218 search results - page 840 / 844 » Complete sets of cooperations |
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
Conventional OLTP systems assign each transaction to a worker thread and that thread accesses data, depending on what the transaction dictates. This thread-to-transaction work ass...
APPROX
2011
Springer
12 years 7 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
EMMCVPR
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. We present two data-driven importance distributions for particle filterbased articulated tracking; one based on background subtraction, another on depth information. In ...
IACR
2011
12 years 7 months ago
2011
Software drive encryption systems are vulnerable to memory attacks, in which an attacker gains physical accesses to the unattended computer, obtains the decryption keys from memor...
ICC
2011
IEEE
12 years 7 months ago
2011
IEEE
—In this paper, we investigate the transmission completion time minimization problem in a two-user additive white Gaussian noise (AWGN) broadcast channel, where the transmitter i...