1162 search results - page 27 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
125
click to vote
ASPDAC
2010
ACM
15 years 1 months ago
2010
ACM
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
140
click to vote
ISAAC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
126
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
125
click to vote
DAC
1999
ACM
16 years 4 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
165
Voted
PAMI
2010
15 years 2 months ago
2010
—We propose a combinatorial solution to determine the optimal elastic matching of a deformable template to an image. The central idea is to cast the optimal matching of each temp...