2631 search results - page 187 / 527 » A Practical Method for the Sparse Resultant |
191
click to vote
ASPDAC
2007
ACM
15 years 11 months ago
2007
ACM
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
196
click to vote
MP
2008
15 years 7 months ago
2008
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
177
click to vote
WEA
2005
Springer
16 years 16 days ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
193
click to vote
CORR
2011
Springer
15 years 2 months ago
2011
Springer
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...
208
Voted
WISE
2002
Springer
15 years 12 months ago
2002
Springer
In this paper, we introduce a novel framework for clustering web data which is often heterogeneous in nature. As most existing methods often integrate heterogeneous data into a un...