275 search results - page 47 / 55 » Parameterized Complexity of Generalized Vertex Cover Problem... |
111
Voted
STOC
2010
ACM
15 years 3 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
102
Voted
PODC
2010
ACM
15 years 3 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
SPAA
2009
ACM
15 years 6 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
113
click to vote
NIPS
2000
15 years 1 months ago
2000
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...
100
Voted
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...