4114 search results - page 64 / 823 » Efficient Algorithms for the 2-Center Problems |
124
click to vote
VLSID
2002
IEEE
16 years 5 months ago
2002
IEEE
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
139
Voted
DAC
2006
ACM
16 years 5 months ago
2006
ACM
In this paper we present a new efficient algorithm for retiming sequential circuits with edge-triggered registers under both setup and hold constraints. Compared with the previous...
146
click to vote
VLDB
1995
ACM
15 years 8 months ago
1995
ACM
Mining for a.ssociation rules between items in a large database of sales transactions has been described as an important database mining problem. In this paper we present an effic...
127
click to vote
RECOMB
2005
Springer
16 years 4 months ago
2005
Springer
Abstract. The interpretation of large-scale protein network data depends on our ability to identify significant sub-structures in the data, a computationally intensive task. Here w...
158
Voted
ENC
2004
IEEE
15 years 8 months ago
2004
IEEE
Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of...