Sciweavers

14158 search results - page 74 / 2832
» Generalized switch-setting problems
Sort
View
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
12 years 13 days 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
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
13 years 25 days ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
OIR
2007
95views more  OIR 2007»
13 years 9 months ago
Help features in digital libraries: types, formats, presentation styles, and problems
Purpose – The purpose of this paper is to evaluate Help features in digital libraries and identify problems related to their design. Design/methodology/approach – This study s...
Hong (Iris) Xie
SIAMSC
2010
136views more  SIAMSC 2010»
13 years 4 months ago
A Krylov Method for the Delay Eigenvalue Problem
Abstract. The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems. The main goal of this paper is to generalize the Arnoldi method to the ...
Elias Jarlebring, Karl Meerbergen, Wim Michiels
IJLIT
2010
67views more  IJLIT 2010»
13 years 8 months ago
Interoperability-Centric Problems: New Challenges and Legal Solutions
Whereas abandonment of detailed regulation is widely asserted to be the true way along with the fluctuations of the business models and emergence of IP-based services, there are s...
Turgut Ayhan Beydogan