11752 search results - page 2176 / 2351 » Those |
177
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
129
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We propose a novel distortion-theoretic approach to a secure three-party computation problem. Alice and Bob have deterministic sequences, and Charlie wishes to compute a normalize...
154
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
151
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Natural networks such as those between humans observed through their interactions or biological networks predicted based on various experimental measurements contain a wealth of i...
193
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particula...