Sciweavers

443 search results - page 34 / 89
» Testing Hypergraph Coloring
Sort
View
ISPD
2005
ACM
188views Hardware» more  ISPD 2005»
14 years 2 months ago
A semi-persistent clustering technique for VLSI circuit placement
Placement is a critical component of today's physical synthesis flow with tremendous impact on the final performance of VLSI designs. However, it accounts for a significant p...
Charles J. Alpert, Andrew B. Kahng, Gi-Joon Nam, S...
COLT
2008
Springer
13 years 10 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
ICASSP
2009
IEEE
14 years 3 months ago
Robust discriminative keyword spotting for emotionally colored spontaneous speech using bidirectional LSTM networks
In this paper we propose a new technique for robust keyword spotting that uses bidirectional Long Short-Term Memory (BLSTM) recurrent neural nets to incorporate contextual informa...
Martin Wöllmer, Florian Eyben, Joseph Keshet,...
LION
2009
Springer
203views Optimization» more  LION 2009»
14 years 3 months ago
Position-Guided Tabu Search Algorithm for the Graph Coloring Problem
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
SCALESPACE
2009
Springer
14 years 3 months ago
On Semi-implicit Splitting Schemes for the Beltrami Color Flow
The Beltrami flow is an efficient non-linear filter, that was shown to be effective for color image processing. The corresponding anisotropic diffusion operator strongly couple...
Lorina Dascal, Guy Rosman, Xue-Cheng Tai, Ron Kimm...