190 search results - page 2 / 38 » Uniquely undefinable elements |
DM
1999
13 years 4 months ago
1999
A defining set (of vertex coloring) of a graph G is a set of vertices S with an assignment of colors to its elements which has a unique completion to a proper coloring of G. We de...
SIAMCOMP
2008
13 years 4 months ago
2008
We prove semi-logarithmic inapproximability for a maximization problem called unique coverage: given a collection of sets, find a subcollection that maximizes the number of elemen...
DI
2006
13 years 4 months ago
2006
: The National Software Reference Library (NSRL) provides a repository of known software, file profiles, and file signatures for use by law enforcement and other organizations invo...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Lexicon-grammar tables constitute a large-coverage syntactic lexicon but they cannot be directly used in Natural Language Processing (NLP) applications because they sometimes rely...
DM
2008
13 years 4 months ago
2008
Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce the notion of uniquely k-determined permutations. We give two criteria f...