562 search results - page 31 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
129
click to vote
TEC
2010
14 years 4 months ago
2010
Niching is an important technique for multimodal optimization. Most existing niching methods require specification of certain niching parameters in order to perform well. These nic...
BMCBI
2010
14 years 9 months ago
2010
Background: A relevant problem in drug design is the comparison and recognition of protein binding sites. Binding sites recognition is generally based on geometry often combined w...
PAMI
2008
14 years 9 months ago
2008
This paper introduces three new contributions to the problems of image classification and image search. First, we propose a new image patch quantization algorithm. Other competitiv...
140
click to vote
CVPR
2012
IEEE
13 years 3 days ago
2012
IEEE
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
CPC
2006
14 years 9 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...