6045 search results - page 185 / 1209 » Computable Linearizations of Well-partial-orderings |
CORR
2012
Springer
12 years 3 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
SIGMOD
2007
ACM
14 years 8 months ago
2007
ACM
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
BMCBI
2011
13 years 3 months ago
2011
Background: Building repositories of computational models of biological systems ensures that published models are available for both education and further research, and can provid...
CISIS
2008
IEEE
14 years 2 months ago
2008
IEEE
Parallel algorithms divide computation among several threads. In many cases, the input must also be divided. Consider an input consisting of a linear sequence of elements whose le...
IJCNN
2008
IEEE
14 years 2 months ago
2008
IEEE
— We discuss sparse support vector machines (sparse SVMs) trained in the reduced empirical feature space. Namely, we select the linearly independent training data by the Cholesky...