2434 search results - page 279 / 487 » Algorithmic Randomness of Closed Sets |
141
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Median-shift is a mode seeking algorithm that relies on
computing the median of local neighborhoods, instead of
the mean. We further combine median-shift with Locality
Sensitive...
124
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Hyper-heuristics (HHs) are heuristics that work with an arbitrary set of search operators or algorithms and combine these algorithms adaptively to achieve a better performance tha...
146
click to vote
SSDBM
2003
IEEE
15 years 9 months ago
2003
IEEE
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
160
click to vote
IEEESCC
2009
IEEE
15 years 1 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
131
click to vote
ICCV
2003
IEEE
16 years 5 months ago
2003
IEEE
This paper presents a multi-scale generative model for representing animate shapes and extracting meaningful parts of objects. The model assumes that animate shapes (2D simple clo...