33 search results - page 7 / 7 » On Minimal Words With Given Subword Complexity |
SIAMSC
2010
13 years 3 months ago
2010
This paper develops a nested iteration algorithm to solve time-dependent nonlinear systems of partial differential equations. For each time step, Newton’s method is used to form...
JCSS
2008
13 years 5 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
PODS
2008
ACM
14 years 5 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...