322 search results - page 36 / 65 » Algorithms for Large Integer Matrix Problems |
JMLR
2006
13 years 7 months ago
2006
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
SIROCCO
2004
13 years 9 months ago
2004
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...
CDES
2008
13 years 9 months ago
2008
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial information. As the data volume of such databases is typically very large, the q...
KDD
2012
ACM
11 years 10 months ago
2012
ACM
Many data are modeled as tensors, or multi dimensional arrays. Examples include the predicates (subject, verb, object) in knowledge bases, hyperlinks and anchor texts in the Web g...
PPSC
1993
13 years 9 months ago
1993
We present a new approach to preconditioning for very large, sparse, non-symmetric, linear systems. We explicitly compute an approximate inverse to our original matrix that can be...