Sciweavers

559 search results - page 109 / 112
» Fast SDP Algorithms for Constraint Satisfaction Problems
Sort
View
DFT
2003
IEEE
64views VLSI» more  DFT 2003»
15 years 4 months ago
Hybrid BIST Time Minimization for Core-Based Systems with STUMPS Architecture
1 This paper presents a solution to the test time minimization problem for core-based systems that contain sequential cores with STUMPS architecture. We assume a hybrid BIST approa...
Gert Jervan, Petru Eles, Zebo Peng, Raimund Ubar, ...
SDM
2011
SIAM
232views Data Mining» more  SDM 2011»
14 years 2 months ago
A Sequential Dual Method for Structural SVMs
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...
Shirish Krishnaj Shevade, Balamurugan P., S. Sunda...
ECML
2005
Springer
15 years 5 months ago
Nonrigid Embeddings for Dimensionality Reduction
Spectral methods for embedding graphs and immersing data manifolds in low-dimensional speaces are notoriously unstable due to insufficient and/or numberically ill-conditioned con...
Matthew Brand
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
15 years 6 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
JSAC
2007
132views more  JSAC 2007»
14 years 11 months ago
Lifetime maximization via cooperative nodes and relay deployment in wireless networks
— Extending lifetime of battery-operated devices is a key design issue that allows uninterrupted information exchange among distributed nodes in wireless networks. Cooperative co...
Thanongsak Himsoon, W. Pam Siriwongpairat, Zhu Han...