4377 search results - page 798 / 876 » Mass problems and randomness |
SODA
2010
ACM
15 years 7 months ago
2010
ACM
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
104
click to vote
ICDT
2010
ACM
15 years 7 months ago
2010
ACM
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
IUI
2010
ACM
15 years 6 months ago
2010
ACM
Most of the previous work on non-invasive brain-computer interfaces (BCIs) has been focused on feature extraction and classification algorithms to achieve high performance for the...
ICDE
2010
IEEE
15 years 4 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...