882 search results - page 31 / 177 » On self-embeddings of computable linear orderings |
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Level set method based segmentation provides an efficient tool for topological and geometrical shape handling. Conventional level set surfaces are only C0 continuous since the le...
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
COCOA
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
CIE
2007
Springer
15 years 4 months ago
2007
Springer
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...
RTA
2010
Springer
15 years 1 months ago
2010
Springer
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bo...