4930 search results - page 49 / 986 » Learning minimal abstractions |
87
Voted
PACT
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The hotspot seriously degrades the performance of a parallel algorithm but there have not been many methods proposed for this problem. Without modification of mesh topolo...
DIS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper, first we introduce minimal and closed monotone DNF formulas as extensions of maximal and closed itemsets. Next, by incorporating the algorithm dnf cover d...
102
Voted
WIA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a famil...
98
Voted
PPAM
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. This paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard,...
106
click to vote
ACCV
1998
Springer
15 years 4 months ago
1998
Springer
Abstract In this paper will be investigated what constraints on the intrinsic parameters that are needed in order to reconstruct an unknown scene from a number of its projective im...