1538 search results - page 256 / 308 » Spectral Techniques in Graph Algorithms |
ICSE
2008
IEEE-ACM
14 years 11 months ago
2008
IEEE-ACM
Several techniques have been developed for identifying similar code fragments in programs. These similar fragments, referred to as code clones, can be used to identify redundant c...
ECCV
2008
Springer
14 years 8 months ago
2008
Springer
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
PODC
2009
ACM
14 years 10 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
EUROSYS
2006
ACM
14 years 7 months ago
2006
ACM
—Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under consider...