5606 search results - page 599 / 1122 » Randomization Techniques for Graphs. |
155
click to vote
ICDCS
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper we examine the problem of balancing load in a large-scale distributed system when information about server loads may be stale. It is well known that sending each req...
184
click to vote
ICS
2010
Tsinghua U.
15 years 11 months ago
2010
Tsinghua U.
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
183
click to vote
AAAI
2008
15 years 9 months ago
2008
We present a novel application of structured classification: identifying function entry points (FEPs, the starting byte of each function) in program binaries. Such identification ...
227
click to vote
DMIN
2006
15 years 8 months ago
2006
In this paper, we propose a post randomization technique to learn a Bayesian network (BN) from distributed heterogeneous data, in a privacy sensitive fashion. In this case, two or ...
215
click to vote
ADHOC
2007
15 years 7 months ago
2007
We investigate the problem of modeling node capture attacks in heterogeneous wireless ad hoc and mesh networks. Classical adversarial models such as the Dolev–Yao model are know...