1204 search results - page 227 / 241 » Termination of Polynomial Programs |
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
RECOMB
1997
Springer
14 years 22 days ago
1997
Springer
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
CTCS
1989
Springer
14 years 19 days ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
FOCS
1989
IEEE
14 years 19 days ago
1989
IEEE
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
ESA
1995
Springer
14 years 4 days ago
1995
Springer
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...