1369 search results - page 44 / 274 » Lattice computations for random numbers |
121
click to vote
WDAG
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
121
click to vote
MASCOTS
2003
15 years 2 months ago
2003
Abstract. The availability of reliable models of computer virus propagation would prove useful in a number of ways, in order both to predict future threats, and to develop new cont...
126
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
FOCS
2003
IEEE
15 years 6 months ago
2003
IEEE
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
127
Voted
CVPR
2008
IEEE
16 years 3 months ago
2008
IEEE
Joint data alignment is often regarded as a data simplification process. This idea is powerful and general, but raises two delicate issues. First, one must make sure that the usef...