Sciweavers

3874 search results - page 292 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
DAGSTUHL
2007
15 years 6 months ago
Nonsymmetric algebraic Riccati equations associated with an M-matrix: recent advances and algorithms
We survey on theoretical properties and algorithms concerning the problem of solving a nonsymmetric algebraic Riccati equation, and we report on some known methods and new algorit...
Dario Andrea Bini, Bruno Iannazzo, Beatrice Meini,...
SIGMOD
1999
ACM
101views Database» more  SIGMOD 1999»
15 years 9 months ago
Join Synopses for Approximate Query Answering
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
Swarup Acharya, Phillip B. Gibbons, Viswanath Poos...
WIRN
2005
Springer
15 years 10 months ago
Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
Alberto Bertoni, Giorgio Valentini
ALGORITHMICA
2004
84views more  ALGORITHMICA 2004»
15 years 4 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 8 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