563 search results - page 29 / 113 » Computing approximate PSD factorizations |
137
click to vote
STOC
2003
ACM
16 years 5 months ago
2003
ACM
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
151
click to vote
SIAMMAX
2010
14 years 11 months ago
2010
For the approximation of time-dependent data tensors and of solutions to tensor differential equations by tensors of low Tucker rank, we study a computational approach that can be ...
148
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
149
Voted
CP
2008
Springer
15 years 6 months ago
2008
Springer
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
153
click to vote
ICAC
2006
IEEE
15 years 11 months ago
2006
IEEE
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...