1105 search results - page 131 / 221 » Linear choosability of graphs |
140
click to vote
IPPS
1999
IEEE
15 years 9 months ago
1999
IEEE
Abstract. A new approach to parallelizing harmonic balance simulation is presented. The technique leverages circuit substructure to expose potential parallelism in the form of a di...
117
click to vote
KDD
1998
ACM
15 years 8 months ago
1998
ACM
In this workweproposea generalisation of the notion of associationrule in the contextof flat transactions to that of a compositeassociation rule in the context of a structured dir...
136
click to vote
ICCAD
1994
IEEE
15 years 8 months ago
1994
IEEE
In high level synthesis each node of a synchronous dataflow graph (DFG) is scheduled to a specific time and allocated to a processor. In this paper we present new integer linear p...
129
Voted
REX
1991
15 years 8 months ago
1991
Abstract. We consider an optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this...
139
Voted
NAACL
2007
15 years 6 months ago
2007
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...