Sciweavers

824 search results - page 35 / 165
» Weighted Low-Rank Approximations
Sort
View
CATS
2006
13 years 10 months ago
Graph Orientation Algorithms to Minimize the Maximum Outdegree
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei ...
WINE
2009
Springer
138views Economy» more  WINE 2009»
14 years 3 months ago
Covering Games: Approximation through Non-cooperation
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
Martin Gairing
APPROX
2010
Springer
176views Algorithms» more  APPROX 2010»
13 years 10 months ago
Approximation Algorithms for Min-Max Generalization Problems
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
Piotr Berman, Sofya Raskhodnikova
ESANN
1998
13 years 9 months ago
A comparison between weighted radial basis functions and wavelet networks
In the present paper, Wavelet Networks, are proven to be, as well as many other neural paradigms, a speci c case of the generic paradigm named Weighted Radial Basis Functions Netw...
Mirko Sgarbi, Valentina Colla, Leonardo Maria Reyn...
COCO
2008
Springer
88views Algorithms» more  COCO 2008»
13 years 10 months ago
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard
We prove that the weighted monotone circuit satisfiability problem has no fixed-parameter tractable approximation algorithm with constant or polylogarithmic approximation ratio un...
Kord Eickmeyer, Martin Grohe, Magdalena Grübe...