Sciweavers

2031 search results - page 100 / 407
» Approximation Algorithms for 2-Stage Stochastic Optimization...
Sort
View
FOCS
2004
IEEE
13 years 12 months ago
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Amit Chakrabarti, Oded Regev
CVPR
2006
IEEE
14 years 10 months ago
Equivalence of Non-Iterative Algorithms for Simultaneous Low Rank Approximations of Matrices
Recently four non-iterative algorithms for simultaneous low rank approximations of matrices (SLRAM) have been presented by several researchers. In this paper, we show that those a...
Kohei Inoue, Kiichi Urahama
CLUSTER
2001
IEEE
13 years 11 months ago
Approximation Algorithms for Data Distribution with Load Balancing of Web Servers
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
Li-Chuan Chen, Hyeong-Ah Choi
JMLR
2010
195views more  JMLR 2010»
13 years 6 months ago
Online Learning for Matrix Factorization and Sparse Coding
Sparse coding—that is, modelling data vectors as sparse linear combinations of basis elements—is widely used in machine learning, neuroscience, signal processing, and statisti...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
IPPS
2007
IEEE
14 years 2 months ago
Distributed Adaptive Particle Swarm Optimizer in Dynamic Environment
Particle Swarm Optimization (PSO) is a population-based stochastic optimization technique, which can be used to find an optimal, or near optimal, solution to a numerical and quali...
Xiaohui Cui, Thomas E. Potok