51 search results - page 10 / 11 » Subset Seed Automaton |
LATA
2010
Springer
13 years 10 months ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
KDD
2009
ACM
14 years 6 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
KDD
2006
ACM
14 years 6 months ago
2006
ACM
Order-preserving submatrixes (OPSMs) have been accepted as a biologically meaningful subspace cluster model, capturing the general tendency of gene expressions across a subset of ...
FOCS
2008
IEEE
14 years 7 days ago
2008
IEEE
We study the k-wise independent relaxation of the usual model G(N, p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probabili...