Sciweavers

2698 search results - page 55 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
11 years 10 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
SAC
2006
ACM
14 years 1 months ago
A branch and prune algorithm for the approximation of non-linear AE-solution sets
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
Alexandre Goldsztejn
JMIV
2002
72views more  JMIV 2002»
13 years 7 months ago
Estimating Overcomplete Independent Component Bases for Image Windows
Estimating overcomplete ICA bases for image windows is a difficult problem. Most algorithms require the estimation of values of the independent components which leads to computatio...
Aapo Hyvärinen, Mika Inki
CORR
2004
Springer
122views Education» more  CORR 2004»
13 years 7 months ago
Simple Distributed Weighted Matchings
Wattenhofer et al. [WW04] derive a complicated distributed algorithm to compute a weighted matching of an arbitrary weighted graph, that is at most a factor 5 away from the maximu...
Jaap-Henk Hoepman
UM
2007
Springer
14 years 1 months ago
Feature-Weighted User Model for Recommender Systems
Recommender systems are gaining widespread acceptance in e-commerce applications to confront the “information overload” problem. Collaborative Filtering (CF) is a successful re...
Panagiotis Symeonidis, Alexandros Nanopoulos, Yann...