Zobrazeno 1 - 10
of 10
pro vyhledávání: '"ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.2: Approximation"'
Publikováno v:
The VLDB Journal
The VLDB Journal, Springer, 2020, 29 (1), pp.419-458. ⟨10.1007/s00778-019-00544-1⟩
The VLDB Journal, Springer, 2020, 29 (1), pp.419-458. ⟨10.1007/s00778-019-00544-1⟩
International audience; Because of its flexibility, intuitiveness, and ex-pressivity, the graph edit distance (GED) is one of the most widely used distance measures for labeled graphs. Since exactly computing GED is NP-hard, over the past years, vari
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a150292897a97d7293d27c7f126eda3b
https://doi.org/10.1007/s00778-019-00544-1
https://doi.org/10.1007/s00778-019-00544-1
Autor:
Rivals, Eric, Cazaux, Bastien
Publikováno v:
29th Annual Symposium on Combinatorial Pattern Matching (CPM)
29th Annual Symposium on Combinatorial Pattern Matching (CPM), Qingdao University, Jul 2018, Qingdao, China. pp.21:1-21:16, ⟨10.4230/LIPIcs.CPM.2018.21⟩
29th Annual Symposium on Combinatorial Pattern Matching
CPM: Combinatorial Pattern Matching
CPM: Combinatorial Pattern Matching, Qingdao University, Jul 2018, Qingdao, China. pp.21:1-21:16, ⟨10.4230/LIPIcs.CPM.2018.21⟩
29th Annual Symposium on Combinatorial Pattern Matching (CPM), Qingdao University, Jul 2018, Qingdao, China. pp.21:1-21:16, ⟨10.4230/LIPIcs.CPM.2018.21⟩
29th Annual Symposium on Combinatorial Pattern Matching
CPM: Combinatorial Pattern Matching
CPM: Combinatorial Pattern Matching, Qingdao University, Jul 2018, Qingdao, China. pp.21:1-21:16, ⟨10.4230/LIPIcs.CPM.2018.21⟩
A superstring of a set of words P = s1, · · · , sp is a string that contains each word of P as substring. Given P, the well known Shortest Linear Superstring problem (SLS), asks for a shortest superstring of P. In a variant of SLS, called Multi-SL
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c962cfdfff8e00bd96f655d125ec4225
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01843225/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01843225/document
Publikováno v:
EURO Journal on Computational Optimization
EURO Journal on Computational Optimization, 2017, 5 (3), pp.393-422. ⟨10.1007/s13675-016-0071-1⟩
EURO Journal on Computational Optimization, Springer, 2017, 5 (3), pp.393-422. ⟨10.1007/s13675-016-0071-1⟩
EURO Journal on Computational Optimization, Vol 5, Iss 3, Pp 393-422 (2017)
EURO Journal on Computational Optimization, 2017, 5 (3), pp.393-422. ⟨10.1007/s13675-016-0071-1⟩
EURO Journal on Computational Optimization, Springer, 2017, 5 (3), pp.393-422. ⟨10.1007/s13675-016-0071-1⟩
EURO Journal on Computational Optimization, Vol 5, Iss 3, Pp 393-422 (2017)
International audience; In this paper, we address a rich Traveling Salesman Problem with Profits encountered in several real-life cases. We propose a unified solution approach based on variable neighborhood search. Our approach combines several remov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::51132a708494bc6bc468951a77a4c00e
https://inria.hal.science/hal-01663624
https://inria.hal.science/hal-01663624
Publikováno v:
Integral Equations and Operator Theory
Integral Equations and Operator Theory, Springer Verlag, 2013, 75 (4), pp.491-516
Integral Equations and Operator Theory, 2013, 75 (4), pp.491-516
Integral Equations and Operator Theory, Springer Verlag, 2013, 75 (4), pp.491-516
Integral Equations and Operator Theory, 2013, 75 (4), pp.491-516
International audience; Two related approximation problems are formulated and solved in Hardy spaces of the disc and annulus. With practical applications in mind, truncated versions of these problems are analysed, where the solutions are chosen to li
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e46c1a308f62c3913be5b75877b11fc1
https://hal.inria.fr/hal-00904895
https://hal.inria.fr/hal-00904895
Publikováno v:
[Research Report] RR-7466, INRIA. 2010, pp.36
The aim of this paper is to present a new class of mixed finite elements on quadrilaterals and hexahedra where the approximation is polynomial on each element K. The degrees of freedom are the same as those of classical mixed finite elements. However
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::7c0aecd69941f61255fe6b24290f8026
https://inria.hal.science/inria-00541184/file/Rapport_pseudo_Hdiv_1.pdf
https://inria.hal.science/inria-00541184/file/Rapport_pseudo_Hdiv_1.pdf
Autor:
Auffray, Yves, Barbillon, Pierre
Publikováno v:
[Research Report] RR-6835, INRIA. 2009, pp.36
Since Aronszajn (1950), it is well known that a functional Hilbert space, called Reproducing Kernel Hilbert Space (RKHS), can be associated to any positive definite kernel K. This correspondence is the basis of many useful algorithms. In the more gen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2679206032f9684cc8ed1aeafba8bbd7
https://hal.inria.fr/inria-00359944
https://hal.inria.fr/inria-00359944
Publikováno v:
18th IEEE Symposium on Computer Arithmetic
18th IEEE Symposium on Computer Arithmetic, Jun 2007, Montpellier, France. pp.169-176, ⟨10.1109/ARITH.2007.17⟩
18th IEEE Symposium on Computer Arithmetic, Jun 2007, Montpellier, France. pp.169-176, ⟨10.1109/ARITH.2007.17⟩
International audience; We address the problem of computing good floating-point-coefficient polynomial approximation to a function, with respect to the supremum norm. This is a key step in most processes of evaluation of a function. We present a fast
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::cd358a079acbafae0d29f481027472be
https://hal.inria.fr/inria-00119513v2/document
https://hal.inria.fr/inria-00119513v2/document
Publikováno v:
[Research Report] RR-6219, INRIA. 2007, pp.20
We introduce the boundary measure at scale r of a compact subset of the n-dimensional Euclidean space. We show how it can be computed for point clouds and suggest these measures can be used for feature detection. The main contribution of this work is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::bc19f563f9f67ab5dbf23108ac0b1309
https://hal.inria.fr/inria-00154798v2/document
https://hal.inria.fr/inria-00154798v2/document
Publikováno v:
Mathematics in Computer Science
Mathematics in Computer Science, Springer, 2007, 1 (1), pp.39-69. ⟨10.1007/s11786-007-0004-8⟩
Mathematics in computer science, 1(1), 39-69. Birkhauser
Mathematics in Computer Science, 2007, 1 (1), pp.39-69. ⟨10.1007/s11786-007-0004-8⟩
Mathematics in Computer Science, Springer, 2007, 1 (1), pp.39-69. ⟨10.1007/s11786-007-0004-8⟩
Mathematics in computer science, 1(1), 39-69. Birkhauser
Mathematics in Computer Science, 2007, 1 (1), pp.39-69. ⟨10.1007/s11786-007-0004-8⟩
International audience; We show that the complexity of a parabolic or conic spline approximating a sufficiently smooth curve with non-vanishing curvature to within Hausdorff distance $\varepsilon$ is $c_1\varepsilon^{-\frac{1}{4}} + O(1)$, if the spl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dda5ccdfbcb27b7f25c4fcc66f355171
https://hal.inria.fr/inria-00188456/document
https://hal.inria.fr/inria-00188456/document
Publikováno v:
[Research Report] PI 1833, 2007, pp.13
We consider the problem of recovering a structured sparse representation of a signal in an overcomplete time-frequency dictionary with a particular structure. For infinite dictionaries that are the union of a nice wavelet basis and a Wilson basis, su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::8ad894af8bcb2c11071be23ae3979afc
https://hal.inria.fr/inria-00130123v2/document
https://hal.inria.fr/inria-00130123v2/document