2477 search results - page 140 / 496 » Approximate extended formulations |
157
click to vote
ASP
2005
Springer
15 years 10 months ago
2005
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
146
click to vote
LPAR
2004
Springer
15 years 9 months ago
2004
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
155
click to vote
CSCLP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
130
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
174
click to vote
STRINGOLOGY
2004
15 years 5 months ago
2004
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...