Sciweavers

10407 search results - page 118 / 2082
» Market-Based Approaches to Optimization
Sort
View
WWW
2005
ACM
16 years 5 months ago
A uniform approach to accelerated PageRank computation
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
Frank McSherry
MMM
2009
Springer
186views Multimedia» more  MMM 2009»
15 years 11 months ago
A New Multiple Kernel Approach for Visual Concept Learning
In this paper, we present a novel multiple kernel method to learn the optimal classification function for visual concept. Although many carefully designed kernels have been propose...
Jingjing Yang, Yuanning Li, YongHong Tian, Lingyu ...
IMECS
2007
15 years 6 months ago
A Common Subexpression Sharing Approach for Multiplierless Synthesis of Multiple Constant Multiplications
—In the context of multiple constant multiplications (MCM) design, we propose a novel common-subexpression-elimination (CSE) algorithm that models synthesis of coefficients into ...
Yuen-Hong Alvin Ho, Chi-Un Lei, Ngai Wong
COMCOM
2006
105views more  COMCOM 2006»
15 years 4 months ago
Dynamic bandwidth reservation for label switched paths: An on-line predictive approach
Managing the bandwidth allocated to a Label Switched Path in MPLS networks plays a major role for provisioning of Quality of Service and efficient use of resources. In doing so, t...
Tricha Anjali, Carlo Bruni, Daniela Iacoviello, Ca...
EOR
2006
130views more  EOR 2006»
15 years 4 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni