Sciweavers

3894 search results - page 300 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
ALGORITHMICA
2004
84views more  ALGORITHMICA 2004»
15 years 6 months ago
Computing Diameter in the Streaming and Sliding-Window Models
We investigate the diameter problem in the streaming and slidingwindow models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diamet...
Joan Feigenbaum, Sampath Kannan, Jian Zhang 0004
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 10 months ago
Large-Scale Convex Minimization with a Low-Rank Constraint
We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient...
Shai Shalev-Shwartz, Alon Gonen, Ohad Shamir
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
16 years 25 days ago
Using pair approximations to predict takeover dynamics in spatially structured populations
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...
Joshua L. Payne, Margaret J. Eppstein
IR
2010
15 years 5 months ago
A general approximation framework for direct optimization of information retrieval measures
Recently direct optimization of information retrieval (IR) measures becomes a new trend in learning to rank. Several methods have been proposed and the effectiveness of them has ...
Tao Qin, Tie-Yan Liu, Hang Li
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
15 years 4 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...