3016 search results - page 210 / 604 » The Online Transportation Problem |
132
click to vote
COMBINATORICA
2010
15 years 2 months ago
2010
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
198
Voted
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
This paper describes the conceptual and algorithmic evolutions of Memory Based Parametric Equalization (MPEQ) needed to exploit the potentialities of the method within the state-o...
152
click to vote
SIGMOD
2011
ACM
14 years 7 months ago
2011
ACM
We address the problem of making online, parallel query plans fault-tolerant: i.e., provide intra-query fault-tolerance without blocking. We develop an approach that not only achi...
141
Voted
IACR
2011
14 years 4 months ago
2011
Protocols for generic secure multi-party computation (MPC) come in two forms: they either represent the function being computed as a boolean circuit, or as an arithmetic circuit o...