4377 search results - page 600 / 876 » Mass problems and randomness |
181
click to vote
ANCS
2009
ACM
15 years 4 months ago
2009
ACM
The problem of maintaining efficiently a large number (say millions) of statistics counters that need to be updated at very high speeds (e.g. 40 Gb/s) has received considerable re...
190
click to vote
CLEF
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we describe an approach for the automatic medical image annotation task of the 2009 CLEF cross-language image retrieval campaign (ImageCLEF). This work is focused o...
201
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— We address a lifetime maximization problem for a single-hop wireless sensor network where multiple sensors encode and communicate their measurements of a Gaussian random source...
225
click to vote
FOCS
2005
IEEE
16 years 9 days ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
179
click to vote
SPAA
2004
ACM
16 years 3 days ago
2004
ACM
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...