9842 search results - page 423 / 1969 » The Complexity of the Matching-Cut Problem |
154
click to vote
CIKM
1998
Springer
15 years 9 months ago
1998
Springer
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
129
click to vote
KES
1998
Springer
15 years 9 months ago
1998
Springer
Robotic controllers take advantage from neural network learning capabilities as long as the dimensionality of the problem is kept moderate. This paper explores the possibilities of...
161
click to vote
CCL
1994
Springer
15 years 8 months ago
1994
Springer
Abstract: This paper describes the application of CLP (constraint logic programming) to several digital circuit design problems. It is shown that logic programming together with ef...
138
click to vote
CLUSTER
2001
IEEE
15 years 8 months ago
2001
IEEE
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a po...
140
click to vote
ICALP
2000
Springer
15 years 8 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...