Sciweavers

817 search results - page 100 / 164
» An Optimal Linear Time Algorithm for Quasi-Monotonic Segment...
Sort
View
INFORMATICALT
2010
103views more  INFORMATICALT 2010»
13 years 2 months ago
Multistage K-Means Clustering for Scenario Tree Construction
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
Kristina Sutiene, Dalius Makackas, Henrikas Pranev...
CORR
2011
Springer
157views Education» more  CORR 2011»
12 years 11 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
CC
2008
Springer
193views System Software» more  CC 2008»
13 years 9 months ago
Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model
The polyhedral model provides powerful abstractions to optimize loop nests with regular accesses. Affine transformations in this model capture a complex sequence of execution-reord...
Uday Bondhugula, Muthu Manikandan Baskaran, Sriram...
IACR
2011
94views more  IACR 2011»
12 years 7 months ago
Secure Computation with Sublinear Amortized Work
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
S. Dov Gordon, Jonathan Katz, Vladimir Kolesnikov,...
SIGMETRICS
2008
ACM
116views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Optimal sampling in state space models with applications to network monitoring
Advances in networking technology have enabled network engineers to use sampled data from routers to estimate network flow volumes and track them over time. However, low sampling ...
Harsh Singhal, George Michailidis