Sciweavers

1158 search results - page 93 / 232
» Approximation Algorithms for the Fixed-Topology Phylogenetic...
Sort
View
ICML
2004
IEEE
16 years 7 months ago
Generalized low rank approximations of matrices
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
Jieping Ye
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
16 years 6 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
ATAL
2011
Springer
14 years 6 months ago
A double oracle algorithm for zero-sum security games on graphs
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
Manish Jain, Dmytro Korzhyk, Ondrej Vanek, Vincent...
163
Voted
TALG
2010
123views more  TALG 2010»
15 years 4 months ago
Lower-bounded facility location
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...
Zoya Svitkina
CVPR
2008
IEEE
16 years 8 months ago
Approximate earth mover's distance in linear time
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
Sameer Shirdhonkar, David W. Jacobs