194 search results - page 38 / 39 » The Parameterized Complexity of Some Minimum Label Problems |
85
Voted
EDBT
2009
ACM
15 years 5 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
104
Voted
FOCS
2002
IEEE
15 years 3 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
120
Voted
AI
2011
Springer
14 years 5 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...
103
Voted
IEEEPACT
2006
IEEE
15 years 4 months ago
2006
IEEE
As chip multiprocessors (CMPs) become increasingly mainstream, architects have likewise become more interested in how best to share a cache hierarchy among multiple simultaneous t...
97
Voted
SEMCO
2009
IEEE
15 years 5 months ago
2009
IEEE
—This is a paper about a new resource, namely an English paraphrase dictionary extracted from the FrameNet lexicon and its example data base. I. THE LEXPAR PARAPHRASE DICTIONARY ...