Sciweavers

555 search results - page 97 / 111
» Linear decomposition algorithm for VLSI design applications
Sort
View
SIAMSC
2010
127views more  SIAMSC 2010»
14 years 8 months ago
A Nonlinear Optimization Procedure for Generalized Gaussian Quadratures
We present a new nonlinear optimization procedure for the computation of generalized Gaussian quadratures for a broad class of square integrable functions on intervals. While some ...
James Bremer, Zydrunas Gimbutas, Vladimir Rokhlin
MLG
2007
Springer
15 years 4 months ago
Learning Graph Matching
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
Alex J. Smola
AI
2002
Springer
14 years 9 months ago
Using similarity criteria to make issue trade-offs in automated negotiations
Automated negotiation is a key form of interaction in systems that are composed of multiple autonomous agents. The aim of such interactions is to reach agreements through an itera...
Peyman Faratin, Carles Sierra, Nicholas R. Jenning...
DCC
2003
IEEE
15 years 9 months ago
Optimal Alphabet Partitioning for Semi-Adaptive Coding of Sources of Unknown Sparse Distributions
Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix...
Dan Chen, Yi-Jen Chiang, Nasir D. Memon, Xiaolin W...
ICCAD
2006
IEEE
131views Hardware» more  ICCAD 2006»
15 years 6 months ago
Fast wire length estimation by net bundling for block placement
The wire length estimation is the bottleneck of packing based block placers. To cope with this problem, we present a fast wire length estimation method in this paper. The key idea...
Tan Yan, Hiroshi Murata