2370 search results - page 1 / 474 » The Characterization of Data-Accumulating Algorithms |
IPPS
1999
IEEE
13 years 9 months ago
1999
IEEE
A data-accumulating algorithm (d-algorithm for short) works on an input considered as a virtually endless stream. The computation terminates when all the currently arrived data ha...
STOC
2012
ACM
11 years 7 months ago
2012
ACM
We obtain a characterization of feasible, Bayesian, multi-item multi-bidder mechanisms with independent, additive bidders as distributions over hierarchical mechanisms. Combined w...
IOR
2011
12 years 11 months ago
2011
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We prop...
COMGEO
2011
ACM
12 years 12 months ago
2011
ACM
A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed ...
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
We consider a power-controlled wireless network with an established network topology in which the communication links (transmitter-receiver pairs) are subject to general constrain...