29908 search results - page 233 / 5982 » On the Complexity of |
207
click to vote
FAW
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
175
click to vote
ICA
2007
Springer
16 years 24 days ago
2007
Springer
In this paper, we propose to use the Huber M-estimator cost function as a contrast function within the complex FastICA algorithm of Bingham and Hyvarinen for the blind separation o...
166
click to vote
SEMWEB
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. An important open question in the semantic Web is the precise relationship between the RDF(S) semantics and the semantics of standard knowledge representation formalisms ...
152
click to vote
STACS
2007
Springer
16 years 22 days ago
2007
Springer
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of...
167
Voted
ICSEA
2006
IEEE
16 years 20 days ago
2006
IEEE
A modeling process is presented for extracting timingaccurate simulation models from complex embedded realtime systems. The process is supported by two complementary methods for t...