38 search results - page 6 / 8 » Leaving the Span |
WETICE
2003
IEEE
14 years 10 days ago
2003
IEEE
Web Services define a new paradigm in present-day collaborative application development in enterprises, and span systems, networks, and organizations. Emerging computing infrastru...
MFCS
2010
Springer
13 years 5 months ago
2010
Springer
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...
MP
2007
13 years 6 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....