2489 search results - page 130 / 498 » On the Subgroup Distance Problem |
145
click to vote
EMMCVPR
1997
Springer
15 years 8 months ago
1997
Springer
Consistent labelling problems frequently have more than one solution. Most work in the "eld has aimed at disambiguating early in the interpretation process, using only local ...
133
click to vote
ALGORITHMICA
2006
15 years 4 months ago
2006
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
149
click to vote
COCOON
2010
Springer
15 years 7 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
113
click to vote
SDM
2010
SIAM
15 years 5 months ago
2010
SIAM
The dimensionality reduction problem has been widely studied in the database literature because of its application for concise data representation in a variety of database applica...
140
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality which exists in ...