1182 search results - page 208 / 237 » Iterative Methods in Combinatorial Optimization |
DCC
2010
IEEE
13 years 10 months ago
2010
IEEE
Abstract Cryptanalytic time memory tradeoff algorithms are generic one-way function inversion techniques that utilize pre-computation. Even though the online time complexity is kno...
TJS
2002
13 years 9 months ago
2002
This paper describes a tiling technique that can be used by application programmers and optimizing compilers to obtain I/O-efficient versions of regular scientific loop nests. Due ...
PAMI
2011
13 years 4 months ago
2011
— The accurate detection of object boundaries via active contours is an ongoing research topic in computer vision. Most active contours converge towards some desired contour by m...
PR
2006
13 years 9 months ago
2006
Many computer vision and pattern recognition algorithms are very sensitive to the choice of an appropriate distance metric. Some recent research sought to address a variant of the...
IPPS
1997
IEEE
14 years 2 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...