633 search results - page 19 / 127 » Locality and Hard SAT-Instances |
TIP
2010
13 years 3 months ago
2010
One weakness in the existing interactive image segmentation algorithms is the lack of more intelligent ways to understand the intention of user inputs. In this paper, we advocate t...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Finding binary sequences with low autocorrelation is a very hard problem with many practical applications. In this paper we analyze several metaheuristic approaches to tackle the ...
BMCBI
2010
13 years 8 months ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
CF
2006
ACM
13 years 10 months ago
2006
ACM
The growing speed gap between memory and processor makes an efficient use of the cache ever more important to reach high performance. One of the most important ways to improve cac...
SCIA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. This paper deals, for the first time, with an analysis of localization capabilities of weakly supervised categorization systems. Most existing categorization approaches ...