2430 search results - page 472 / 486 » Computing Tutte Polynomials |
TAMC
2010
Springer
14 years 23 days ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
INFOCOM
2002
IEEE
14 years 19 days ago
2002
IEEE
— For wireless cellular and ad hoc networks with QoS constraints, we propose a suite of problem formulations that allocate network resources to optimize SIR, maximize throughput ...
GECCO
2010
Springer
14 years 15 days ago
2010
Springer
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...
ICALP
2010
Springer
14 years 15 days 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...
FSTTCS
2009
Springer
14 years 9 days ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...