1282 search results - page 114 / 257 » Algorithms for Large, Sparse Network Alignment Problems |
IMC
2006
ACM
15 years 8 months ago
2006
ACM
We present an algorithm, Shared-State Sampling (S3 ), for the problem of detecting large flows in high-speed networks. While devised with different principles in mind, S3 turns ...
INFOCOM
2010
IEEE
15 years 27 days ago
2010
IEEE
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
99
Voted
ISSAC
2007
Springer
15 years 8 months ago
2007
Springer
Consider a rational matrix, particularly one whose entries have large numerators and denominators, but which is presented as a product of very sparse matrices with relatively smal...
106
Voted
UAI
2004
15 years 3 months ago
2004
Maximum a Posteriori assignment (MAP) is the problem of finding the most probable instantiation of a set of variables given the partial evidence on the other variables in a Bayesi...
144
Voted
MST
2002
15 years 2 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...