4047 search results - page 144 / 810 » Some Properties and Some Problems on Set Functors |
181
Voted
DIS
2000
Springer
15 years 10 months ago
2000
Springer
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
179
Voted
LREC
2010
15 years 4 months ago
2010
In this paper we discuss some well-known morphological descriptions used in various projects and applications (most notably MULTEXT-East and Unitex) and illustrate the encountered...
149
click to vote
LPNMR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given groun...
184
Voted
GC
2007
Springer
15 years 5 months ago
2007
Springer
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
135
click to vote
GD
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. The need for a similarity measure for comparing two drawings of graphs arises in problems such as interactive graph drawing and the indexing or browsing of large sets of ...