9842 search results - page 1573 / 1969 » The Complexity of the Matching-Cut Problem |
196
click to vote
SSDBM
2010
IEEE
15 years 4 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
215
click to vote
TRIDENTCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
The Internet enables the way how global businesses and communities communicate today. In the last years, however, new demands have collided with old designs, resulting in a complex...
182
click to vote
DLOG
2009
15 years 4 months ago
2009
Abstract. GridTest is a framework for testing automated theorem provers using randomly generated formulas. It can be used to run tests locally, in a single computer, or in a comput...
213
click to vote
FLAIRS
2009
15 years 4 months ago
2009
For certain disable persons unable to communicate, we present a palliative aid which consist of a virtual pictographic keyboard associated to a text processing from a pictographic...
213
click to vote
HIPC
2009
Springer
15 years 4 months ago
2009
Springer
Stream computing research is moving from terascale to petascale levels. It aims to rapidly analyze data as it streams in from many sources and make decisions with high speed and a...