328 search results - page 17 / 66 » Simple Termination Revisited |
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
Redundancy and minimization of queries are investigated in a well known fragment of XPath that includes child and descendant edges, branches, wildcards, and multiple output nodes....
DAGM
2004
Springer
13 years 11 months ago
2004
Springer
The well-known and very simple MinOver algorithm is reformulated for incremental support vector classification with and without kernels. A modified proof for its O(t-1/2 ) converge...
SIAMSC
2008
13 years 7 months ago
2008
We address the problem of conformally mapping the unit disk to polygons with elongations. The elongations cause the derivative of the conformal map to be exponentially large in so...
TIT
2010
13 years 2 months ago
2010
Abstract--In 1986, Don Knuth published a very simple algorithm for constructing sets of bipolar codewords with equal numbers of "1"s and "01"s, called balanced ...
EATCS
1998
13 years 7 months ago
1998
Experiments have shown [2] that we can only memorize images up to a certain complexity level, after which, instead of memorizing the image itself, we, sort of, memorize a probabil...