699 search results - page 71 / 140 » Generalized Distance Functions in the Theory of Computation |
EVOW
2008
Springer
14 years 11 months ago
2008
Springer
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed under permutation (c.u.p.) sets and we c...
MOBIHOC
2005
ACM
15 years 9 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
CHI
2010
ACM
15 years 2 months ago
2010
ACM
A group of friends visiting a crowded and noisy music festival is an example of a situation where knowing the location of other people is important, but where external factors, su...
118
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
In this paper we present a novel face classification system
where we represent face images as a spatial arrangement
of image patches, and seek a smooth non-linear functional
map...