7015 search results - page 188 / 1403 » Approximation algorithms for co-clustering |
209
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
141
click to vote
ALGORITHMICA
2004
15 years 6 months ago
2004
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
145
click to vote
COCOON
2007
Springer
16 years 13 days ago
2007
Springer
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 (...
178
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
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...
181
click to vote
PODS
2003
ACM
16 years 6 months ago
2003
ACM
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...