corpus_id stringlengths 7 12 | paper_id stringlengths 9 16 | title stringlengths 1 261 | abstract stringlengths 70 4.02k | source stringclasses 1
value | bibtex stringlengths 208 20.9k | citation_key stringlengths 6 100 |
|---|---|---|---|---|---|---|
arxiv-676801 | math/0602059 | The Matrix of Maximum Out Forests of a Digraph and Its Applications | <|reference_start|>The Matrix of Maximum Out Forests of a Digraph and Its Applications: We study the maximum out forests of a (weighted) digraph and the matrix of maximum out forests. A maximum out forest of a digraph G is a spanning subgraph of G that consists of disjoint diverging trees and has the maximum possible n... | arxiv | @article{agaev2006the,
title={The Matrix of Maximum Out Forests of a Digraph and Its Applications},
author={Rafig Agaev and Pavel Chebotarev},
journal={Automation and Remote Control 61 (2000) 1424--1450},
year={2006},
archivePrefix={arXiv},
eprint={math/0602059},
primaryClass={math.CO cs.DS ... | agaev2006the |
arxiv-676802 | math/0602061 | Spanning Forests of a Digraph and Their Applications | <|reference_start|>Spanning Forests of a Digraph and Their Applications: We study spanning diverging forests of a digraph and related matrices. It is shown that the normalized matrix of out forests of a digraph coincides with the transition matrix in a specific observation model for Markov chains related to the digraph... | arxiv | @article{agaev2006spanning,
title={Spanning Forests of a Digraph and Their Applications},
author={Rafig Agaev and Pavel Chebotarev},
journal={Automation and Remote Control 62 (2001) No.3 443-466},
year={2006},
doi={10.1023/A:1002862312617},
archivePrefix={arXiv},
eprint={math/0602061},
p... | agaev2006spanning |
arxiv-676803 | math/0602070 | The Matrix-Forest Theorem and Measuring Relations in Small Social Groups | <|reference_start|>The Matrix-Forest Theorem and Measuring Relations in Small Social Groups: We propose a family of graph structural indices related to the Matrix-forest theorem. The properties of the basic index that expresses the mutual connectivity of two vertices are studied in detail. The derivative indices that m... | arxiv | @article{chebotarev2006the,
title={The Matrix-Forest Theorem and Measuring Relations in Small Social Groups},
author={Pavel Chebotarev and Elena Shamis},
journal={Automation and Remote Control 58 (1997) No. 9 1505-1514},
year={2006},
archivePrefix={arXiv},
eprint={math/0602070},
primaryClass... | chebotarev2006the |
arxiv-676804 | math/0602073 | On Proximity Measures for Graph Vertices | <|reference_start|>On Proximity Measures for Graph Vertices: We study the properties of several proximity measures for the vertices of weighted multigraphs and multidigraphs. Unlike the classical distance for the vertices of connected graphs, these proximity measures are applicable to weighted structures and take into ... | arxiv | @article{chebotarev2006on,
title={On Proximity Measures for Graph Vertices},
author={Pavel Chebotarev and Elena Shamis},
journal={Automation and Remote Control 59 (1998), No. 10, Part 2 1443-1459.
Erratum: 60 (1999), No. 2, Part 2 297},
year={2006},
archivePrefix={arXiv},
eprint={math/0602073}... | chebotarev2006on |
arxiv-676805 | math/0602154 | What is the Inverse of Repeated Square and Multiply Algorithm? | <|reference_start|>What is the Inverse of Repeated Square and Multiply Algorithm?: It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm efficiently. The... | arxiv | @article{gadiyar2006what,
title={What is the Inverse of Repeated Square and Multiply Algorithm?},
author={H. Gopalkrishna Gadiyar, K M Sangeeta Maini, R. Padma and Mario Romsy},
journal={Colloq. Math. 116 (2009) 1-14},
year={2006},
archivePrefix={arXiv},
eprint={math/0602154},
primaryClass={... | gadiyar2006what |
arxiv-676806 | math/0602171 | Preference fusion when the number of alternatives exceeds two: indirect scoring procedures | <|reference_start|>Preference fusion when the number of alternatives exceeds two: indirect scoring procedures: We consider the problem of aggregation of incomplete preferences represented by arbitrary binary relations or incomplete paired comparison matrices. For a number of indirect scoring procedures we examine wheth... | arxiv | @article{chebotarev2006preference,
title={Preference fusion when the number of alternatives exceeds two: indirect
scoring procedures},
author={Pavel Chebotarev and Elena Shamis},
journal={Journal of the Franklin Institute, 336 (1999), No.2, 205-226.
Erratum: 336 (1999) No.4, 747-748
(http://dx.doi.org... | chebotarev2006preference |
arxiv-676807 | math/0602282 | The Diffie-Hellman Key Exchange Protocol and non-abelian nilpotent groups | <|reference_start|>The Diffie-Hellman Key Exchange Protocol and non-abelian nilpotent groups: In this paper we study a key exchange protocol similar to Diffie-Hellman key exchange protocol using abelian subgroups of the automorphism group of a non-abelian nilpotent group. We also generalize group no.92 of Hall-Senior t... | arxiv | @article{mahalanobis2006the,
title={The Diffie-Hellman Key Exchange Protocol and non-abelian nilpotent
groups},
author={Ayan Mahalanobis},
journal={arXiv preprint arXiv:math/0602282},
year={2006},
archivePrefix={arXiv},
eprint={math/0602282},
primaryClass={math.GR cs.CR}
} | mahalanobis2006the |
arxiv-676808 | math/0602493 | The dimension of a variety | <|reference_start|>The dimension of a variety: We invent the notion of a {\it dimension of a variety} $V$ as the cardinality of all its proper {\it derived} subvarieties (of the same type). The dimensions of varieties of lattices, varieties of regular bands and other general algebraic structures are determined.<|refere... | arxiv | @article{graczyńska2006the,
title={The dimension of a variety},
author={Ewa Graczy'nska and Dietmar Schweigert},
journal={published in Discussiones Mathematicae, General Algebra and
Applications, 27, 2007, pp. 35--47},
year={2006},
archivePrefix={arXiv},
eprint={math/0602493},
primaryClass... | graczyńska2006the |
arxiv-676809 | math/0602505 | MDL Convergence Speed for Bernoulli Sequences | <|reference_start|>MDL Convergence Speed for Bernoulli Sequences: The Minimum Description Length principle for online sequence estimation/prediction in a proper learning setup is studied. If the underlying model class is discrete, then the total expected square loss is a particularly interesting performance measure: (a... | arxiv | @article{poland2006mdl,
title={MDL Convergence Speed for Bernoulli Sequences},
author={Jan Poland and Marcus Hutter},
journal={Statistics and Computing, 16 (2006) pages 161-175},
year={2006},
doi={10.1007/s11222-006-6746-3},
number={IDSIA-04-06},
archivePrefix={arXiv},
eprint={math/06025... | poland2006mdl |
arxiv-676810 | math/0602522 | Characterizations of scoring methods for preference aggregation | <|reference_start|>Characterizations of scoring methods for preference aggregation: The paper surveys more than forty characterizations of scoring methods for preference aggregation and contains one new result. A general scoring operator is {\it self-consistent} if alternative $i$ is assigned a greater score than $j$ w... | arxiv | @article{chebotarev2006characterizations,
title={Characterizations of scoring methods for preference aggregation},
author={Pavel Chebotarev and Elena Shamis},
journal={Annals of Operations Research, 1998. V. 80. P.299-332},
year={2006},
archivePrefix={arXiv},
eprint={math/0602522},
primaryCl... | chebotarev2006characterizations |
arxiv-676811 | math/0602552 | From Incomplete Preferences to Ranking via Optimization | <|reference_start|>From Incomplete Preferences to Ranking via Optimization: We consider methods for aggregating preferences that are based on the resolution of discrete optimization problems. The preferences are represented by arbitrary binary relations (possibly weighted) or incomplete paired comparison matrices. This... | arxiv | @article{chebotarev2006from,
title={From Incomplete Preferences to Ranking via Optimization},
author={Pavel Chebotarev and Elena Shamis},
journal={A version of this paper was published as: P.Yu.Chebotarev,
E.V.Shamis. Constructing an objective function for aggregating incomplete
preferences, In: A.Tangi... | chebotarev2006from |
arxiv-676812 | math/0602573 | The Forest Metrics for Graph Vertices | <|reference_start|>The Forest Metrics for Graph Vertices: We propose a new graph metric and study its properties. In contrast to the standard distance in connected graphs, it takes into account all paths between vertices. Formally, it is defined as d(i,j)=q_{ii}+q_{jj}-q_{ij}-q_{ji}, where q_{ij} is the (i,j)-entry of ... | arxiv | @article{chebotarev2006the,
title={The Forest Metrics for Graph Vertices},
author={Pavel Chebotarev and Elena Shamis},
journal={Electronic Notes in Discrete Mathematics 11 (July 2002) 98-107},
year={2006},
doi={10.1016/S1571-0653(04)00058-7},
archivePrefix={arXiv},
eprint={math/0602573},
... | chebotarev2006the |
arxiv-676813 | math/0602575 | Matrix-Forest Theorems | <|reference_start|>Matrix-Forest Theorems: The Laplacian matrix of a graph $G$ is $L(G)=D(G)-A(G)$, where $A(G)$ is the adjacency matrix and $D(G)$ is the diagonal matrix of vertex degrees. According to the Matrix-Tree Theorem, the number of spanning trees in $G$ is equal to any cofactor of an entry of $L(G)$. A rooted... | arxiv | @article{chebotarev2006matrix-forest,
title={Matrix-Forest Theorems},
author={Pavel Chebotarev and Elena Shamis},
journal={arXiv preprint arXiv:math/0602575},
year={2006},
archivePrefix={arXiv},
eprint={math/0602575},
primaryClass={math.CO cs.DM math.RA}
} | chebotarev2006matrix-forest |
arxiv-676814 | math/0603024 | Towards a better list of citation superstars: compiling a multidisciplinary list of highly cited researchers | <|reference_start|>Towards a better list of citation superstars: compiling a multidisciplinary list of highly cited researchers: A new approach to producing multidisciplinary lists of highly cited researchers is described and used for compiling a multidisciplinary list of highly cited researchers. This approach is esse... | arxiv | @article{podlubny2006towards,
title={Towards a better list of citation superstars: compiling a
multidisciplinary list of highly cited researchers},
author={Igor Podlubny, Katarina Kassayova},
journal={Research Evaluation, vol. 15, no. 3, December 2006, pp. 154-162},
year={2006},
archivePrefix={arX... | podlubny2006towards |
arxiv-676815 | math/0603155 | Vers une commande multivariable sans mod\`ele | <|reference_start|>Vers une commande multivariable sans mod\`ele: A control strategy without any precise mathematical model is derived for linear or nonlinear systems which are assumed to be finite-dimensional. Two convincing numerical simulations are provided.<|reference_end|> | arxiv | @article{fliess2006vers,
title={Vers une commande multivariable sans mod\`ele},
author={Michel Fliess (INRIA Futurs, LIX), C'edric Join (INRIA Futurs, CRAN),
Mamadou Mboup (INRIA Futurs), Hebertt Sira-Ramirez},
journal={Dans Conf\'erence internationale francophone d'automatique (CIFA
2006) (2006)},
... | fliess2006vers |
arxiv-676816 | math/0603207 | Fast matrix multiplication is stable | <|reference_start|>Fast matrix multiplication is stable: We perform forward error analysis for a large class of recursive matrix multiplication algorithms in the spirit of [D. Bini and G. Lotti, Stability of fast algorithms for matrix multiplication, Numer. Math. 36 (1980), 63--72]. As a consequence of our analysis, we... | arxiv | @article{demmel2006fast,
title={Fast matrix multiplication is stable},
author={James Demmel, Ioana Dumitriu, Olga Holtz, Robert Kleinberg},
journal={Numer. Math. 106 (2007), no. 2, 199-224},
year={2006},
doi={10.1007/s00211-007-0061-6},
archivePrefix={arXiv},
eprint={math/0603207},
prima... | demmel2006fast |
arxiv-676817 | math/0603248 | Computing the First Betti Numberand Describing the Connected Components of Semi-algebraic Sets | <|reference_start|>Computing the First Betti Numberand Describing the Connected Components of Semi-algebraic Sets: In this paper we describe a singly exponential algorithm for computing the first Betti number of a given semi-algebraic set. Singly exponential algorithms for computing the zero-th Betti number, and the Eu... | arxiv | @article{basu2006computing,
title={Computing the First Betti Numberand Describing the Connected Components
of Semi-algebraic Sets},
author={Saugata Basu, Richard Pollack, Marie-Francoise Roy},
journal={arXiv preprint arXiv:math/0603248},
year={2006},
archivePrefix={arXiv},
eprint={math/0603248... | basu2006computing |
arxiv-676818 | math/0603256 | An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions | <|reference_start|>An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions: We prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of semi-algebraically connected c... | arxiv | @article{basu2006an,
title={An asymptotically tight bound on the number of semi-algebraically
connected components of realizable sign conditions},
author={Saugata Basu, Richard Pollack, Marie-Francoise Roy},
journal={arXiv preprint arXiv:math/0603256},
year={2006},
archivePrefix={arXiv},
eprin... | basu2006an |
arxiv-676819 | math/0603262 | Computing the Top Betti Numbers of Semi-algebraic Sets Defined by Quadratic Inequalities in Polynomial Time | <|reference_start|>Computing the Top Betti Numbers of Semi-algebraic Sets Defined by Quadratic Inequalities in Polynomial Time: For any $\ell > 0$, we present an algorithm which takes as input a semi-algebraic set, $S$, defined by $P_1 \leq 0,...,P_s \leq 0$, where each $P_i \in \R[X_1,...,X_k]$ has degree $\leq 2,$ an... | arxiv | @article{basu2006computing,
title={Computing the Top Betti Numbers of Semi-algebraic Sets Defined by
Quadratic Inequalities in Polynomial Time},
author={Saugata Basu},
journal={arXiv preprint arXiv:math/0603262},
year={2006},
doi={10.1007/s10208-005-0208-8},
archivePrefix={arXiv},
eprint={... | basu2006computing |
arxiv-676820 | math/0603263 | Computing the First Few Betti Numbers of Semi-algebraic Sets in Single Exponential Time | <|reference_start|>Computing the First Few Betti Numbers of Semi-algebraic Sets in Single Exponential Time: In this paper we describe an algorithm that takes as input a description of a semi-algebraic set $S \subset \R^k$, defined by a Boolean formula with atoms of the form $P > 0, P < 0, P=0$ for $P \in {\mathcal P} \... | arxiv | @article{basu2006computing,
title={Computing the First Few Betti Numbers of Semi-algebraic Sets in Single
Exponential Time},
author={Saugata Basu},
journal={arXiv preprint arXiv:math/0603263},
year={2006},
archivePrefix={arXiv},
eprint={math/0603263},
primaryClass={math.AG cs.SC}
} | basu2006computing |
arxiv-676821 | math/0603606 | Lanczos $\tau$-method optimal algorithm in APS for approximating the mathematical functions | <|reference_start|>Lanczos $\tau$-method optimal algorithm in APS for approximating the mathematical functions: A new procedure is constructed by means of APS in APLAN language. The procedure solves the initial-value problem for linear differential equations of order $k$ with polynomial coefficients and regular singula... | arxiv | @article{denisenko2006lanczos,
title={Lanczos $\tau$-method optimal algorithm in APS for approximating the
mathematical functions},
author={P.N. Denisenko},
journal={arXiv preprint arXiv:math/0603606},
year={2006},
archivePrefix={arXiv},
eprint={math/0603606},
primaryClass={math.NA cs.MS m... | denisenko2006lanczos |
arxiv-676822 | math/0603727 | Spectral Analysis of Pollard Rho Collisions | <|reference_start|>Spectral Analysis of Pollard Rho Collisions: We show that the classical Pollard rho algorithm for discrete logarithms produces a collision in expected time O(sqrt(n)(log n)^3). This is the first nontrivial rigorous estimate for the collision probability for the unaltered Pollard rho graph, and is clo... | arxiv | @article{miller2006spectral,
title={Spectral Analysis of Pollard Rho Collisions},
author={Stephen D. Miller, Ramarathnam Venkatesan},
journal={arXiv preprint arXiv:math/0603727},
year={2006},
archivePrefix={arXiv},
eprint={math/0603727},
primaryClass={math.NT cs.CR cs.DM math.CO}
} | miller2006spectral |
arxiv-676823 | math/0604226 | A Dynamic View of Circular Colorings | <|reference_start|>A Dynamic View of Circular Colorings: The main contributions of this paper are three-fold. First, we use a dynamic approach based on Reiter's pioneering work on Karp-Miller computation graphs to give a new and short proof of Mohar's Minty-type Theorem. Second, we bridge circular colorings and discret... | arxiv | @article{yeh2006a,
title={A Dynamic View of Circular Colorings},
author={Hong-Gwa Yeh},
journal={arXiv preprint arXiv:math/0604226},
year={2006},
archivePrefix={arXiv},
eprint={math/0604226},
primaryClass={math.CO cs.DC cs.DM}
} | yeh2006a |
arxiv-676824 | math/0604233 | Generalization error bounds in semi-supervised classification under the cluster assumption | <|reference_start|>Generalization error bounds in semi-supervised classification under the cluster assumption: We consider semi-supervised classification when part of the available data is unlabeled. These unlabeled data can be useful for the classification problem when we make an assumption relating the behavior of th... | arxiv | @article{rigollet2006generalization,
title={Generalization error bounds in semi-supervised classification under the
cluster assumption},
author={Philippe Rigollet (PMA)},
journal={arXiv preprint arXiv:math/0604233},
year={2006},
archivePrefix={arXiv},
eprint={math/0604233},
primaryClass={m... | rigollet2006generalization |
arxiv-676825 | math/0604331 | On the reduction of a random basis | <|reference_start|>On the reduction of a random basis: For $g < n$, let $b\_1,...,b\_{n-g}$ be $n - g$ independent vectors in $\mathbb{R}^n$ with a common distribution invariant by rotation. Considering these vectors as a basis for the Euclidean lattice they generate, the aim of this paper is to provide asymptotic resu... | arxiv | @article{akhavi2006on,
title={On the reduction of a random basis},
author={Ali Akhavi (LIAFA), Jean-Franc{c}ois Marckert (LaBRI), Alain Rouault
(LM-Versailles)},
journal={arXiv preprint arXiv:math/0604331},
year={2006},
archivePrefix={arXiv},
eprint={math/0604331},
primaryClass={math.PR cs... | akhavi2006on |
arxiv-676826 | math/0604366 | The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels | <|reference_start|>The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels: We establish the exact threshold for the reconstruction problem for a binary asymmetric channel on the b-ary tree, provided that the asymmetry is sufficiently small. This is the first exact reconstruction threshold... | arxiv | @article{borgs2006the,
title={The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric
Binary Channels},
author={Christian Borgs, Jennifer Chayes, Elchanan Mossel, Sebastien Roch},
journal={arXiv preprint arXiv:math/0604366},
year={2006},
archivePrefix={arXiv},
eprint={math/060436... | borgs2006the |
arxiv-676827 | math/0604367 | Network Delay Inference from Additive Metrics | <|reference_start|>Network Delay Inference from Additive Metrics: We demonstrate the use of computational phylogenetic techniques to solve a central problem in inferential network monitoring. More precisely, we design a novel algorithm for multicast-based delay inference, i.e. the problem of reconstructing the topology... | arxiv | @article{bhamidi2006network,
title={Network Delay Inference from Additive Metrics},
author={Shankar Bhamidi, Ram Rajagopal, Sebastien Roch},
journal={arXiv preprint arXiv:math/0604367},
year={2006},
archivePrefix={arXiv},
eprint={math/0604367},
primaryClass={math.PR cs.DS cs.NI math.ST stat.... | bhamidi2006network |
arxiv-676828 | math/0604371 | Constructing Non-Computable Julia Sets | <|reference_start|>Constructing Non-Computable Julia Sets: We completely characterize the conformal radii of Siegel disks in the family $$P_\theta(z)=e^{2\pi i\theta}z+z^2,$$ corresponding to {\bf computable} parameters $\theta$. As a consequence, we constructively produce quadratic polynomials with {\bf non-computable... | arxiv | @article{braverman2006constructing,
title={Constructing Non-Computable Julia Sets},
author={Mark Braverman, Michael Yampolsky},
journal={arXiv preprint arXiv:math/0604371},
year={2006},
archivePrefix={arXiv},
eprint={math/0604371},
primaryClass={math.DS cs.CC}
} | braverman2006constructing |
arxiv-676829 | math/0604584 | Enumeration of non-orientable 3-manifolds using face pairing graphs and union-find | <|reference_start|>Enumeration of non-orientable 3-manifolds using face pairing graphs and union-find: Drawing together techniques from combinatorics and computer science, we improve the census algorithm for enumerating closed minimal P^2-irreducible 3-manifold triangulations. In particular, new constraints are proven ... | arxiv | @article{burton2006enumeration,
title={Enumeration of non-orientable 3-manifolds using face pairing graphs and
union-find},
author={Benjamin A. Burton},
journal={Discrete and Computational Geometry 38 (2007), no. 3, 527-571},
year={2006},
doi={10.1007/s00454-007-1307-x},
archivePrefix={arXiv},... | burton2006enumeration |
arxiv-676830 | math/0604611 | Variational optimization of probability measure spaces resolves the chain store paradox | <|reference_start|>Variational optimization of probability measure spaces resolves the chain store paradox: In game theory, players have continuous expected payoff functions and can use fixed point theorems to locate equilibria. This optimization method requires that players adopt a particular type of probability measu... | arxiv | @article{gagen2006variational,
title={Variational optimization of probability measure spaces resolves the
chain store paradox},
author={Michael J. Gagen and Kae Nemoto},
journal={arXiv preprint arXiv:math/0604611},
year={2006},
archivePrefix={arXiv},
eprint={math/0604611},
primaryClass={ma... | gagen2006variational |
arxiv-676831 | math/0605232 | Borne sur le degr\'e des polyn\^omes presque parfaitement non-lin\'eaires | <|reference_start|>Borne sur le degr\'e des polyn\^omes presque parfaitement non-lin\'eaires: The vectorial Boolean functions are employed in cryptography to build block coding algorithms. An important criterion on these functions is their resistance to the differential cryptanalysis. Nyberg defined the notion of almos... | arxiv | @article{rodier2006borne,
title={Borne sur le degr\'e des polyn\^omes presque parfaitement
non-lin\'eaires},
author={Franc{c}ois Rodier (IML)},
journal={arXiv preprint arXiv:math/0605232},
year={2006},
archivePrefix={arXiv},
eprint={math/0605232},
primaryClass={math.AG cs.CR}
} | rodier2006borne |
arxiv-676832 | math/0605242 | N-Fold Integer Programming | <|reference_start|>N-Fold Integer Programming: In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed {\em n-fold integer programming problems} are polynomial time solvable. Our proof involves two heavy ingredients discovered recently: the equivalence ... | arxiv | @article{de loera2006n-fold,
title={N-Fold Integer Programming},
author={Jes'us A. De Loera, Raymond Hemmecke, Shmuel Onn, Robert Weismantel},
journal={Discrete Optimization, 5:231--241, 2008},
year={2006},
archivePrefix={arXiv},
eprint={math/0605242},
primaryClass={math.OC cs.CC cs.DM math.... | de loera2006n-fold |
arxiv-676833 | math/0605334 | Gr\"obner Bases and Generation of Difference Schemes for Partial Differential Equations | <|reference_start|>Gr\"obner Bases and Generation of Difference Schemes for Partial Differential Equations: In this paper we present an algorithmic approach to the generation of fully conservative difference schemes for linear partial differential equations. The approach is based on enlargement of the equations in thei... | arxiv | @article{gerdt2006gr\"obner,
title={Gr\"obner Bases and Generation of Difference Schemes for Partial
Differential Equations},
author={Vladimir P. Gerdt, Yuri A. Blinkov and Vladimir V. Mozzhilkin},
journal={SIGMA 2 (2006), 051, 26 pages},
year={2006},
doi={10.3842/SIGMA.2006.051},
archivePrefi... | gerdt2006gr\"obner |
arxiv-676834 | math/0605472 | An algebraic approach to Polya processes | <|reference_start|>An algebraic approach to Polya processes: P\'olya processes are natural generalization of P\'olya-Eggenberger urn models. This article presents a new approach of their asymptotic behaviour {\it via} moments, based on the spectral decomposition of a suitable finite difference operator on polynomial fu... | arxiv | @article{pouyanne2006an,
title={An algebraic approach to Polya processes},
author={Nicolas Pouyanne (LM-Versailles)},
journal={Annales de l'IHP - Probabilit\'es et Statistiques (2008) Vol. 44,
No. 2, 293-323},
year={2006},
doi={10.1214/07-AIHP130},
archivePrefix={arXiv},
eprint={math/06054... | pouyanne2006an |
arxiv-676835 | math/0605498 | Cross-Entropic Learning of a Machine for the Decision in a Partially Observable Universe | <|reference_start|>Cross-Entropic Learning of a Machine for the Decision in a Partially Observable Universe: Revision of the paper previously entitled "Learning a Machine for the Decision in a Partially Observable Markov Universe" In this paper, we are interested in optimal decisions in a partially observable universe.... | arxiv | @article{dambreville2006cross-entropic,
title={Cross-Entropic Learning of a Machine for the Decision in a Partially
Observable Universe},
author={Frederic Dambreville (DGA/CTA/DT/GIP)},
journal={arXiv preprint arXiv:math/0605498},
year={2006},
archivePrefix={arXiv},
eprint={math/0605498},
... | dambreville2006cross-entropic |
arxiv-676836 | math/0605610 | Nonlinear Bipartite Matching | <|reference_start|>Nonlinear Bipartite Matching: We study the problem of optimizing nonlinear objective functions over bipartite matchings. While the problem is generally intractable, we provide several efficient algorithms for it, including a deterministic algorithm for maximizing convex objectives, approximative algo... | arxiv | @article{berstein2006nonlinear,
title={Nonlinear Bipartite Matching},
author={Yael Berstein and Shmuel Onn},
journal={Discrete Optimization, 5:53--65, 2008},
year={2006},
archivePrefix={arXiv},
eprint={math/0605610},
primaryClass={math.OC cs.CC cs.DM math.CO}
} | berstein2006nonlinear |
arxiv-676837 | math/0605740 | Sharp thresholds for high-dimensional and noisy recovery of sparsity | <|reference_start|>Sharp thresholds for high-dimensional and noisy recovery of sparsity: The problem of consistently estimating the sparsity pattern of a vector $\betastar \in \real^\mdim$ based on observations contaminated by noise arises in various contexts, including subset selection in regression, structure estimat... | arxiv | @article{wainwright2006sharp,
title={Sharp thresholds for high-dimensional and noisy recovery of sparsity},
author={Martin J. Wainwright},
journal={arXiv preprint arXiv:math/0605740},
year={2006},
archivePrefix={arXiv},
eprint={math/0605740},
primaryClass={math.ST cs.IT math.IT stat.TH}
} | wainwright2006sharp |
arxiv-676838 | math/0606022 | Imprimitive permutations groups generated by the round functions of key-alternating block ciphers and truncated differential cryptanalysis | <|reference_start|>Imprimitive permutations groups generated by the round functions of key-alternating block ciphers and truncated differential cryptanalysis: We answer a question of Paterson, showing that all block systems for the group generated by the round functions of a key-alternating block cipher are the transla... | arxiv | @article{caranti2006imprimitive,
title={Imprimitive permutations groups generated by the round functions of
key-alternating block ciphers and truncated differential cryptanalysis},
author={A. Caranti, F. Dalla Volta, M. Sala, F. Villani},
journal={arXiv preprint arXiv:math/0606022},
year={2006},
a... | caranti2006imprimitive |
arxiv-676839 | math/0606122 | Diagonal Peg Solitaire | <|reference_start|>Diagonal Peg Solitaire: We study the classical game of peg solitaire when diagonal jumps are allowed. We prove that on many boards, one can begin from a full board with one peg missing, and finish with one peg anywhere on the board. We then consider the problem of finding solutions that minimize the ... | arxiv | @article{bell2006diagonal,
title={Diagonal Peg Solitaire},
author={George I. Bell},
journal={INTEGERS: Electronic Journal of Combinatorial Number Theory 7
(2007) #G01},
year={2006},
archivePrefix={arXiv},
eprint={math/0606122},
primaryClass={math.CO cs.DM cs.DS}
} | bell2006diagonal |
arxiv-676840 | math/0606315 | Bayesian Regression of Piecewise Constant Functions | <|reference_start|>Bayesian Regression of Piecewise Constant Functions: We derive an exact and efficient Bayesian regression algorithm for piecewise constant functions of unknown segment number, boundary location, and levels. It works for any noise and segment level prior, e.g. Cauchy which can handle outliers. We deri... | arxiv | @article{hutter2006bayesian,
title={Bayesian Regression of Piecewise Constant Functions},
author={Marcus Hutter},
journal={arXiv preprint arXiv:math/0606315},
year={2006},
number={IDSIA-14-05},
archivePrefix={arXiv},
eprint={math/0606315},
primaryClass={math.ST cs.LG math.PR stat.TH}
} | hutter2006bayesian |
arxiv-676841 | math/0606643 | Entropy And Vision | <|reference_start|>Entropy And Vision: In vector quantization the number of vectors used to construct the codebook is always an undefined problem, there is always a compromise between the number of vectors and the quantity of information lost during the compression. In this text we present a minimum of Entropy principl... | arxiv | @article{kanhouche2006entropy,
title={Entropy And Vision},
author={Rami Kanhouche (CMLA)},
journal={arXiv preprint arXiv:math/0606643},
year={2006},
archivePrefix={arXiv},
eprint={math/0606643},
primaryClass={math.PR cs.CV cs.DB cs.DM cs.LG math.CO}
} | kanhouche2006entropy |
arxiv-676842 | math/0606734 | Codes in spherical caps | <|reference_start|>Codes in spherical caps: We consider bounds on codes in spherical caps and related problems in geometry and coding theory. An extension of the Delsarte method is presented that relates upper bounds on the size of spherical codes to upper bounds on codes in caps. Several new upper bounds on codes in c... | arxiv | @article{barg2006codes,
title={Codes in spherical caps},
author={Alexander Barg and Oleg R. Musin},
journal={Advances in Mathematics of Communications, vol. 1, no. 1, 2007,
131-149},
year={2006},
archivePrefix={arXiv},
eprint={math/0606734},
primaryClass={math.MG cs.IT math.IT}
} | barg2006codes |
arxiv-676843 | math/0606771 | Hard Instances of the Constrained Discrete Logarithm Problem | <|reference_start|>Hard Instances of the Constrained Discrete Logarithm Problem: The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent $x$ belongs to a set known to the attacker. The complexity of generic algorithms for solving the constrained DLP depends on the choice of th... | arxiv | @article{mironov2006hard,
title={Hard Instances of the Constrained Discrete Logarithm Problem},
author={Ilya Mironov, Anton Mityagin, Kobbi Nissim},
journal={In proceedings of 7th Algorithmic Number Theory Symposium (ANTS
VII), pages 582--598, 2006},
year={2006},
doi={10.1007/11792086_41},
arc... | mironov2006hard |
arxiv-676844 | math/0607051 | Discrete differential geometry of triangle tiles and algebra of closed trajectories | <|reference_start|>Discrete differential geometry of triangle tiles and algebra of closed trajectories: This paper proposes a new mathematical framework that can be applied to biological problems such as analysis of the structures of proteins and protein complexes. In particular, it gives a new method for encoding the ... | arxiv | @article{morikawa2006discrete,
title={Discrete differential geometry of triangle tiles and algebra of closed
trajectories},
author={Naoto Morikawa},
journal={arXiv preprint arXiv:math/0607051},
year={2006},
archivePrefix={arXiv},
eprint={math/0607051},
primaryClass={math.CO cs.DM math.MG}
... | morikawa2006discrete |
arxiv-676845 | math/0607071 | NP-completeness of 4-incidence colorability of semi-cubic graphs | <|reference_start|>NP-completeness of 4-incidence colorability of semi-cubic graphs: The incidence coloring conjecture, proposed by Brualdi and Massey in 1993, states that the incidence coloring number of every graph is at most ${\it \Delta}+2$, where ${\it \Delta}$ is the maximum degree of a graph. The conjecture was ... | arxiv | @article{li2006np-completeness,
title={NP-completeness of 4-incidence colorability of semi-cubic graphs},
author={Xueliang Li, Jianhua Tu},
journal={arXiv preprint arXiv:math/0607071},
year={2006},
archivePrefix={arXiv},
eprint={math/0607071},
primaryClass={math.CO cs.CC}
} | li2006np-completeness |
arxiv-676846 | math/0607088 | Odd minimum cut sets and b-matchings revisited | <|reference_start|>Odd minimum cut sets and b-matchings revisited: The famous Padberg-Rao separation algorithm for b-matching polyhedra can be implemented to run in O(n^2m log(n^2/m)) time in the uncapacitated case, and in O(nm^2 log(n^2/m)) time in the capacitated case (where n is the number of vertices and m is the n... | arxiv | @article{letchford2006odd,
title={Odd minimum cut sets and b-matchings revisited},
author={Adam N. Letchford and Dirk Oliver Theis},
journal={arXiv preprint arXiv:math/0607088},
year={2006},
archivePrefix={arXiv},
eprint={math/0607088},
primaryClass={math.OC cs.DM}
} | letchford2006odd |
arxiv-676847 | math/0607243 | An active curve approach for tomographic reconstruction of binary radially symmetric objects | <|reference_start|>An active curve approach for tomographic reconstruction of binary radially symmetric objects: This paper deals with a method of tomographic reconstruction of radially symmetric objects from a single radiograph, in order to study the behavior of shocked material. The usual tomographic reconstruction a... | arxiv | @article{abraham2006an,
title={An active curve approach for tomographic reconstruction of binary
radially symmetric objects},
author={Isabelle Abraham (DCRE), Romain Abraham (MAPMO), Maitine Bergounioux
(MAPMO)},
journal={arXiv preprint arXiv:math/0607243},
year={2006},
archivePrefix={arXiv},
... | abraham2006an |
arxiv-676848 | math/0607368 | The Newton Polytope of the Implicit Equation | <|reference_start|>The Newton Polytope of the Implicit Equation: We apply tropical geometry to study the image of a map defined by Laurent polynomials with generic coefficients. If this image is a hypersurface then our approach gives a construction of its Newton polytope.<|reference_end|> | arxiv | @article{sturmfels2006the,
title={The Newton Polytope of the Implicit Equation},
author={Bernd Sturmfels, Jenia Tevelev, Josephine Yu},
journal={Moscow Mathematical Journal 7 (2007), no. 2, 327--346, 351},
year={2006},
archivePrefix={arXiv},
eprint={math/0607368},
primaryClass={math.CO cs.SC... | sturmfels2006the |
arxiv-676849 | math/0607411 | Extending the scalars of minimizations | <|reference_start|>Extending the scalars of minimizations: In the classical theory of formal languages, finite state automata allow to recognize the words of a rational subset of $\Sigma^*$ where $\Sigma$ is a set of symbols (or the alphabet). Now, given a semiring $(\K,+,.)$, one can construct $\K$-subsets of $\Sigma^... | arxiv | @article{duchamp2006extending,
title={Extending the scalars of minimizations},
author={G'erard Duchamp (LIPN), Eric Laugerotte (LIFAR EA2655), Jean-Gabriel
Luque (IGM-LabInfo)},
journal={SCI, \'{E}tats-Unis d'Am\'{e}rique (2001)},
year={2006},
archivePrefix={arXiv},
eprint={math/0607411},
... | duchamp2006extending |
arxiv-676850 | math/0607412 | Direct and dual laws for automata with multiplicities | <|reference_start|>Direct and dual laws for automata with multiplicities: We present here theoretical results coming from the implementation of the package called AMULT (automata with multiplicities in several noncommutative variables). We show that classical formulas are ``almost every time'' optimal, characterize the... | arxiv | @article{duchamp2006direct,
title={Direct and dual laws for automata with multiplicities},
author={G'erard Duchamp (LIPN), Marianne Flouret (LIH EA3219), Eric
Laugerotte (LIFAR EA2655), Jean-Gabriel Luque (IGM-LabInfo)},
journal={Theoretical Computer Science 267 (2001) 105-120},
year={2006},
archi... | duchamp2006direct |
arxiv-676851 | math/0607420 | Transitive factorizations of free partially commutative monoids and Lie algebras | <|reference_start|>Transitive factorizations of free partially commutative monoids and Lie algebras: Let $\M(A,\theta)$ be a free partially commutative monoid. We give here a necessary and sufficient condition on a subalphabet $B\subset A$ such that the right factor of a bisection $\M(A,\theta)=\M(B,\theta\_B).T$ be al... | arxiv | @article{luque2006transitive,
title={Transitive factorizations of free partially commutative monoids and Lie
algebras},
author={Jean-Gabriel Luque (IGM-LabInfo), G'erard Henry Edmond Duchamp (LIPN)},
journal={Discrete Mathematics 246, Issue 1-3 (2002) 83 - 97},
year={2006},
archivePrefix={arXiv},
... | luque2006transitive |
arxiv-676852 | math/0607462 | De l'oprateur de trace dans les jeux de Conway | <|reference_start|>De l'oprateur de trace dans les jeux de Conway: In this report, we propose a game semantics model of intuitionistic linear logic with a notion of brackets and a trace operator. This model is a revised version of Conway games augmented with an algebraicly defined gain which enable to describe well bra... | arxiv | @article{tabareau2006de,
title={De l'oprateur de trace dans les jeux de Conway},
author={Nicolas Tabareau (PPS)},
journal={arXiv preprint arXiv:math/0607462},
year={2006},
archivePrefix={arXiv},
eprint={math/0607462},
primaryClass={math.CT cs.PL}
} | tabareau2006de |
arxiv-676853 | math/0607507 | In-Degree and PageRank of Web pages: Why do they follow similar power laws? | <|reference_start|>In-Degree and PageRank of Web pages: Why do they follow similar power laws?: The PageRank is a popularity measure designed by Google to rank Web pages. Experiments confirm that the PageRank obeys a `power law' with the same exponent as the In-Degree. This paper presents a novel mathematical model tha... | arxiv | @article{litvak2006in-degree,
title={In-Degree and PageRank of Web pages: Why do they follow similar power
laws?},
author={N. Litvak, W.R.W. Scheinhardt and Y. Volkovich},
journal={arXiv preprint arXiv:math/0607507},
year={2006},
number={Memorandum 1807, Dept. of Applied. Mathematics, University o... | litvak2006in-degree |
arxiv-676854 | math/0607597 | A Vortex Method for Bi-phasic Fluids Interacting with Rigid Bodies | <|reference_start|>A Vortex Method for Bi-phasic Fluids Interacting with Rigid Bodies: We present an accurate Lagrangian method based on vortex particles, level-sets, and immersed boundary methods, for animating the interplay between two fluids and rigid solids. We show that a vortex method is a good choice for simulat... | arxiv | @article{coquerelle2006a,
title={A Vortex Method for Bi-phasic Fluids Interacting with Rigid Bodies},
author={Mathieu Coquerelle (LMC - Imag, Gravir - Imag), J'er'emie Allard
(GRAVIR - Imag), Georges-Henri Cottet (LMC - Imag), Marie-Paule Cani (GRAVIR
- Imag)},
journal={arXiv preprint arXiv:math/0607597... | coquerelle2006a |
arxiv-676855 | math/0607648 | Singular Values and Eigenvalues of Tensors: A Variational Approach | <|reference_start|>Singular Values and Eigenvalues of Tensors: A Variational Approach: We propose a theory of eigenvalues, eigenvectors, singular values, and singular vectors for tensors based on a constrained variational approach much like the Rayleigh quotient for symmetric matrix eigenvalues. These notions are parti... | arxiv | @article{lim2006singular,
title={Singular Values and Eigenvalues of Tensors: A Variational Approach},
author={Lek-Heng Lim},
journal={Proceedings of the IEEE International Workshop on Computational
Advances in Multi-Sensor Adaptive Processing (CAMSAP '05), Vol. 1 (2005), pp.
129--132},
year={2006},
... | lim2006singular |
arxiv-676856 | math/0608116 | Conflict Free Rule for Combining Evidences | <|reference_start|>Conflict Free Rule for Combining Evidences: Recent works have investigated the problem of the conflict redistribution in the fusion rules of evidence theories. As a consequence of these works, many new rules have been proposed. Now, there is not a clear theoretical criterion for a choice of a rule in... | arxiv | @article{dambreville2006conflict,
title={Conflict Free Rule for Combining Evidences},
author={Frederic Dambreville (DGA/CEP/GIP/SRO)},
journal={arXiv preprint arXiv:math/0608116},
year={2006},
archivePrefix={arXiv},
eprint={math/0608116},
primaryClass={math.LO cs.LO math.ST stat.TH}
} | dambreville2006conflict |
arxiv-676857 | math/0608210 | Recognising the Suzuki groups in their natural representations | <|reference_start|>Recognising the Suzuki groups in their natural representations: Under the assumption of a certain conjecture, for which there exists strong experimental evidence, we produce an efficient algorithm for constructive membership testing in the Suzuki groups Sz(q), where q = 2^{2m + 1} for some m > 0, in ... | arxiv | @article{bäärnhielm2006recognising,
title={Recognising the Suzuki groups in their natural representations},
author={Henrik B"a"arnhielm},
journal={J. Algebra 300 (1), 171-198, 2006},
year={2006},
doi={10.1016/j.jalgebra.2006.02.010},
archivePrefix={arXiv},
eprint={math/0608210},
primaryC... | bäärnhielm2006recognising |
arxiv-676858 | math/0608522 | Graph Laplacians and their convergence on random neighborhood graphs | <|reference_start|>Graph Laplacians and their convergence on random neighborhood graphs: Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the submanifold. The graph Laplacian of such a graph is used... | arxiv | @article{hein2006graph,
title={Graph Laplacians and their convergence on random neighborhood graphs},
author={Matthias Hein, Jean-Yves Audibert and Ulrike von Luxburg},
journal={arXiv preprint arXiv:math/0608522},
year={2006},
archivePrefix={arXiv},
eprint={math/0608522},
primaryClass={math.... | hein2006graph |
arxiv-676859 | math/0608556 | On optimal quantization rules for some problems in sequential decentralized detection | <|reference_start|>On optimal quantization rules for some problems in sequential decentralized detection: We consider the design of systems for sequential decentralized detection, a problem that entails several interdependent choices: the choice of a stopping rule (specifying the sample size), a global decision functio... | arxiv | @article{nguyen2006on,
title={On optimal quantization rules for some problems in sequential
decentralized detection},
author={XuanLong Nguyen, Martin J. Wainwright, Michael I. Jordan},
journal={arXiv preprint arXiv:math/0608556},
year={2006},
doi={10.1109/TIT.2008.924647},
archivePrefix={arXiv... | nguyen2006on |
arxiv-676860 | math/0608571 | Intensional Models for the Theory of Types | <|reference_start|>Intensional Models for the Theory of Types: In this paper we define intensional models for the classical theory of types, thus arriving at an intensional type logic ITL. Intensional models generalize Henkin's general models and have a natural definition. As a class they do not validate the axiom of E... | arxiv | @article{muskens2006intensional,
title={Intensional Models for the Theory of Types},
author={Reinhard Muskens},
journal={arXiv preprint arXiv:math/0608571},
year={2006},
archivePrefix={arXiv},
eprint={math/0608571},
primaryClass={math.LO cs.AI}
} | muskens2006intensional |
arxiv-676861 | math/0608603 | Sequences with constant number of return words | <|reference_start|>Sequences with constant number of return words: An infinite word has the property $R_m$ if every factor has exactly $m$ return words. Vuillon showed that $R_2$ characterizes Sturmian words. We prove that a word satisfies $R_m$ if its complexity function is $(m-1)n+1$ and if it contains no weak bispec... | arxiv | @article{balkova2006sequences,
title={Sequences with constant number of return words},
author={Lubomira Balkova, Edita Pelantova, Wolfgang Steiner (LIAFA)},
journal={arXiv preprint arXiv:math/0608603},
year={2006},
archivePrefix={arXiv},
eprint={math/0608603},
primaryClass={math.CO cs.DM}
} | balkova2006sequences |
arxiv-676862 | math/0608713 | Occam's hammer: a link between randomized learning and multiple testing FDR control | <|reference_start|>Occam's hammer: a link between randomized learning and multiple testing FDR control: We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or more generally, a probability distribution on sa... | arxiv | @article{blanchard2006occam's,
title={Occam's hammer: a link between randomized learning and multiple testing
FDR control},
author={Gilles Blanchard (FHG FIRST.IDA), Franc{c}ois Fleuret (EPFL -- CVLAB)},
journal={arXiv preprint arXiv:math/0608713},
year={2006},
archivePrefix={arXiv},
eprint={m... | blanchard2006occam's |
arxiv-676863 | math/0608733 | Context for models of concurrency | <|reference_start|>Context for models of concurrency: Many categories have been used to model concurrency. Using any of these, the challenge is to reduce a given model to a smaller representation which nevertheless preserves the relevant computer-scientific information. That is, one wants to replace a given model with ... | arxiv | @article{bubenik2006context,
title={Context for models of concurrency},
author={Peter Bubenik},
journal={Electron. Notes Theor. Comput. Sci. 230 (2009) 3-21},
year={2006},
doi={10.1016/j.entcs.2009.02.014},
archivePrefix={arXiv},
eprint={math/0608733},
primaryClass={math.AT cs.DC}
} | bubenik2006context |
arxiv-676864 | math/0608789 | One method for proving inequalities by computer | <|reference_start|>One method for proving inequalities by computer: In this article we consider a method for proving a class of analytical inequalities via minimax rational approximations. All numerical calculations in this paper are given by Maple computer program.<|reference_end|> | arxiv | @article{malesevic2006one,
title={One method for proving inequalities by computer},
author={Branko J. Malesevic},
journal={arXiv preprint arXiv:math/0608789},
year={2006},
archivePrefix={arXiv},
eprint={math/0608789},
primaryClass={math.CA cs.GR cs.MS cs.NA math.GM math.NA}
} | malesevic2006one |
arxiv-676865 | math/0609360 | Minimal Polynomials for the Coordinates of the Harborth Graph | <|reference_start|>Minimal Polynomials for the Coordinates of the Harborth Graph: The Harborth graph is the smallest known example of a 4-regular planar unit-distance graph. In this paper we give an analytical description of the coordinates of its vertices for a particular embedding in the Euclidean plane. More precise... | arxiv | @article{gerbracht2006minimal,
title={Minimal Polynomials for the Coordinates of the Harborth Graph},
author={Eberhard H.-A. Gerbracht},
journal={arXiv preprint arXiv:math/0609360},
year={2006},
archivePrefix={arXiv},
eprint={math/0609360},
primaryClass={math.CO cs.SC}
} | gerbracht2006minimal |
arxiv-676866 | math/0609461 | Cross-Entropy method: convergence issues for extended implementation | <|reference_start|>Cross-Entropy method: convergence issues for extended implementation: The cross-entropy method (CE) developed by R. Rubinstein is an elegant practical principle for simulating rare events. The method approximates the probability of the rare event by means of a family of probabilistic models. The meth... | arxiv | @article{dambreville2006cross-entropy,
title={Cross-Entropy method: convergence issues for extended implementation},
author={Frederic Dambreville (DGA/CTA/DT/GIP)},
journal={arXiv preprint arXiv:math/0609461},
year={2006},
archivePrefix={arXiv},
eprint={math/0609461},
primaryClass={math.OC c... | dambreville2006cross-entropy |
arxiv-676867 | math/0609562 | On quadratic residue codes and hyperelliptic curves | <|reference_start|>On quadratic residue codes and hyperelliptic curves: A long standing problem has been to develop "good" binary linear codes to be used for error-correction. This paper investigates in some detail an attack on this problem using a connection between quadratic residue codes and hyperelliptic curves. On... | arxiv | @article{joyner2006on,
title={On quadratic residue codes and hyperelliptic curves},
author={David Joyner},
journal={arXiv preprint arXiv:math/0609562},
year={2006},
archivePrefix={arXiv},
eprint={math/0609562},
primaryClass={math.CO cs.IT math.AG math.IT math.NT}
} | joyner2006on |
arxiv-676868 | math/0610067 | On the context-freeness of the set of words containing overlaps | <|reference_start|>On the context-freeness of the set of words containing overlaps: We show that the set of binary words containing overlaps is not unambiguously context-free and that the set of ternary words containing overlaps is not context-free. We also show that the set of binary words that are not subwords of the... | arxiv | @article{rampersad2006on,
title={On the context-freeness of the set of words containing overlaps},
author={Narad Rampersad},
journal={arXiv preprint arXiv:math/0610067},
year={2006},
archivePrefix={arXiv},
eprint={math/0610067},
primaryClass={math.CO cs.FL}
} | rampersad2006on |
arxiv-676869 | math/0610121 | Fast Jacobian group operations for C_3,4 curves over a large finite field | <|reference_start|>Fast Jacobian group operations for C_3,4 curves over a large finite field: Let C be an arbitrary smooth algebraic curve of genus g over a large finite field K. We revisit fast addition algorithms in the Jacobian of C due to Khuri-Makdisi (math.NT/0409209, to appear in Math. Comp.). The algorithms, wh... | arxiv | @article{salem2006fast,
title={Fast Jacobian group operations for C_{3,4} curves over a large finite
field},
author={Fatima K. Abu Salem (Computer Science Department, American University
of Beirut) and Kamal Khuri-Makdisi (Center for Advanced Mathematical
Sciences, American University of Beirut)},
jou... | salem2006fast |
arxiv-676870 | math/0610184 | Adaptive Poisson disorder problem | <|reference_start|>Adaptive Poisson disorder problem: We study the quickest detection problem of a sudden change in the arrival rate of a Poisson process from a known value to an unknown and unobservable value at an unknown and unobservable disorder time. Our objective is to design an alarm time which is adapted to the... | arxiv | @article{bayraktar2006adaptive,
title={Adaptive Poisson disorder problem},
author={Erhan Bayraktar, Savas Dayanik, Ioannis Karatzas},
journal={Annals of Applied Probability 2006, Vol. 16, No. 3, 1190-1261},
year={2006},
doi={10.1214/105051606000000312},
number={IMS-AAP-AAP0171},
archivePrefi... | bayraktar2006adaptive |
arxiv-676871 | math/0610680 | Gaussian limits for multidimensional random sequential packing at saturation (extended version) | <|reference_start|>Gaussian limits for multidimensional random sequential packing at saturation (extended version): Consider the random sequential packing model with infinite input and in any dimension. When the input consists of non-zero volume convex solids we show that the total number of solids accepted over cubes ... | arxiv | @article{schreiber2006gaussian,
title={Gaussian limits for multidimensional random sequential packing at
saturation (extended version)},
author={T. Schreiber, Mathew D. Penrose and J. E. Yukich},
journal={arXiv preprint arXiv:math/0610680},
year={2006},
doi={10.1007/s00220-007-0218-2},
archive... | schreiber2006gaussian |
arxiv-676872 | math/0611194 | Directed animals in the gas | <|reference_start|>Directed animals in the gas: In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph together with a particle system that explains at the level of objects the formal link known be... | arxiv | @article{borgne2006directed,
title={Directed animals in the gas},
author={Yvan Le Borgne (LaBRI), Jean-Franc{c}ois Marckert (LaBRI)},
journal={arXiv preprint arXiv:math/0611194},
year={2006},
archivePrefix={arXiv},
eprint={math/0611194},
primaryClass={math.PR cs.DM}
} | borgne2006directed |
arxiv-676873 | math/0611422 | Cartes auto-organis\'ees pour l'analyse exploratoire de donn\'ees et la visualisation | <|reference_start|>Cartes auto-organis\'ees pour l'analyse exploratoire de donn\'ees et la visualisation: This paper shows how to use the Kohonen algorithm to represent multidimensional data, by exploiting the self-organizing property. It is possible to get such maps as well for quantitative variables as for qualitativ... | arxiv | @article{cottrell2006cartes,
title={Cartes auto-organis\'{e}es pour l'analyse exploratoire de donn\'{e}es et
la visualisation},
author={Marie Cottrell (MATISSE, Samos), Sma"Il Ibbou (MATISSE, Samos),
Patrick Letr'emy (MATISSE, Samos), Patrick Rousset (CEREQ)},
journal={Journal de la Soci\'{e}t\'{e} Fran... | cottrell2006cartes |
arxiv-676874 | math/0611433 | Working times in atypical forms of employment: the special case of part-time work | <|reference_start|>Working times in atypical forms of employment: the special case of part-time work: In the present article, we attempt to devise a typology of forms of part-time employment by applying a widely used neuronal methodology called Kohonen maps. Starting out with data that we describe using category-specif... | arxiv | @article{letrémy2006working,
title={Working times in atypical forms of employment: the special case of
part-time work},
author={Patrick Letr'emy (SAMOS), Marie Cottrell (SAMOS)},
journal={Connectionist Approaches in Economics and Management Sciences
Kluwer (Ed.) (2003) 111-129},
year={2006},
arc... | letrémy2006working |
arxiv-676875 | math/0611666 | Anomalous heat-kernel decay for random walk among bounded random conductances | <|reference_start|>Anomalous heat-kernel decay for random walk among bounded random conductances: We consider the nearest-neighbor simple random walk on $\Z^d$, $d\ge2$, driven by a field of bounded random conductances $\omega_{xy}\in[0,1]$. The conductance law is i.i.d. subject to the condition that the probability of... | arxiv | @article{berger2006anomalous,
title={Anomalous heat-kernel decay for random walk among bounded random
conductances},
author={Noam Berger, Marek Biskup, Christopher E. Hoffman, Gady Kozma},
journal={Ann. Inst. H. Poincare Probab. Statist. 274 (2008), no. 2, 374-392},
year={2006},
doi={10.1214/07-AI... | berger2006anomalous |
arxiv-676876 | math/0611679 | Longest Common Pattern between two Permutations | <|reference_start|>Longest Common Pattern between two Permutations: In this paper, we give a polynomial (O(n^8)) algorithm for finding a longest common pattern between two permutations of size n given that one is separable. We also give an algorithm for general permutations whose complexity depends on the length of the... | arxiv | @article{rossin2006longest,
title={Longest Common Pattern between two Permutations},
author={Dominique Rossin (LIAFA), Mathilde Bouvel (LIAFA)},
journal={Algebr. Geom. Topol. 7 (2007) 829-843},
year={2006},
doi={10.2140/agt.2007.7.829},
archivePrefix={arXiv},
eprint={math/0611679},
prima... | rossin2006longest |
arxiv-676877 | math/0611918 | Solving random equations in Garside groups using length functions | <|reference_start|>Solving random equations in Garside groups using length functions: We give a systematic exposition of memory-length algorithms for solving equations in noncommutative groups. This exposition clarifies some points untouched in earlier expositions. We then focus on the main ingredient in these attacks:... | arxiv | @article{hock2006solving,
title={Solving random equations in Garside groups using length functions},
author={Martin Hock and Boaz Tsaban},
journal={arXiv preprint arXiv:math/0611918},
year={2006},
archivePrefix={arXiv},
eprint={math/0611918},
primaryClass={math.GR cs.CR math.AG}
} | hock2006solving |
arxiv-676878 | math/0611937 | Remarks on Inheritance Systems | <|reference_start|>Remarks on Inheritance Systems: We try a conceptual analysis of inheritance diagrams, first in abstract terms, and then compare to "normality" and the "small/big sets" of preferential and related reasoning. The main ideas are about nodes as truth values and information sources, truth comparison by pa... | arxiv | @article{schlechta2006remarks,
title={Remarks on Inheritance Systems},
author={Karl Schlechta (LIF)},
journal={arXiv preprint arXiv:math/0611937},
year={2006},
archivePrefix={arXiv},
eprint={math/0611937},
primaryClass={math.LO cs.AI}
} | schlechta2006remarks |
arxiv-676879 | math/0612046 | On the Submodularity of Influence in Social Networks | <|reference_start|>On the Submodularity of Influence in Social Networks: We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where the nodes are individuals and the edges indicate a form of social r... | arxiv | @article{mossel2006on,
title={On the Submodularity of Influence in Social Networks},
author={Elchanan Mossel, Sebastien Roch},
journal={arXiv preprint arXiv:math/0612046},
year={2006},
archivePrefix={arXiv},
eprint={math/0612046},
primaryClass={math.PR cs.GT cs.SI}
} | mossel2006on |
arxiv-676880 | math/0612083 | Termination orders for 3-dimensional rewriting | <|reference_start|>Termination orders for 3-dimensional rewriting: This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource management is given, and the respective computational properties of each system are s... | arxiv | @article{guiraud2006termination,
title={Termination orders for 3-dimensional rewriting},
author={Yves Guiraud},
journal={Journal of Pure and Applied Algebra, Volume 207, Issue 2, October
2006, Pages 341-371},
year={2006},
doi={10.1016/j.jpaa.2005.10.011},
archivePrefix={arXiv},
eprint={mat... | guiraud2006termination |
arxiv-676881 | math/0612084 | Termination orders for 3-polygraphs | <|reference_start|>Termination orders for 3-polygraphs: This note presents the first known class of termination orders for 3-polygraphs, together with an application.<|reference_end|> | arxiv | @article{guiraud2006termination,
title={Termination orders for 3-polygraphs},
author={Yves Guiraud},
journal={Comptes-Rendus de l'Academie des Sciences Serie I, Volume 342,
Issue 4, 15 February 2006, Pages 219-222},
year={2006},
doi={10.1016/j.crma.2005.12.019},
archivePrefix={arXiv},
epri... | guiraud2006termination |
arxiv-676882 | math/0612088 | Two polygraphic presentations of Petri nets | <|reference_start|>Two polygraphic presentations of Petri nets: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first one sees places as generators of a commutative monoid and transitions as rewri... | arxiv | @article{guiraud2006two,
title={Two polygraphic presentations of Petri nets},
author={Yves Guiraud},
journal={Theoretical Computer Science, Volume 360, Issues 1-3, 21 August
2006, Pages 124-146},
year={2006},
doi={10.1016/j.tcs.2006.02.015},
archivePrefix={arXiv},
eprint={math/0612088},
... | guiraud2006two |
arxiv-676883 | math/0612089 | The three dimensions of proofs | <|reference_start|>The three dimensions of proofs: In this document, we study a 3-polygraphic translation for the proofs of SKS, a formal system for classical propositional logic. We prove that the free 3-category generated by this 3-polygraph describes the proofs of classical propositional logic modulo structural bure... | arxiv | @article{guiraud2006the,
title={The three dimensions of proofs},
author={Yves Guiraud},
journal={Annals of Pure and Applied Logic, Volume 141, Issues 1-2, August
2006, Pages 266-295},
year={2006},
doi={10.1016/j.apal.2005.12.012},
archivePrefix={arXiv},
eprint={math/0612089},
primaryCl... | guiraud2006the |
arxiv-676884 | math/0612264 | Fast linear algebra is stable | <|reference_start|>Fast linear algebra is stable: In an earlier paper, we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of $n$-by-$n$ matrices can be done by any algorithm in $O(n^{\omega + \eta})$ operations for any $\eta ... | arxiv | @article{demmel2006fast,
title={Fast linear algebra is stable},
author={James Demmel, Ioana Dumitriu, Olga Holtz},
journal={Numer. Math. 108 (2007), no. 1, 59-91},
year={2006},
doi={10.1007/s00211-007-0114-x},
archivePrefix={arXiv},
eprint={math/0612264},
primaryClass={math.NA cs.CC cs.D... | demmel2006fast |
arxiv-676885 | math/0612612 | The minimum size required of a solitaire army | <|reference_start|>The minimum size required of a solitaire army: The solitaire army is a one-person peg jumping game where a player attempts to advance an "army" of pegs as far as possible into empty territory. The game was introduced by John Conway and is also known as "Conway's Soldiers". We consider various general... | arxiv | @article{bell2006the,
title={The minimum size required of a solitaire army},
author={George I. Bell, Daniel S. Hirschberg, Pablo Guerrero-Garcia},
journal={INTEGERS: Electronic Journal of Combinatorial Number Theory 7
(2007) #G07},
year={2006},
archivePrefix={arXiv},
eprint={math/0612612},
... | bell2006the |
arxiv-676886 | math/0612682 | Convergence Speed in Distributed Consensus and Control | <|reference_start|>Convergence Speed in Distributed Consensus and Control: We study the convergence speed of distributed iterative algorithms for the consensus and averaging problems, with emphasis on the latter. We first consider the case of a fixed communication topology. We show that a simple adaptation of a consens... | arxiv | @article{olshevsky2006convergence,
title={Convergence Speed in Distributed Consensus and Control},
author={Alex Olshevsky, John N. Tsitsiklis},
journal={arXiv preprint arXiv:math/0612682},
year={2006},
archivePrefix={arXiv},
eprint={math/0612682},
primaryClass={math.OC cs.SY}
} | olshevsky2006convergence |
arxiv-676887 | math/0701020 | Some notes on a method for proving inequalities by computer | <|reference_start|>Some notes on a method for proving inequalities by computer: In this article we consider mathematical fundamentals of one method for proving inequalities by computer, based on the Remez algorithm. Using the well-known results of undecidability of the existence of zeros of real elementary functions, w... | arxiv | @article{banjac2006some,
title={Some notes on a method for proving inequalities by computer},
author={Bojan D. Banjac, Milica D. Makragic, Branko J. Malesevic},
journal={arXiv preprint arXiv:math/0701020},
year={2006},
doi={10.1007/s00025-015-0485-8},
archivePrefix={arXiv},
eprint={math/0701... | banjac2006some |
arxiv-676888 | math/0701102 | Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits | <|reference_start|>Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits: It is well known that R^N has subspaces of dimension proportional to N on which the \ell_1 norm is equivalent to the \ell_2 norm; however, no explicit constructions are known. Extending earlier work by Artstein--Avi... | arxiv | @article{lovett2007almost,
title={Almost Euclidean sections of the N-dimensional cross-polytope using O(N)
random bits},
author={Shachar Lovett and Sasha Sodin},
journal={Commun. Contemp. Math. 10 (2008), no. 4, 477--489.},
year={2007},
doi={10.1142/S0219199708002879},
archivePrefix={arXiv},
... | lovett2007almost |
arxiv-676889 | math/0701131 | Compressed Sensing and Redundant Dictionaries | <|reference_start|>Compressed Sensing and Redundant Dictionaries: This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, which is a composition of a random matrix of certain type and a deterministic d... | arxiv | @article{rauhut2007compressed,
title={Compressed Sensing and Redundant Dictionaries},
author={Holger Rauhut, Karin Schnass, Pierre Vandergheynst},
journal={IEEE Trans. Inform. Theory, 54(5):2210-2219, 2008},
year={2007},
doi={10.1109/TIT.2008.920190},
archivePrefix={arXiv},
eprint={math/0701... | rauhut2007compressed |
arxiv-676890 | math/0701142 | On the use of self-organizing maps to accelerate vector quantization | <|reference_start|>On the use of self-organizing maps to accelerate vector quantization: Self-organizing maps (SOM) are widely used for their topology preservation property: neighboring input vectors are quantified (or classified) either on the same location or on neighbor ones on a predefined grid. SOM are also widely... | arxiv | @article{de bodt2007on,
title={On the use of self-organizing maps to accelerate vector quantization},
author={Eric De Bodt (ESA, Iag-Fin, Dice), Marie Cottrell (MATISSE, Samos),
Patrick Letr'emy (MATISSE, Samos), Michel Verleysen (DICE)},
journal={Neurocomputing 56 (2004) 187-203},
year={2007},
do... | de bodt2007on |
arxiv-676891 | math/0701144 | Statistical tools to assess the reliability of self-organizing maps | <|reference_start|>Statistical tools to assess the reliability of self-organizing maps: Results of neural network learning are always subject to some variability, due to the sensitivity to initial conditions, to convergence to local minima, and, sometimes more dramatically, to sampling variability. This paper presents ... | arxiv | @article{de bodt2007statistical,
title={Statistical tools to assess the reliability of self-organizing maps},
author={Eric De Bodt (ESA, Iag-Fin), Marie Cottrell (SAMOS, Matisse), Michel
Verleysen (DICE)},
journal={Neural Networks 15, 8-9 (2002) 967-978},
year={2007},
archivePrefix={arXiv},
ep... | de bodt2007statistical |
arxiv-676892 | math/0701145 | Bootstrap for neural model selection | <|reference_start|>Bootstrap for neural model selection: Bootstrap techniques (also called resampling computation techniques) have introduced new advances in modeling and model evaluation. Using resampling methods to construct a series of new samples which are based on the original data set, allows to estimate the stab... | arxiv | @article{kallel2007bootstrap,
title={Bootstrap for neural model selection},
author={Riadh Kallel (MATISSE, Samos), Marie Cottrell (MATISSE, Samos),
Vincent Vigneron (MATISSE, Samos)},
journal={Neurocomputing 48 (2002) 175-183},
year={2007},
doi={10.1016/S0925-2312(01)00650-6},
archivePrefix={a... | kallel2007bootstrap |
arxiv-676893 | math/0701152 | Missing values : processing with the Kohonen algorithm | <|reference_start|>Missing values : processing with the Kohonen algorithm: The processing of data which contain missing values is a complicated and always awkward problem, when the data come from real-world contexts. In applications, we are very often in front of observations for which all the values are not available,... | arxiv | @article{cottrell2007missing,
title={Missing values : processing with the Kohonen algorithm},
author={Marie Cottrell (MATISSE, Samos), Patrick Letr'emy (MATISSE, Samos)},
journal={Dans ASMDA 2005 CD-ROM Proceedings - ASMDA 2005, Brest : France
(2005)},
year={2007},
archivePrefix={arXiv},
eprin... | cottrell2007missing |
arxiv-676894 | math/0701261 | Tracking Stopping Times Through Noisy Observations | <|reference_start|>Tracking Stopping Times Through Noisy Observations: A novel quickest detection setting is proposed which is a generalization of the well-known Bayesian change-point detection model. Suppose \{(X_i,Y_i)\}_{i\geq 1} is a sequence of pairs of random variables, and that S is a stopping time with respect ... | arxiv | @article{niesen2007tracking,
title={Tracking Stopping Times Through Noisy Observations},
author={Urs Niesen, Aslan Tchamkerten},
journal={IEEE Transactions on Information Theory, vol. 55, pp. 422-432,
January 2009},
year={2007},
doi={10.1109/TIT.2008.2008115},
archivePrefix={arXiv},
eprint... | niesen2007tracking |
arxiv-676895 | math/0701419 | Strategies for prediction under imperfect monitoring | <|reference_start|>Strategies for prediction under imperfect monitoring: We propose simple randomized strategies for sequential prediction under imperfect monitoring, that is, when the forecaster does not have access to the past outcomes but rather to a feedback signal. The proposed strategies are consistent in the sen... | arxiv | @article{lugosi2007strategies,
title={Strategies for prediction under imperfect monitoring},
author={Gabor Lugosi, Shie Mannor, Gilles Stoltz (DMA)},
journal={Mathematics of Operations Research (2008) \`a para\^itre},
year={2007},
archivePrefix={arXiv},
eprint={math/0701419},
primaryClass={m... | lugosi2007strategies |
arxiv-676896 | math/0701647 | Counting non-isomorphic maximal independent sets of the n-cycle graph | <|reference_start|>Counting non-isomorphic maximal independent sets of the n-cycle graph: The number of maximal independent sets of the n-cycle graph C_n is known to be the nth term of the Perrin sequence. The action of the automorphism group of C_n on the family of these maximal independent sets partitions this family... | arxiv | @article{bisdorff2007counting,
title={Counting non-isomorphic maximal independent sets of the n-cycle graph},
author={Raymond Bisdorff, Jean-Luc Marichal},
journal={Journal of Integer Sequences 11 (5) (2008), Article 08.5.7},
year={2007},
archivePrefix={arXiv},
eprint={math/0701647},
primary... | bisdorff2007counting |
arxiv-676897 | math/0701791 | Linear versus Non-linear Acquisition of Step-Functions | <|reference_start|>Linear versus Non-linear Acquisition of Step-Functions: We address in this paper the following two closely related problems: 1. How to represent functions with singularities (up to a prescribed accuracy) in a compact way? 2. How to reconstruct such functions from a small number of measurements? ... | arxiv | @article{ettinger2007linear,
title={Linear versus Non-linear Acquisition of Step-Functions},
author={Boris Ettinger, Niv Sarig, Yosef Yomdin},
journal={arXiv preprint arXiv:math/0701791},
year={2007},
archivePrefix={arXiv},
eprint={math/0701791},
primaryClass={math.CA cs.CV}
} | ettinger2007linear |
arxiv-676898 | math/0701801 | Deterministic modal Bayesian Logic: derive the Bayesian inference within the modal logic T | <|reference_start|>Deterministic modal Bayesian Logic: derive the Bayesian inference within the modal logic T: In this paper a conditional logic is defined and studied. This conditional logic, DmBL, is constructed as a deterministic counterpart to the Bayesian conditional. The logic is unrestricted, so that any logical... | arxiv | @article{dambreville2007deterministic,
title={Deterministic modal Bayesian Logic: derive the Bayesian inference within
the modal logic T},
author={Frederic Dambreville (DGA/CTA/DT/GIP)},
journal={arXiv preprint arXiv:math/0701801},
year={2007},
archivePrefix={arXiv},
eprint={math/0701801},
... | dambreville2007deterministic |
arxiv-676899 | math/0701904 | Noncomputable Spectral Sets | <|reference_start|>Noncomputable Spectral Sets: It is possible to enumerate all computer programs. In particular, for every partial computable function, there is a shortest program which computes that function. f-MIN is the set of indices for shortest programs. In 1972, Meyer showed that f-MIN is Turing equivalent to 0... | arxiv | @article{teutsch2007noncomputable,
title={Noncomputable Spectral Sets},
author={Jason Teutsch},
journal={arXiv preprint arXiv:math/0701904},
year={2007},
archivePrefix={arXiv},
eprint={math/0701904},
primaryClass={math.LO cs.LO}
} | teutsch2007noncomputable |
arxiv-676900 | math/0702109 | Longest Common Separable Pattern between Permutations | <|reference_start|>Longest Common Separable Pattern between Permutations: In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input permutations is fixed and show that the problem is NP-hard for an arb... | arxiv | @article{bouvel2007longest,
title={Longest Common Separable Pattern between Permutations},
author={Mathilde Bouvel (LIAFA), Dominique Rossin (LIAFA), Stephane Vialette
(LRI)},
journal={Combinatorial Pattern Matching (CPM) 2007 (2007) 00},
year={2007},
archivePrefix={arXiv},
eprint={math/070210... | bouvel2007longest |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.