1201 search results - page 146 / 241 » Linear Probing and Graphs |
KDD
1998
ACM
15 years 4 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...
101
Voted
ICCAD
1994
IEEE
15 years 4 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...
102
click to vote
REX
1991
15 years 4 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...
NAACL
2007
15 years 2 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...
82
Voted
SIROCCO
2003
15 years 2 months ago
2003
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...