Sciweavers

7150 search results - page 399 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
JMLR
2012
13 years 9 months ago
Fast interior-point inference in high-dimensional sparse, penalized state-space models
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
Eftychios A. Pnevmatikakis, Liam Paninski
ALGORITHMICA
2004
130views more  ALGORITHMICA 2004»
15 years 6 months ago
The Power of Priority Algorithms for Facility Location and Set Cover
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
Spyros Angelopoulos, Allan Borodin
COCOON
2007
Springer
16 years 1 months ago
Priority Algorithms for the Subset-Sum Problem
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
Yuli Ye, Allan Borodin
COCOON
2005
Springer
15 years 8 months ago
On-Line Algorithms for Market Equilibria
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...
Spyros Angelopoulos, Atish Das Sarma, Avner Magen,...
PODS
2003
ACM
157views Database» more  PODS 2003»
16 years 7 months ago
Algorithms for data migration with cloning
Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such high demand storage servers are used as web servers, or multimedia servers...
Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan