2489 search results - page 246 / 498 » On the Subgroup Distance Problem |
138
click to vote
SPIRE
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
157
click to vote
WSC
2008
15 years 7 months ago
2008
This investigation develops an innovative algorithm for multiple autonomous unmanned aerial vehicle (UAV) mission routing. The concept of a UAV Swarm Routing Problem (SRP) as a ne...
119
click to vote
NIPS
2003
15 years 6 months ago
2003
Clustering aims at extracting hidden structure in dataset. While the problem of finding compact clusters has been widely studied in the literature, extracting arbitrarily formed ...
140
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
134
click to vote
ECCV
2004
Springer
16 years 6 months ago
2004
Springer
Classifying materials from their appearance is a challenging problem, especially if illumination and pose conditions are permitted to change: highlights and shadows caused by 3D st...