3049 search results - page 510 / 610 » On the Convergence of Bound Optimization Algorithms |
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
ISAAC
2009
Springer
14 years 3 months ago
2009
Springer
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...
STOC
1998
ACM
14 years 1 months ago
1998
ACM
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
ICALP
1992
Springer
14 years 29 days ago
1992
Springer
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...