Sciweavers

5269 search results - page 37 / 1054
» order 2007
Sort
View
JDA
2007
83views more  JDA 2007»
14 years 11 months ago
Optimal leaf ordering of complete binary trees
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
Ulrik Brandes
AAECC
2007
Springer
113views Algorithms» more  AAECC 2007»
15 years 6 months ago
Generalized Sudan's List Decoding for Order Domain Codes
Abstract. We generalize Sudan’s list decoding algorithm without multiplicity to evaluation codes coming from arbitrary order domains. The number of correctable errors by the prop...
Olav Geil, Ryutaroh Matsumoto
ACS
2005
14 years 11 months ago
Categorical Structures Enriched in a Quantaloid: Orders and Ideals over a Base Quantaloid
Applying (enriched) categorical structures we define the notion of ordered sheaf on a quantaloid Q, which we call `Q-order'. This requires a theory of semicategories enriched ...
Isar Stubbe
AMC
2005
150views more  AMC 2005»
14 years 11 months ago
High order fitted operator numerical method for self-adjoint singular perturbation problems
We consider self-adjoint singularly perturbed two-point boundary value problems in conservation form. Highest possible order of uniform convergence for such problems achieved hith...
Kailash C. Patidar
MKM
2007
Springer
15 years 6 months ago
Higher order Proof Reconstruction from Paramodulation-Based Refutations: The Unit Equality Case
In this paper we address the problem of reconstructing a higher order, checkable proof object starting from a proof trace left by a first order automatic proof searching procedure...
Andrea Asperti, Enrico Tassi