Sciweavers

5331 search results - page 147 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
ICML
2009
IEEE
16 years 7 months ago
Learning spectral graph transformations for link prediction
We present a unified framework for learning link prediction and edge weight prediction functions in large networks, based on the transformation of a graph's algebraic spectru...
Andreas Lommatzsch, Jérôme Kunegis
ACII
2005
Springer
15 years 12 months ago
An Online Multi-stroke Sketch Recognition Method Integrated with Stroke Segmentation
In this paper a novel multi-stroke sketch recognition method is presented. This method integrates the stroke segmentation and sketch recognition into a single approach, in which bo...
Jianfeng Yin, Zhengxing Sun
ICIP
1997
IEEE
16 years 8 months ago
Bit Allocation Methods for Closed-Loop Coding of Oversampled Pyramid Decompositions
Oversampled pyramid decompositions have been successfully applied to scalable video coding. Quantization noise feedback at the encoder closed-loop coding" has several advant...
Uwe Horn, Thomas Wiegand, Bernd Girod
DATE
2008
IEEE
78views Hardware» more  DATE 2008»
16 years 27 days ago
Simultaneous FU and Register Binding Based on Network Flow Method
– With the rapid increase of design complexity and the decrease of device features in nano-scale technologies, interconnection optimization in digital systems becomes more and mo...
Jason Cong, Junjuan Xu
CP
2003
Springer
15 years 11 months ago
Semi-independent Partitioning: A Method for Bounding the Solution to COP's
In this paper we introduce a new method for bounding the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict gene...
David Larkin