1369 search results - page 44 / 274 » Lattice computations for random numbers |
WDAG
2005
Springer
14 years 2 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 ...
MASCOTS
2003
13 years 10 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...
CORR
2011
Springer
13 years 3 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
14 years 2 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...
CVPR
2008
IEEE
14 years 11 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...