2489 search results - page 257 / 498 » On the Subgroup Distance Problem |
113
click to vote
CSC
2006
15 years 6 months ago
2006
Partitions of a plane, based on two or three of its points, are introduced. The study of these partitions is applied to finding the minimal enclosing circle (MEC) for a set S of n...
142
click to vote
IAAI
2003
15 years 6 months ago
2003
Pattern matching for intelligence organizations is a challenging problem. The data sets are large and noisy, and there is a flexible and constantly changing notion of what consti...
141
click to vote
SODA
1998
ACM
15 years 5 months ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
115
click to vote
SOSP
1997
ACM
15 years 5 months ago
1997
ACM
A common problem facing mobile computing is disconnected operation, or computing in the absence of a network. Hoarding eases disconnected operation by selecting a subset of the us...
106
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
This paper describes a speciation method that allows an evolutionary process to learn several robot behaviors using a single execution. Species are created in behavioral space in ...