10935 search results - page 1943 / 2187 » Neural Programming Language |
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
120
click to vote
ICALP
2010
Springer
15 years 6 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...
134
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
102
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, re...
160
click to vote
ECOOP
2001
Springer
15 years 6 months ago
2001
Springer
Features are essential characteristic of applications within a product line. Features organized in different kinds of diagrams containing hierarchies of feature trees are closely ...