Sciweavers

362 search results - page 38 / 73
» Analysis and Generalizations of the Linearized Bregman Metho...
Sort
View
CVPR
1998
IEEE
14 years 9 months ago
Generation of the Euclidean Skeleton from the Vector Distance Map by a Bisector Decision Rule
The Euclidean skeleton is essential for general shape representation. This paper provides an e cient method to extract a well-connected Euclidean skeleton by a neighbor bisector d...
Hong Li, Albert M. Vossepoel
SLIP
2009
ACM
14 years 2 months ago
Predicting the worst-case voltage violation in a 3D power network
This paper proposes an efficient method to predict the worst case of voltage violation by multi-domain clock gating in a three-dimensional (3D) on-chip power network considering l...
Wanping Zhang, Wenjian Yu, Xiang Hu, Amirali Shaya...
DAC
2003
ACM
14 years 8 months ago
Power grid reduction based on algebraic multigrid principles
With the scaling of technology, power grid noise is becoming increasingly significant for circuit performance. A typical power grid circuit contains millions of linear elements, m...
Haihua Su, Emrah Acar, Sani R. Nassif
KDD
2007
ACM
197views Data Mining» more  KDD 2007»
14 years 8 months ago
Learning the kernel matrix in discriminant analysis via quadratically constrained quadratic programming
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...
Jieping Ye, Shuiwang Ji, Jianhui Chen
DAM
1999
100views more  DAM 1999»
13 years 7 months ago
Complexity Analysis of Propositional Resolution with Autarky Pruning
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
Allen Van Gelder