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-1001 | 0708.2456 | On the subset sum problem over finite fields | <|reference_start|>On the subset sum problem over finite fields: The subset sum problem over finite fields is a well-known {\bf NP}-complete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study the number of solutions of the subset sum problem from a mathematical point of v... | arxiv | @article{li2007on,
title={On the subset sum problem over finite fields},
author={Jiyou Li and Daqing Wan},
journal={arXiv preprint arXiv:0708.2456},
year={2007},
archivePrefix={arXiv},
eprint={0708.2456},
primaryClass={math.NT cs.IT math.IT}
} | li2007on |
arxiv-1002 | 0708.2462 | Eigenvalue bounds on the pseudocodeword weight of expander codes | <|reference_start|>Eigenvalue bounds on the pseudocodeword weight of expander codes: Four different ways of obtaining low-density parity-check codes from expander graphs are considered. For each case, lower bounds on the minimum stopping set size and the minimum pseudocodeword weight of expander (LDPC) codes are derive... | arxiv | @article{kelley2007eigenvalue,
title={Eigenvalue bounds on the pseudocodeword weight of expander codes},
author={Christine A. Kelley and Deepak Sridhara},
journal={Journal on Advances of Mathematics of Communications, vol. 1, no.
3, pp. 287 -- 307, Aug. 2007},
year={2007},
archivePrefix={arXiv},
... | kelley2007eigenvalue |
arxiv-1003 | 0708.2514 | Minimum Cost Homomorphisms to Reflexive Digraphs | <|reference_start|>Minimum Cost Homomorphisms to Reflexive Digraphs: For digraphs $G$ and $H$, a homomorphism of $G$ to $H$ is a mapping $f:\ V(G)\dom V(H)$ such that $uv\in A(G)$ implies $f(u)f(v)\in A(H)$. If moreover each vertex $u \in V(G)$ is associated with costs $c_i(u), i \in V(H)$, then the cost of a homomorph... | arxiv | @article{gupta2007minimum,
title={Minimum Cost Homomorphisms to Reflexive Digraphs},
author={Arvind Gupta, Pavol Hell, Mehdi Karimi, Arash Rafiey},
journal={arXiv preprint arXiv:0708.2514},
year={2007},
archivePrefix={arXiv},
eprint={0708.2514},
primaryClass={cs.DM cs.CC}
} | gupta2007minimum |
arxiv-1004 | 0708.2544 | On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive Multipartite Tournaments | <|reference_start|>On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive Multipartite Tournaments: For digraphs $D$ and $H$, a mapping $f: V(D)\dom V(H)$ is a homomorphism of $D$ to $H$ if $uv\in A(D)$ implies $f(u)f(v)\in A(H).$ For a fixed digraph $H$, the homomorphism problem is to decide whether ... | arxiv | @article{gutin2007on,
title={On the Complexity of the Minimum Cost Homomorphism Problem for Reflexive
Multipartite Tournaments},
author={G. Gutin and E.J. Kim},
journal={arXiv preprint arXiv:0708.2544},
year={2007},
archivePrefix={arXiv},
eprint={0708.2544},
primaryClass={cs.DM cs.DS}
} | gutin2007on |
arxiv-1005 | 0708.2545 | Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops | <|reference_start|>Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops: For digraphs $D$ and $H$, a mapping $f: V(D)\dom V(H)$ is a homomorphism of $D$ to $H$ if $uv\in A(D)$ implies $f(u)f(v)\in A(H).$ For a fixed digraph $H$, the homomorphism problem is to decide whether ... | arxiv | @article{kim2007complexity,
title={Complexity of the Minimum Cost Homomorphism Problem for Semicomplete
Digraphs with Possible Loops},
author={E.J. Kim and G. Gutin},
journal={arXiv preprint arXiv:0708.2545},
year={2007},
archivePrefix={arXiv},
eprint={0708.2545},
primaryClass={cs.DM cs.DS... | kim2007complexity |
arxiv-1006 | 0708.2566 | Discrete Denoising with Shifts | <|reference_start|>Discrete Denoising with Shifts: We introduce S-DUDE, a new algorithm for denoising DMC-corrupted data. The algorithm, which generalizes the recently introduced DUDE (Discrete Universal DEnoiser) of Weissman et al., aims to compete with a genie that has access, in addition to the noisy data, also to t... | arxiv | @article{moon2007discrete,
title={Discrete Denoising with Shifts},
author={Taesup Moon, Tsachy Weissman},
journal={arXiv preprint arXiv:0708.2566},
year={2007},
doi={10.1109/TIT.2009.2030461},
archivePrefix={arXiv},
eprint={0708.2566},
primaryClass={cs.IT math.IT}
} | moon2007discrete |
arxiv-1007 | 0708.2571 | On the Security of the Cha-Ko-Lee-Han-Cheon Braid Group Public Key Cryptosystem | <|reference_start|>On the Security of the Cha-Ko-Lee-Han-Cheon Braid Group Public Key Cryptosystem: We show that a number of cryptographic protocols using non-commutative semigroups including the Cha-Ko-Lee-Han-Cheon braid group public-key cryptosystem and related public-key cryptosystems such as the Shpilrain-Ushakov ... | arxiv | @article{chowdhury2007on,
title={On the Security of the Cha-Ko-Lee-Han-Cheon Braid Group Public Key
Cryptosystem},
author={M. M. Chowdhury},
journal={arXiv preprint arXiv:0708.2571},
year={2007},
archivePrefix={arXiv},
eprint={0708.2571},
primaryClass={cs.CR}
} | chowdhury2007on |
arxiv-1008 | 0708.2575 | Rateless Coding for Gaussian Channels | <|reference_start|>Rateless Coding for Gaussian Channels: A rateless code-i.e., a rate-compatible family of codes-has the property that codewords of the higher rate codes are prefixes of those of the lower rate ones. A perfect family of such codes is one in which each of the codes in the family is capacity-achieving. W... | arxiv | @article{erez2007rateless,
title={Rateless Coding for Gaussian Channels},
author={Uri Erez, Mitchell D. Trott and Gregory W. Wornell},
journal={arXiv preprint arXiv:0708.2575},
year={2007},
archivePrefix={arXiv},
eprint={0708.2575},
primaryClass={cs.IT math.IT}
} | erez2007rateless |
arxiv-1009 | 0708.2584 | Claw Finding Algorithms Using Quantum Walk | <|reference_start|>Claw Finding Algorithms Using Quantum Walk: The claw finding problem has been studied in terms of query complexity as one of the problems closely connected to cryptography. For given two functions, f and g, as an oracle which have domains of size N and M (N<=M), respectively, and the same range, the ... | arxiv | @article{tani2007claw,
title={Claw Finding Algorithms Using Quantum Walk},
author={Seiichiro Tani},
journal={Theoretical Computer Science, 410(50): 5285-5297 (2009)},
year={2007},
doi={10.1016/j.tcs.2009.08.030},
archivePrefix={arXiv},
eprint={0708.2584},
primaryClass={quant-ph cs.CC}
} | tani2007claw |
arxiv-1010 | 0708.2616 | An Experimental Investigation of Secure Communication With Chaos Masking | <|reference_start|>An Experimental Investigation of Secure Communication With Chaos Masking: The most exciting recent development in nonlinear dynamics is realization that chaos can be useful. One application involves "Secure Communication". Two piecewise linear systems with switching nonlinearities have been taken as ... | arxiv | @article{dhar2007an,
title={An Experimental Investigation of Secure Communication With Chaos Masking},
author={Sourav Dhar and Kabir Chakraborty},
journal={arXiv preprint arXiv:0708.2616},
year={2007},
archivePrefix={arXiv},
eprint={0708.2616},
primaryClass={cs.CR}
} | dhar2007an |
arxiv-1011 | 0708.2668 | Zone and double zone diagrams in abstract spaces | <|reference_start|>Zone and double zone diagrams in abstract spaces: A zone diagram is a relatively new concept which was first defined and studied by T. Asano, J. Matousek and T. Tokuyama. It can be interpreted as a state of equilibrium between several mutually hostile kingdoms. Formally, it is a fixed point of a cert... | arxiv | @article{reem2007zone,
title={Zone and double zone diagrams in abstract spaces},
author={Daniel Reem, Simeon Reich},
journal={Colloquium Mathematicum 115 (2009), 129-145},
year={2007},
doi={10.4064/cm115-1-11},
archivePrefix={arXiv},
eprint={0708.2668},
primaryClass={math.MG cs.CG math.C... | reem2007zone |
arxiv-1012 | 0708.2686 | The universal evolutionary computer based on super-recursive algorithms of evolvability | <|reference_start|>The universal evolutionary computer based on super-recursive algorithms of evolvability: This work exposes which mechanisms and procesess in the Nature of evolution compute a function not computable by Turing machine. The computer with intelligence that is not higher than one bacteria population coul... | arxiv | @article{roglic2007the,
title={The universal evolutionary computer based on super-recursive algorithms
of evolvability},
author={D. Roglic},
journal={arXiv preprint arXiv:0708.2686},
year={2007},
archivePrefix={arXiv},
eprint={0708.2686},
primaryClass={cs.NE}
} | roglic2007the |
arxiv-1013 | 0708.2717 | Aggregation Languages for Moving Object and Places of Interest Data | <|reference_start|>Aggregation Languages for Moving Object and Places of Interest Data: We address aggregate queries over GIS data and moving object data, where non-spatial data are stored in a data warehouse. We propose a formal data model and query language to express complex aggregate queries. Next, we study the com... | arxiv | @article{gomez2007aggregation,
title={Aggregation Languages for Moving Object and Places of Interest Data},
author={Leticia Gomez, Bart Kuijpers, Alejandro Vaisman},
journal={arXiv preprint arXiv:0708.2717},
year={2007},
archivePrefix={arXiv},
eprint={0708.2717},
primaryClass={cs.DB}
} | gomez2007aggregation |
arxiv-1014 | 0708.2732 | Secrecy Capacity Region of Binary and Gaussian Multiple Access Channels | <|reference_start|>Secrecy Capacity Region of Binary and Gaussian Multiple Access Channels: A generalized multiple access channel (GMAC) with one confidential message set is studied, where two users (users 1 and 2) attempt to transmit common information to a destination, and user 1 also has confidential information int... | arxiv | @article{liang2007secrecy,
title={Secrecy Capacity Region of Binary and Gaussian Multiple Access Channels},
author={Yingbin Liang and H. Vincent Poor},
journal={arXiv preprint arXiv:0708.2732},
year={2007},
archivePrefix={arXiv},
eprint={0708.2732},
primaryClass={cs.IT math.IT}
} | liang2007secrecy |
arxiv-1015 | 0708.2733 | Secure Communications over Fading Channels | <|reference_start|>Secure Communications over Fading Channels: The fading wire-tap channel is investigated, where the source-to-destination channel and the source-to-wire-tapper channel are corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel state information i... | arxiv | @article{liang2007secure,
title={Secure Communications over Fading Channels},
author={Yingbin Liang and H. Vincent Poor},
journal={arXiv preprint arXiv:0708.2733},
year={2007},
archivePrefix={arXiv},
eprint={0708.2733},
primaryClass={cs.IT math.IT}
} | liang2007secure |
arxiv-1016 | 0708.2784 | On a linear code from a configuration of affine lines | <|reference_start|>On a linear code from a configuration of affine lines: We will show how to obtain a linear code from a configuration of affine lines in general position and a suitable set of rational points. We will also explain a new decoding algorithm based on the configuration, which seems to be quite effective.<... | arxiv | @article{sugiyama2007on,
title={On a linear code from a configuration of affine lines},
author={Ken-ichi Sugiyama},
journal={arXiv preprint arXiv:0708.2784},
year={2007},
archivePrefix={arXiv},
eprint={0708.2784},
primaryClass={cs.IT cs.DM math.AG math.IT}
} | sugiyama2007on |
arxiv-1017 | 0708.2788 | Integrating users' needs into multimedia information retrieval system | <|reference_start|>Integrating users' needs into multimedia information retrieval system: The exponential growth of multimedia information and the development of various communication media generated new problems at various levels including the rate of flow of information, problems of storage and management. The diffic... | arxiv | @article{maghrebi2007integrating,
title={Integrating users' needs into multimedia information retrieval system},
author={Han`ene Maghrebi (LORIA), Amos David (LORIA)},
journal={Dans Third international conference on computer (2007)},
year={2007},
archivePrefix={arXiv},
eprint={0708.2788},
pr... | maghrebi2007integrating |
arxiv-1018 | 0708.2804 | On Fast-Decodable Space-Time Block Codes | <|reference_start|>On Fast-Decodable Space-Time Block Codes: We focus on full-rate, fast-decodable space-time block codes (STBCs) for 2x2 and 4x2 multiple-input multiple-output (MIMO) transmission. We first derive conditions for reduced-complexity maximum-likelihood decoding, and apply them to a unified analysis of two... | arxiv | @article{biglieri2007on,
title={On Fast-Decodable Space-Time Block Codes},
author={Ezio Biglieri, Yi Hong, Emanuele Viterbo},
journal={arXiv preprint arXiv:0708.2804},
year={2007},
archivePrefix={arXiv},
eprint={0708.2804},
primaryClass={cs.IT math.IT}
} | biglieri2007on |
arxiv-1019 | 0708.2843 | The Impossibility Of Secure Two-Party Classical Computation | <|reference_start|>The Impossibility Of Secure Two-Party Classical Computation: We present attacks that show that unconditionally secure two-party classical computation is impossible for many classes of function. Our analysis applies to both quantum and relativistic protocols. We illustrate our results by showing the i... | arxiv | @article{colbeck2007the,
title={The Impossibility Of Secure Two-Party Classical Computation},
author={Roger Colbeck},
journal={Physical Review A 76, 062308 (2007)},
year={2007},
doi={10.1103/PhysRevA.76.062308},
archivePrefix={arXiv},
eprint={0708.2843},
primaryClass={quant-ph cs.CR}
} | colbeck2007the |
arxiv-1020 | 0708.2854 | Algorithmic Semi-algebraic Geometry and Topology -- Recent Progress and Open Problems | <|reference_start|>Algorithmic Semi-algebraic Geometry and Topology -- Recent Progress and Open Problems: We give a survey of algorithms for computing topological invariants of semi-algebraic sets with special emphasis on the more recent developments in designing algorithms for computing the Betti numbers of semi-algeb... | arxiv | @article{basu2007algorithmic,
title={Algorithmic Semi-algebraic Geometry and Topology -- Recent Progress and
Open Problems},
author={Saugata Basu},
journal={arXiv preprint arXiv:0708.2854},
year={2007},
archivePrefix={arXiv},
eprint={0708.2854},
primaryClass={math.GT cs.CC cs.CG math.AG ma... | basu2007algorithmic |
arxiv-1021 | 0708.2893 | Fast Recursive Coding Based on Grouping of Symbols | <|reference_start|>Fast Recursive Coding Based on Grouping of Symbols: A novel fast recursive coding technique is proposed. It operates with only integer values not longer 8 bits and is multiplication free. Recursion the algorithm is based on indirectly provides rather effective coding of symbols for very large alphabe... | arxiv | @article{ponomarenko2007fast,
title={Fast Recursive Coding Based on Grouping of Symbols},
author={Nikolay Ponomarenko, Vladimir Lukin, Karen Egiazarian, Jaakko Astola,
Boris Y Ryabko},
journal={arXiv preprint arXiv:0708.2893},
year={2007},
archivePrefix={arXiv},
eprint={0708.2893},
primary... | ponomarenko2007fast |
arxiv-1022 | 0708.2911 | Optimal Sequential Frame Synchronization | <|reference_start|>Optimal Sequential Frame Synchronization: We consider the `one-shot frame synchronization problem' where a decoder wants to locate a sync pattern at the output of a channel on the basis of sequential observations. We assume that the sync pattern of length N starts being emitted at a random time withi... | arxiv | @article{chandar2007optimal,
title={Optimal Sequential Frame Synchronization},
author={Venkat Chandar, Aslan Tchamkerten, Gregory Wornell},
journal={arXiv preprint arXiv:0708.2911},
year={2007},
archivePrefix={arXiv},
eprint={0708.2911},
primaryClass={cs.IT math.IT}
} | chandar2007optimal |
arxiv-1023 | 0708.2936 | Priority Queue Based on Multilevel Prefix Tree | <|reference_start|>Priority Queue Based on Multilevel Prefix Tree: Tree structures are very often used data structures. Among ordered types of trees there are many variants whose basic operations such as insert, delete, search, delete-min are characterized by logarithmic time complexity. In the article I am going to pr... | arxiv | @article{planeta2007priority,
title={Priority Queue Based on Multilevel Prefix Tree},
author={David S. Planeta},
journal={arXiv preprint arXiv:0708.2936},
year={2007},
number={TR2006-2023},
archivePrefix={arXiv},
eprint={0708.2936},
primaryClass={cs.DS}
} | planeta2007priority |
arxiv-1024 | 0708.2974 | The Fuzzy Vault for fingerprints is Vulnerable to Brute Force Attack | <|reference_start|>The Fuzzy Vault for fingerprints is Vulnerable to Brute Force Attack: The \textit{fuzzy vault} approach is one of the best studied and well accepted ideas for binding cryptographic security into biometric authentication. The vault has been implemented in connection with fingerprint data by Uludag and... | arxiv | @article{mihailescu2007the,
title={The Fuzzy Vault for fingerprints is Vulnerable to Brute Force Attack},
author={Preda Mihailescu},
journal={arXiv preprint arXiv:0708.2974},
year={2007},
archivePrefix={arXiv},
eprint={0708.2974},
primaryClass={cs.CV cs.CR}
} | mihailescu2007the |
arxiv-1025 | 0708.3014 | Explicit formulas for efficient multiplication in F_3^6m | <|reference_start|>Explicit formulas for efficient multiplication in F_3^6m: Efficient computation of the Tate pairing is an important part of pairing-based cryptography. Recently with the introduction of the Duursma-Lee method special attention has been given to the fields of characteristic 3. Especially multiplicatio... | arxiv | @article{gorla2007explicit,
title={Explicit formulas for efficient multiplication in F_{3^{6m}}},
author={Elisa Gorla, Christoph Puttmann, and Jamshid Shokrollahi},
journal={arXiv preprint arXiv:0708.3014},
year={2007},
archivePrefix={arXiv},
eprint={0708.3014},
primaryClass={cs.CR cs.CC}
} | gorla2007explicit |
arxiv-1026 | 0708.3019 | Single-Symbol ML Decodable Distributed STBCs for Partially-Coherent Cooperative Networks | <|reference_start|>Single-Symbol ML Decodable Distributed STBCs for Partially-Coherent Cooperative Networks: Space-time block codes (STBCs) that are single-symbol decodable (SSD) in a co-located multiple antenna setting need not be SSD in a distributed cooperative communication setting. A relay network with N relays an... | arxiv | @article{sreedhar2007single-symbol,
title={Single-Symbol ML Decodable Distributed STBCs for Partially-Coherent
Cooperative Networks},
author={D. Sreedhar, A. Chockalingam, B. Sundar Rajan},
journal={arXiv preprint arXiv:0708.3019},
year={2007},
archivePrefix={arXiv},
eprint={0708.3019},
pr... | sreedhar2007single-symbol |
arxiv-1027 | 0708.3022 | Efficient FPGA-based multipliers for F_3^97 and F_3^6*97 | <|reference_start|>Efficient FPGA-based multipliers for F_3^97 and F_3^6*97: In this work we present a new structure for multiplication in finite fields. This structure is based on a digit-level LFSR (Linear Feedback Shift Register) multiplier in which the area of digit-multipliers are reduced using the Karatsuba metho... | arxiv | @article{shokrollahi2007efficient,
title={Efficient FPGA-based multipliers for F_{3^97} and F_{3^{6*97}}},
author={Jamshid Shokrollahi, Elisa Gorla, Christoph Puttmann},
journal={arXiv preprint arXiv:0708.3022},
year={2007},
archivePrefix={arXiv},
eprint={0708.3022},
primaryClass={cs.CR}
} | shokrollahi2007efficient |
arxiv-1028 | 0708.3048 | Identifying Small Mean Reverting Portfolios | <|reference_start|>Identifying Small Mean Reverting Portfolios: Given multivariate time series, we study the problem of forming portfolios with maximum mean reversion while constraining the number of assets in these portfolios. We show that it can be formulated as a sparse canonical correlation analysis and study vario... | arxiv | @article{d'aspremont2007identifying,
title={Identifying Small Mean Reverting Portfolios},
author={Alexandre d'Aspremont},
journal={arXiv preprint arXiv:0708.3048},
year={2007},
archivePrefix={arXiv},
eprint={0708.3048},
primaryClass={cs.CE}
} | d'aspremont2007identifying |
arxiv-1029 | 0708.3057 | Voice Service Support in Mobile Ad Hoc Networks | <|reference_start|>Voice Service Support in Mobile Ad Hoc Networks: Mobile ad hoc networks are expected to support voice traffic. The requirement for small delay and jitter of voice traffic poses a significant challenge for medium access control (MAC) in such networks. User mobility makes it more complex due to the ass... | arxiv | @article{jiang2007voice,
title={Voice Service Support in Mobile Ad Hoc Networks},
author={Hai Jiang, Ping Wang, H. Vincent Poor, and Weihua Zhuang},
journal={arXiv preprint arXiv:0708.3057},
year={2007},
doi={10.1109/GLOCOM.2007.186},
archivePrefix={arXiv},
eprint={0708.3057},
primaryCla... | jiang2007voice |
arxiv-1030 | 0708.3070 | Network Coding Capacity of Random Wireless Networks under a Signal-to-Interference-and-Noise Model | <|reference_start|>Network Coding Capacity of Random Wireless Networks under a Signal-to-Interference-and-Noise Model: In this paper, we study network coding capacity for random wireless networks. Previous work on network coding capacity for wired and wireless networks have focused on the case where the capacities of l... | arxiv | @article{kong2007network,
title={Network Coding Capacity of Random Wireless Networks under a
Signal-to-Interference-and-Noise Model},
author={Zhenning Kong, Salah A. Aly, Emina Soljanin, Edmund M. Yeh and Andreas
Klappenecker},
journal={arXiv preprint arXiv:0708.3070},
year={2007},
archivePrefix... | kong2007network |
arxiv-1031 | 0708.3127 | Question on Conditional Entropy | <|reference_start|>Question on Conditional Entropy: The problems of conditional entropy's definition and the formula to compute conditional entropy are analyzed from various perspectives, and the corrected computing formula is presented. Examples are given to prove the conclusion that conditional entropy never be incre... | arxiv | @article{yong2007question,
title={Question on Conditional Entropy},
author={Wang Yong},
journal={arXiv preprint arXiv:0708.3127},
year={2007},
archivePrefix={arXiv},
eprint={0708.3127},
primaryClass={cs.IT math.IT}
} | yong2007question |
arxiv-1032 | 0708.3166 | Web Server Benchmark Application WiiBench using Erlang/OTP R11 and Fedora-Core Linux 50 | <|reference_start|>Web Server Benchmark Application WiiBench using Erlang/OTP R11 and Fedora-Core Linux 50: As the web grows and the amount of traffics on the web server increase, problems related to performance begin to appear. Some of the problems, such as the number of users that can access the server simultaneously... | arxiv | @article{mutiara2007web,
title={Web Server Benchmark Application WiiBench using Erlang/OTP R11 and
Fedora-Core Linux 5.0},
author={A. B. Mutiara and T. A. Sabastian},
journal={arXiv preprint arXiv:0708.3166},
year={2007},
archivePrefix={arXiv},
eprint={0708.3166},
primaryClass={cs.NI}
} | mutiara2007web |
arxiv-1033 | 0708.3220 | Optimal strategies in the average consensus problem | <|reference_start|>Optimal strategies in the average consensus problem: We prove that for a set of communicating agents to compute the average of their initial positions (average consensus problem), the optimal topology of communication is given by a de Bruijn's graph. Consensus is then reached in a finitely many steps... | arxiv | @article{delvenne2007optimal,
title={Optimal strategies in the average consensus problem},
author={Jean-Charles Delvenne, Ruggero Carli and Sandro Zampieri},
journal={arXiv preprint arXiv:0708.3220},
year={2007},
archivePrefix={arXiv},
eprint={0708.3220},
primaryClass={cs.MA cs.NI math.OC}
} | delvenne2007optimal |
arxiv-1034 | 0708.3224 | The Frobenius Problem in a Free Monoid | <|reference_start|>The Frobenius Problem in a Free Monoid: The classical Frobenius problem is to compute the largest number g not representable as a non-negative integer linear combination of non-negative integers x_1, x_2, ..., x_k, where gcd(x_1, x_2, ..., x_k) = 1. In this paper we consider generalizations of the Fr... | arxiv | @article{kao2007the,
title={The Frobenius Problem in a Free Monoid},
author={Jui-Yi Kao, Jeffrey Shallit, Zhi Xu},
journal={arXiv preprint arXiv:0708.3224},
year={2007},
archivePrefix={arXiv},
eprint={0708.3224},
primaryClass={cs.DM math.CO}
} | kao2007the |
arxiv-1035 | 0708.3226 | A Dichotomy Theorem for General Minimum Cost Homomorphism Problem | <|reference_start|>A Dichotomy Theorem for General Minimum Cost Homomorphism Problem: In the constraint satisfaction problem ($CSP$), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost homomorphism problem ($MinHom$), one is additionally given weights ... | arxiv | @article{takhanov2007a,
title={A Dichotomy Theorem for General Minimum Cost Homomorphism Problem},
author={Rustem Takhanov},
journal={arXiv preprint arXiv:0708.3226},
year={2007},
archivePrefix={arXiv},
eprint={0708.3226},
primaryClass={cs.LG cs.CC}
} | takhanov2007a |
arxiv-1036 | 0708.3230 | Can Alice and Bob be random: a study on human playing zero knowledge protocols | <|reference_start|>Can Alice and Bob be random: a study on human playing zero knowledge protocols: The research described in this abstract was initiated by discussions between the author and Giovanni Di Crescenzo in Barcelona in early 2004. It was during Advanced Course on Contemporary Cryptology that Di Crescenzo gave... | arxiv | @article{kulesza2007can,
title={Can Alice and Bob be random: a study on human playing zero knowledge
protocols},
author={Kamil Kulesza},
journal={arXiv preprint arXiv:0708.3230},
year={2007},
archivePrefix={arXiv},
eprint={0708.3230},
primaryClass={cs.CR cs.CY}
} | kulesza2007can |
arxiv-1037 | 0708.3259 | Fast evaluation of union-intersection expressions | <|reference_start|>Fast evaluation of union-intersection expressions: We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient way. This problem has applications in e.g. information retrieval and database sy... | arxiv | @article{bille2007fast,
title={Fast evaluation of union-intersection expressions},
author={Philip Bille, Anna Pagh, Rasmus Pagh},
journal={arXiv preprint arXiv:0708.3259},
year={2007},
archivePrefix={arXiv},
eprint={0708.3259},
primaryClass={cs.DS cs.DB cs.IR}
} | bille2007fast |
arxiv-1038 | 0708.3341 | Browsing through 3D representations of unstructured picture collections: an empirical study | <|reference_start|>Browsing through 3D representations of unstructured picture collections: an empirical study: The paper presents a 3D interactive representation of fairly large picture collections which facilitates browsing through unstructured sets of icons or pictures. Implementation of this representation implies ... | arxiv | @article{christmann2007browsing,
title={Browsing through 3D representations of unstructured picture collections:
an empirical study},
author={Olivier Christmann (INRIA Rocquencourt / INRIA Lorraine - LORIA),
No"elle Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA)},
journal={Dans Proceedings of A... | christmann2007browsing |
arxiv-1039 | 0708.3381 | Architecture Optimization of a 3-DOF Translational Parallel Mechanism for Machining Applications, the Orthoglide | <|reference_start|>Architecture Optimization of a 3-DOF Translational Parallel Mechanism for Machining Applications, the Orthoglide: This paper addresses the architecture optimization of a 3-DOF translational parallel mechanism designed for machining applications. The design optimization is conducted on the basis of a ... | arxiv | @article{chablat2007architecture,
title={Architecture Optimization of a 3-DOF Translational Parallel Mechanism
for Machining Applications, the Orthoglide},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN)},
journal={IEEE Transactions on Robotics and Automation 19, 3 (2003) 403-410},
year={200... | chablat2007architecture |
arxiv-1040 | 0708.3387 | The Impact of Noise Correlation and Channel Phase Information on the Data-Rate of the Single-Symbol ML Decodable Distributed STBCs | <|reference_start|>The Impact of Noise Correlation and Channel Phase Information on the Data-Rate of the Single-Symbol ML Decodable Distributed STBCs: Very recently, we proposed the row-monomial distributed orthogonal space-time block codes (DOSTBCs) and showed that the row-monomial DOSTBCs achieved approximately twice... | arxiv | @article{yi2007the,
title={The Impact of Noise Correlation and Channel Phase Information on the
Data-Rate of the Single-Symbol ML Decodable Distributed STBCs},
author={Zhihang Yi and Il-Min Kim},
journal={arXiv preprint arXiv:0708.3387},
year={2007},
archivePrefix={arXiv},
eprint={0708.3387},
... | yi2007the |
arxiv-1041 | 0708.3408 | Linear Time Algorithms Based on Multilevel Prefix Tree for Finding Shortest Path with Positive Weights and Minimum Spanning Tree in a Networks | <|reference_start|>Linear Time Algorithms Based on Multilevel Prefix Tree for Finding Shortest Path with Positive Weights and Minimum Spanning Tree in a Networks: In this paper I present general outlook on questions relevant to the basic graph algorithms; Finding the Shortest Path with Positive Weights and Minimum Span... | arxiv | @article{planeta2007linear,
title={Linear Time Algorithms Based on Multilevel Prefix Tree for Finding
Shortest Path with Positive Weights and Minimum Spanning Tree in a Networks},
author={David S. Planeta},
journal={arXiv preprint arXiv:0708.3408},
year={2007},
number={Cornell University TR2006-20... | planeta2007linear |
arxiv-1042 | 0708.3446 | Multi and Independent Block Approach in Public Cluster | <|reference_start|>Multi and Independent Block Approach in Public Cluster: We present extended multi block approach in the LIPI Public Cluster. The multi block approach enables a cluster to be divided into several independent blocks which run jobs owned by different users simultaneously. Previously, we have maintained ... | arxiv | @article{akbar2007multi,
title={Multi and Independent Block Approach in Public Cluster},
author={Z. Akbar and L.T. Handoko},
journal={arXiv preprint arXiv:0708.3446},
year={2007},
number={FISIKALIPI-07012},
archivePrefix={arXiv},
eprint={0708.3446},
primaryClass={cs.DC}
} | akbar2007multi |
arxiv-1043 | 0708.3463 | A Neural Networks Model of the Venezuelan Economy | <|reference_start|>A Neural Networks Model of the Venezuelan Economy: Besides an indicator of the GDP, the Central Bank of Venezuela generates the so called Monthly Economic Activity General Indicator. The a priori knowledge of this indicator, which represents and sometimes even anticipates the economy's fluctuations, ... | arxiv | @article{costanzo2007a,
title={A Neural Networks Model of the Venezuelan Economy},
author={Sabatino Costanzo, Loren Trigo, Luis Jimenez, Juan Gonzalez},
journal={arXiv preprint arXiv:0708.3463},
year={2007},
archivePrefix={arXiv},
eprint={0708.3463},
primaryClass={cs.CE cs.NE}
} | costanzo2007a |
arxiv-1044 | 0708.3464 | A Non Parametric Study of the Volatility of the Economy as a Country Risk Predictor | <|reference_start|>A Non Parametric Study of the Volatility of the Economy as a Country Risk Predictor: This paper intends to explain Venezuela's country spread behavior through the Neural Networks analysis of a monthly economic activity general index of economic indicators constructed by the Central Bank of Venezuela,... | arxiv | @article{costanzo2007a,
title={A Non Parametric Study of the Volatility of the Economy as a Country
Risk Predictor},
author={Sabatino Costanzo, Loren Trigo, Ramses Dominguez, William Moreno},
journal={arXiv preprint arXiv:0708.3464},
year={2007},
archivePrefix={arXiv},
eprint={0708.3464},
... | costanzo2007a |
arxiv-1045 | 0708.3465 | An Early Warning System for Bankruptcy Prediction: lessons from the Venezuelan Bank Crisis | <|reference_start|>An Early Warning System for Bankruptcy Prediction: lessons from the Venezuelan Bank Crisis: During 1993-94 Venezuela experienced a severe banking crisis which ended up with 18 commercial banks intervened by the government. Here we develop an early warning system for detecting credit related bankruptc... | arxiv | @article{trigo2007an,
title={An Early Warning System for Bankruptcy Prediction: lessons from the
Venezuelan Bank Crisis},
author={Loren Trigo, Sabatino Costanzo, Felix Gonzalez, Jose Llamozas},
journal={arXiv preprint arXiv:0708.3465},
year={2007},
archivePrefix={arXiv},
eprint={0708.3465},
... | trigo2007an |
arxiv-1046 | 0708.3477 | The Church Synthesis Problem with Parameters | <|reference_start|>The Church Synthesis Problem with Parameters: For a two-variable formula ψ(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of an operator Y=F(X) such that ψ(X,F(X)) is universally valid over Nat. B\"{u}chi and Landweber proved that t... | arxiv | @article{rabinovich2007the,
title={The Church Synthesis Problem with Parameters},
author={Alexander Rabinovich},
journal={Logical Methods in Computer Science, Volume 3, Issue 4 (November
14, 2007) lmcs:1233},
year={2007},
doi={10.2168/LMCS-3(4:9)2007},
archivePrefix={arXiv},
eprint={0708.3... | rabinovich2007the |
arxiv-1047 | 0708.3499 | Comparison of Tree-Child Phylogenetic Networks | <|reference_start|>Comparison of Tree-Child Phylogenetic Networks: Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of non-treelike evolutionary events, like recombination, hybridization, or lateral gene transfer. In this paper, we present and study a new class of phylo... | arxiv | @article{cardona2007comparison,
title={Comparison of Tree-Child Phylogenetic Networks},
author={Gabriel Cardona, Francesc Rossello, Gabriel Valiente},
journal={arXiv preprint arXiv:0708.3499},
year={2007},
archivePrefix={arXiv},
eprint={0708.3499},
primaryClass={q-bio.PE cs.CE cs.DM}
} | cardona2007comparison |
arxiv-1048 | 0708.3505 | Gaze as a Supplementary Modality for Interacting with Ambient Intelligence Environments | <|reference_start|>Gaze as a Supplementary Modality for Interacting with Ambient Intelligence Environments: We present our current research on the implementation of gaze as an efficient and usable pointing modality supplementary to speech, for interacting with augmented objects in our daily environment or large display... | arxiv | @article{gepner2007gaze,
title={Gaze as a Supplementary Modality for Interacting with Ambient
Intelligence Environments},
author={Daniel Gepner (INRIA Rocquencourt / INRIA Lorraine - LORIA),
J'er^ome Simonin (INRIA Rocquencourt / INRIA Lorraine - LORIA), No"elle
Carbonell (INRIA Rocquencourt / INRIA Lorra... | gepner2007gaze |
arxiv-1049 | 0708.3522 | Bounding the Betti numbers and computing the Euler-Poincar\'e characteristic of semi-algebraic sets defined by partly quadratic systems of polynomials | <|reference_start|>Bounding the Betti numbers and computing the Euler-Poincar\'e characteristic of semi-algebraic sets defined by partly quadratic systems of polynomials: Let $\R$ be a real closed field, $ {\mathcal Q} \subset \R[Y_1,...,Y_\ell,X_1,...,X_k], $ with $ \deg_{Y}(Q) \leq 2, \deg_{X}(Q) \leq d, Q \in {\math... | arxiv | @article{basu2007bounding,
title={Bounding the Betti numbers and computing the Euler-Poincar\'e
characteristic of semi-algebraic sets defined by partly quadratic systems of
polynomials},
author={Saugata Basu, Dmitrii V. Pasechnik, Marie-Francoise Roy},
journal={J. European Math. Soc. 12(2010), 529-553},... | basu2007bounding |
arxiv-1050 | 0708.3531 | Networked Multiple Description Estimation and Compression with Resource Scalability | <|reference_start|>Networked Multiple Description Estimation and Compression with Resource Scalability: We present a joint source-channel multiple description (JSC-MD) framework for resource-constrained network communications (e.g., sensor networks), in which one or many deprived encoders communicate a Markov source ag... | arxiv | @article{wu2007networked,
title={Networked Multiple Description Estimation and Compression with Resource
Scalability},
author={Xiaolin Wu, Xiaohan Wang and Zhe Wang},
journal={arXiv preprint arXiv:0708.3531},
year={2007},
archivePrefix={arXiv},
eprint={0708.3531},
primaryClass={cs.IT math.... | wu2007networked |
arxiv-1051 | 0708.3564 | Deciding security properties for cryptographic protocols Application to key cycles | <|reference_start|>Deciding security properties for cryptographic protocols Application to key cycles: There is a large amount of work dedicated to the formal verification of security protocols. In this paper, we revisit and extend the NP-complete decision procedure for a bounded number of sessions. We use a, now stand... | arxiv | @article{comon-lundh2007deciding,
title={Deciding security properties for cryptographic protocols. Application to
key cycles},
author={Hubert Comon-Lundh and V'eronique Cortier and Eugen Zalinescu},
journal={arXiv preprint arXiv:0708.3564},
year={2007},
archivePrefix={arXiv},
eprint={0708.3564... | comon-lundh2007deciding |
arxiv-1052 | 0708.3567 | On the Distortion of the Eigenvalue Spectrum in MIMO Amplify-and-Forward Multi-Hop Channels | <|reference_start|>On the Distortion of the Eigenvalue Spectrum in MIMO Amplify-and-Forward Multi-Hop Channels: Consider a wireless MIMO multi-hop channel with n_s non-cooperating source antennas and n_d fully cooperating destination antennas, as well as L clusters containing k non-cooperating relay antennas each. The ... | arxiv | @article{wagner2007on,
title={On the Distortion of the Eigenvalue Spectrum in MIMO Amplify-and-Forward
Multi-Hop Channels},
author={Joerg Wagner and Armin Wittneben},
journal={arXiv preprint arXiv:0708.3567},
year={2007},
archivePrefix={arXiv},
eprint={0708.3567},
primaryClass={cs.IT math.... | wagner2007on |
arxiv-1053 | 0708.3568 | A Polynomial-time Algorithm for Computing the Permanent in GF(3^q) | <|reference_start|>A Polynomial-time Algorithm for Computing the Permanent in GF(3^q): A polynomial-time algorithm for computing the permanent in any field of characteristic 3 is presented in this article. The principal objects utilized for that purpose are the Cauchy and Vandermonde matrices, the discriminant function... | arxiv | @article{tarin2007a,
title={A Polynomial-time Algorithm for Computing the Permanent in GF(3^q)},
author={Vadim Tarin},
journal={arXiv preprint arXiv:0708.3568},
year={2007},
archivePrefix={arXiv},
eprint={0708.3568},
primaryClass={cs.CC}
} | tarin2007a |
arxiv-1054 | 0708.3573 | On the Outage Capacity of a Practical Decoder Accounting for Channel Estimation Inaccuracies | <|reference_start|>On the Outage Capacity of a Practical Decoder Accounting for Channel Estimation Inaccuracies: The optimal decoder achieving the outage capacity under imperfect channel estimation is investigated. First, by searching into the family of nearest neighbor decoders, which can be easily implemented on most... | arxiv | @article{piantanida2007on,
title={On the Outage Capacity of a Practical Decoder Accounting for Channel
Estimation Inaccuracies},
author={Pablo Piantanida, Sajad Sadough and Pierre Duhamel},
journal={arXiv preprint arXiv:0708.3573},
year={2007},
doi={10.1109/TCOMM.2009.070353},
archivePrefix={a... | piantanida2007on |
arxiv-1055 | 0708.3575 | How really effective are Multimodal Hints in enhancing Visual Target Spotting? Some evidence from a usability study | <|reference_start|>How really effective are Multimodal Hints in enhancing Visual Target Spotting? Some evidence from a usability study: The main aim of the work presented here is to contribute to computer science advances in the multimodal usability area, in-as-much as it addresses one of the major issues relating to t... | arxiv | @article{kieffer2007how,
title={How really effective are Multimodal Hints in enhancing Visual Target
Spotting? Some evidence from a usability study},
author={Suzanne Kieffer (INRIA Rocquencourt / INRIA Lorraine - LORIA),
No"elle Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA)},
journal={Journal ... | kieffer2007how |
arxiv-1056 | 0708.3580 | Ambient Multimodality: an Asset for Developing Universal Access to the Information Society | <|reference_start|>Ambient Multimodality: an Asset for Developing Universal Access to the Information Society: The paper tries to point out the benefits that can be derived from research advances in the implementation of concepts such as ambient intelligence (AmI) and ubiquitous or pervasive computing for promoting Uni... | arxiv | @article{carbonell2007ambient,
title={Ambient Multimodality: an Asset for Developing Universal Access to the
Information Society},
author={No"elle Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA)},
journal={3rd International Conference on Universal Access in Human-Computer
Interaction, Las Vegas ... | carbonell2007ambient |
arxiv-1057 | 0708.3582 | HORPO with Computability Closure : A Reconstruction | <|reference_start|>HORPO with Computability Closure : A Reconstruction: This paper provides a new, decidable definition of the higher- order recursive path ordering in which type comparisons are made only when needed, therefore eliminating the need for the computability clo- sure, and bound variables are handled explic... | arxiv | @article{blanqui2007horpo,
title={HORPO with Computability Closure : A Reconstruction},
author={Fr'ed'eric Blanqui (INRIA Lorraine - LORIA), Jean-Pierre Jouannaud
(LIX), Albert Rubio},
journal={Dans 14th International Conference on Logic for Programming
Artificial Intelligence and Reasoning LNCS (2007)}... | blanqui2007horpo |
arxiv-1058 | 0708.3607 | Parametric stiffness analysis of the Orthoglide | <|reference_start|>Parametric stiffness analysis of the Orthoglide: This paper presents a parametric stiffness analysis of the Orthoglide. A compliant modeling and a symbolic expression of the stiffness matrix are conducted. This allows a simple systematic analysis of the influence of the geometric design parameters an... | arxiv | @article{majou2007parametric,
title={Parametric stiffness analysis of the Orthoglide},
author={F'elix Majou (IRCCyN), Cl'ement Gosselin (Robotics Laboratory),
Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={Journal of Mechanism and Machine Theory 42, 3 (2007) 296-311},
year={2007},
ar... | majou2007parametric |
arxiv-1059 | 0708.3613 | Kinematics and Workspace Analysis of a Three-Axis Parallel Manipulator: the Orthoglide | <|reference_start|>Kinematics and Workspace Analysis of a Three-Axis Parallel Manipulator: the Orthoglide: The paper addresses kinematic and geometrical aspects of the Orthoglide, a three-DOF parallel mechanism. This machine consists of three fixed linear joints, which are mounted orthogonally, three identical legs and... | arxiv | @article{pashkevich2007kinematics,
title={Kinematics and Workspace Analysis of a Three-Axis Parallel Manipulator:
the Orthoglide},
author={Anatoly Pashkevich (Robotic Laboratory), Damien Chablat (IRCCyN),
Philippe Wenger (IRCCyN)},
journal={Robotica 24, 1 (2006) 39-49},
year={2007},
archivePrefi... | pashkevich2007kinematics |
arxiv-1060 | 0708.3628 | Recursive Structure and Bandwidth of Hales-Numbered Hypercube | <|reference_start|>Recursive Structure and Bandwidth of Hales-Numbered Hypercube: The Hales numbered $n$-dimensional hypercube and the corresponding adjacency matrix exhibit interesting recursive structures in $n$. These structures lead to a very simple proof of the well-known bandwidth formula for hypercube, whose pro... | arxiv | @article{wang2007recursive,
title={Recursive Structure and Bandwidth of Hales-Numbered Hypercube},
author={Xiaohan Wang and Xiaolin Wu},
journal={arXiv preprint arXiv:0708.3628},
year={2007},
archivePrefix={arXiv},
eprint={0708.3628},
primaryClass={cs.DM}
} | wang2007recursive |
arxiv-1061 | 0708.3696 | Relative-Error CUR Matrix Decompositions | <|reference_start|>Relative-Error CUR Matrix Decompositions: Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of ``components.'' Typically, these components are linear combinations of the rows and columns of the matrix, and are thus difficult to interpre... | arxiv | @article{drineas2007relative-error,
title={Relative-Error CUR Matrix Decompositions},
author={Petros Drineas, Michael W. Mahoney and S. Muthukrishnan},
journal={arXiv preprint arXiv:0708.3696},
year={2007},
archivePrefix={arXiv},
eprint={0708.3696},
primaryClass={cs.DS}
} | drineas2007relative-error |
arxiv-1062 | 0708.3699 | Convolutional Entanglement Distillation | <|reference_start|>Convolutional Entanglement Distillation: We develop a theory of entanglement distillation that exploits a convolutional coding structure. We provide a method for converting an arbitrary classical binary or quaternary convolutional code into a convolutional entanglement distillation protocol. The impo... | arxiv | @article{wilde2007convolutional,
title={Convolutional Entanglement Distillation},
author={Mark M. Wilde, Hari Krovi and Todd A. Brun},
journal={Proceedings of the 2010 IEEE International Symposium on
Information Theory, pp. 2657-2661, Austin, Texas, USA},
year={2007},
doi={10.1109/ISIT.2010.551366... | wilde2007convolutional |
arxiv-1063 | 0708.3721 | Verified Real Number Calculations: A Library for Interval Arithmetic | <|reference_start|>Verified Real Number Calculations: A Library for Interval Arithmetic: Real number calculations on elementary functions are remarkably difficult to handle in mechanical proofs. In this paper, we show how these calculations can be performed within a theorem prover or proof assistant in a convenient and... | arxiv | @article{daumas2007verified,
title={Verified Real Number Calculations: A Library for Interval Arithmetic},
author={Marc Daumas (LIRMM, Eliaus), David Lester (UNIVERSITY of Manchester),
C'esar Mu~noz (NIA)},
journal={arXiv preprint arXiv:0708.3721},
year={2007},
archivePrefix={arXiv},
eprint={0... | daumas2007verified |
arxiv-1064 | 0708.3722 | Formally Verified Argument Reduction with a Fused-Multiply-Add | <|reference_start|>Formally Verified Argument Reduction with a Fused-Multiply-Add: Cody & Waite argument reduction technique works perfectly for reasonably large arguments but as the input grows there are no bit left to approximate the constant with enough accuracy. Under mild assumptions, we show that the result compu... | arxiv | @article{boldo2007formally,
title={Formally Verified Argument Reduction with a Fused-Multiply-Add},
author={Sylvie Boldo (INRIA Futurs), Marc Daumas (LIRMM, Eliaus), Ren Cang Li},
journal={arXiv preprint arXiv:0708.3722},
year={2007},
archivePrefix={arXiv},
eprint={0708.3722},
primaryClass={... | boldo2007formally |
arxiv-1065 | 0708.3723 | Parametric Stiffness Analysis of the Orthoglide | <|reference_start|>Parametric Stiffness Analysis of the Orthoglide: This paper presents a parametric stiffness analysis of the Orthoglide, a 3-DOF translational Parallel Kinematic Machine. First, a compliant modeling of the Orthoglide is conducted based on an existing method. Then stiffness matrix is symbolically compu... | arxiv | @article{majou2007parametric,
title={Parametric Stiffness Analysis of the Orthoglide},
author={F'elix Majou (IRCCyN, Robotics Laboratory), Cl'ement Gosselin
(ROBOTICS Laboratory), Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={Dans International Symposium on Robotics - International Symposiu... | majou2007parametric |
arxiv-1066 | 0708.3734 | Searching for a dangerous host: randomized vs deterministic | <|reference_start|>Searching for a dangerous host: randomized vs deterministic: A Black Hole is an harmful host in a network that destroys incoming agents without leaving any trace of such event. The problem of locating the black hole in a network through a team of agent coordinated by a common protocol is usually refe... | arxiv | @article{nitto2007searching,
title={Searching for a dangerous host: randomized vs. deterministic},
author={Igor Nitto and Rossano Venturini},
journal={arXiv preprint arXiv:0708.3734},
year={2007},
archivePrefix={arXiv},
eprint={0708.3734},
primaryClass={cs.DC}
} | nitto2007searching |
arxiv-1067 | 0708.3740 | Plate-forme Magicien d'Oz pour l'\'etude de l'apport des ACAs \`a l'interaction | <|reference_start|>Plate-forme Magicien d'Oz pour l'\'etude de l'apport des ACAs \`a l'interaction: In order to evaluate the contribution of Embodied (Animated) Conversational Agents (ECAs) to the effectiveness and usability of human-computer interaction, we developed a software platform meant to collect usage data. Th... | arxiv | @article{simonin2007plate-forme,
title={Plate-forme Magicien d'Oz pour l'\'etude de l'apport des ACAs \`a
l'interaction},
author={J'er^ome Simonin (INRIA Rocquencourt / INRIA Lorraine - LORIA),
Marius Hategan (INRIA Rocquencourt / INRIA Lorraine - LORIA), No"elle
Carbonell (INRIA Rocquencourt / INRIA Lorr... | simonin2007plate-forme |
arxiv-1068 | 0708.3742 | Interfaces adaptatives Adaptation dynamique \`a l'utilisateur courant | <|reference_start|>Interfaces adaptatives Adaptation dynamique \`a l'utilisateur courant: We present a survey of recent research studies of the implementation of adaptive user models in human-computer interaction. A classification of research directions on adaptive user interfaces is first proposed; it takes account of... | arxiv | @article{simonin2007interfaces,
title={Interfaces adaptatives Adaptation dynamique \`a l'utilisateur courant},
author={J'er^ome Simonin (INRIA Rocquencourt / INRIA Lorraine - LORIA),
No"elle Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA)},
journal={Interfaces num\'eriques, Herm\`es Science (Ed.) ... | simonin2007interfaces |
arxiv-1069 | 0708.3761 | Multi-agent systems, Equiprobability, Gamma distributions and other Geometrical questions | <|reference_start|>Multi-agent systems, Equiprobability, Gamma distributions and other Geometrical questions: A set of many identical interacting agents obeying a global additive constraint is considered. Under the hypothesis of equiprobability in the high-dimensional volume delimited in phase space by the constraint, ... | arxiv | @article{lopez-ruiz2007multi-agent,
title={Multi-agent systems, Equiprobability, Gamma distributions and other
Geometrical questions},
author={Ricardo Lopez-Ruiz, Jaime Sanudo and Xavier Calbet},
journal={arXiv preprint arXiv:0708.3761},
year={2007},
archivePrefix={arXiv},
eprint={0708.3761},
... | lopez-ruiz2007multi-agent |
arxiv-1070 | 0708.3764 | A Radio Resource Management strategy for downlink cooperation in distributed networks | <|reference_start|>A Radio Resource Management strategy for downlink cooperation in distributed networks: This paper has been withdrawn by the author<|reference_end|> | arxiv | @article{pischella2007a,
title={A Radio Resource Management strategy for downlink cooperation in
distributed networks},
author={Mylene Pischella, Jean-Claude Belfiore},
journal={arXiv preprint arXiv:0708.3764},
year={2007},
archivePrefix={arXiv},
eprint={0708.3764},
primaryClass={cs.IT mat... | pischella2007a |
arxiv-1071 | 0708.3809 | Design Strategies for the Geometric Synthesis of Orthoglide-type Mechanisms | <|reference_start|>Design Strategies for the Geometric Synthesis of Orthoglide-type Mechanisms: The paper addresses the geometric synthesis of Orthoglide-type mechanism, a family of 3-DOF parallel manipulators for rapid machining applications, which combine advantages of both serial mechanisms and parallel kinematic ar... | arxiv | @article{pashkevich2007design,
title={Design Strategies for the Geometric Synthesis of Orthoglide-type
Mechanisms},
author={Anatoly Pashkevich (Robotic Laboratory), Philippe Wenger (IRCCyN),
Damien Chablat (IRCCyN)},
journal={Journal of Mechanism and Machine Theory 40, 8 (2005) 907-930},
year={2007}... | pashkevich2007design |
arxiv-1072 | 0708.3811 | An Exhaustive Study of the Workspaces Tolopogies of all 3R Orthogonal Manipulators with Geometric Simplifications | <|reference_start|>An Exhaustive Study of the Workspaces Tolopogies of all 3R Orthogonal Manipulators with Geometric Simplifications: This paper proposes a classification of three-revolute orthogonal manipulators that have at least one of their DH parameters equal to zero. This classification is based on the topology o... | arxiv | @article{zein2007an,
title={An Exhaustive Study of the Workspaces Tolopogies of all 3R Orthogonal
Manipulators with Geometric Simplifications},
author={Mazen Zein (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={Journal of Mechanism and Machine Theory 41, 8 (2006) 971-986},
year=... | zein2007an |
arxiv-1073 | 0708.3829 | A Non Parametric Model for the Forecasting of the Venezuelan Oil Prices | <|reference_start|>A Non Parametric Model for the Forecasting of the Venezuelan Oil Prices: A neural net model for forecasting the prices of Venezuelan crude oil is proposed. The inputs of the neural net are selected by reference to a dynamic system model of oil prices by Mashayekhi (1995, 2001) and its performance is ... | arxiv | @article{costanzo2007a,
title={A Non Parametric Model for the Forecasting of the Venezuelan Oil Prices},
author={Sabatino Costanzo, Loren Trigo, Wafaa Dehne, Hender Prato},
journal={arXiv preprint arXiv:0708.3829},
year={2007},
archivePrefix={arXiv},
eprint={0708.3829},
primaryClass={cs.CE c... | costanzo2007a |
arxiv-1074 | 0708.3879 | Graph Annotations in Modeling Complex Network Topologies | <|reference_start|>Graph Annotations in Modeling Complex Network Topologies: The coarsest approximation of the structure of a complex network, such as the Internet, is a simple undirected unweighted graph. This approximation, however, loses too much detail. In reality, objects represented by vertices and edges in such ... | arxiv | @article{dimitropoulos2007graph,
title={Graph Annotations in Modeling Complex Network Topologies},
author={Xenofontas Dimitropoulos, Dmitri Krioukov, Amin Vahdat, George Riley},
journal={ACM Transactions on Modeling and Computer Simulation (TOMACS),
v.19, n.4, p.17, 2009},
year={2007},
doi={10.114... | dimitropoulos2007graph |
arxiv-1075 | 0708.3896 | The Isoconditioning Loci of Planar Three-DOF Parallel Manipulators | <|reference_start|>The Isoconditioning Loci of Planar Three-DOF Parallel Manipulators: The subject of this paper is a special class of three-degree-of-freedom parallel manipulators. The singular configurations of the two Jacobian matrices are first studied. The isotropic configurations are then found based on the chara... | arxiv | @article{chablat2007the,
title={The Isoconditioning Loci of Planar Three-DOF Parallel Manipulators},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN), St'ephane Caro
(IRCCyN), Jorge Angeles (CIM)},
journal={Dans 29th Design Automation Conference - ASME 29th Design
Automation Conference, France ... | chablat2007the |
arxiv-1076 | 0708.3900 | Inference from correlated patterns: a unified theory for perceptron learning and linear vector channels | <|reference_start|>Inference from correlated patterns: a unified theory for perceptron learning and linear vector channels: A framework to analyze inference performance in densely connected single-layer feed-forward networks is developed for situations where a given data set is composed of correlated patterns. The fram... | arxiv | @article{kabashima2007inference,
title={Inference from correlated patterns: a unified theory for perceptron
learning and linear vector channels},
author={Yoshiyuki Kabashima},
journal={Journal of Physics Conference Series 95, 012001, 2008;
http://www.iop.org/EJ/toc/1742-6596/95/1},
year={2007},
... | kabashima2007inference |
arxiv-1077 | 0708.3920 | Kinematic analysis of the 3-RPR parallel manipulator | <|reference_start|>Kinematic analysis of the 3-RPR parallel manipulator: The aim of this paper is the kinematic study of a 3-RPR planar parallel manipulator where the three fixed revolute joints are actuated. The direct and inverse kinematic problem as well as the singular configuration is characterized. On parallel si... | arxiv | @article{chablat2007kinematic,
title={Kinematic analysis of the 3-RPR parallel manipulator},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN), Ilian Bonev (GPA)},
journal={Dans Advances in Robot Kinematics - 10th International Symposium
on Advances in Robot Kinematics, Ljubljana : Slov\'enie (200... | chablat2007kinematic |
arxiv-1078 | 0708.3936 | Working and Assembly Modes of the Agile Eye | <|reference_start|>Working and Assembly Modes of the Agile Eye: This paper deals with the in-depth kinematic analysis of a special spherical parallel wrist, called the Agile Eye. The Agile Eye is a three-legged spherical parallel robot with revolute joints in which all pairs of adjacent joint axes are orthogonal. Its m... | arxiv | @article{bonev2007working,
title={Working and Assembly Modes of the Agile Eye},
author={Ilian Bonev (GPA), Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN)},
journal={Dans International Conference On Robotics And Automation - IEEE
International Conference On Robotics And Automation, Orlando : \'Etats-Uni... | bonev2007working |
arxiv-1079 | 0708.3962 | A course on Combinatorial Algorithms | <|reference_start|>A course on Combinatorial Algorithms: The paper presents a course on Combinatorial Algorithms that is based on the drafts of the author that he used while teaching the course in the Department of Informatics and Applied Mathematics of Yerevan State University, Armenia from February 2007 to June 2007.... | arxiv | @article{mkrtchyan2007a,
title={A course on Combinatorial Algorithms},
author={V. V. Mkrtchyan},
journal={arXiv preprint arXiv:0708.3962},
year={2007},
archivePrefix={arXiv},
eprint={0708.3962},
primaryClass={cs.DM}
} | mkrtchyan2007a |
arxiv-1080 | 0708.4075 | Graph Isomorphism is PSPACE-complete | <|reference_start|>Graph Isomorphism is PSPACE-complete: Combining the the results of A.R. Meyer and L.J. Stockmeyer "The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space", and K.S. Booth "Isomorphism testing for graphs, semigroups, and finite automata are polynomiamlly equivalent pr... | arxiv | @article{delacorte2007graph,
title={Graph Isomorphism is PSPACE-complete},
author={Matthew Delacorte},
journal={arXiv preprint arXiv:0708.4075},
year={2007},
archivePrefix={arXiv},
eprint={0708.4075},
primaryClass={cs.CC}
} | delacorte2007graph |
arxiv-1081 | 0708.4082 | Aides en ligne \`a l'utilisation de logiciels grand public : probl\`emes sp\'ecifiques de conception et solutions potentielles | <|reference_start|>Aides en ligne \`a l'utilisation de logiciels grand public : probl\`emes sp\'ecifiques de conception et solutions potentielles: The observation that novice users seldom consult online help was made over twenty years ago. This observation still holds nowadays, although online help to the use of softwa... | arxiv | @article{capobianco2007aides,
title={Aides en ligne \`a l'utilisation de logiciels grand public : probl\`emes
sp\'ecifiques de conception et solutions potentielles},
author={Antonio Capobianco (INRIA Rocquencourt / INRIA Lorraine - LORIA),
No"elle Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA)},
... | capobianco2007aides |
arxiv-1082 | 0708.4149 | On the complexity of nonnegative matrix factorization | <|reference_start|>On the complexity of nonnegative matrix factorization: Nonnegative matrix factorization (NMF) has become a prominent technique for the analysis of image databases, text databases and other information retrieval and clustering applications. In this report, we define an exact version of NMF. Then we es... | arxiv | @article{vavasis2007on,
title={On the complexity of nonnegative matrix factorization},
author={Stephen A. Vavasis},
journal={arXiv preprint arXiv:0708.4149},
year={2007},
archivePrefix={arXiv},
eprint={0708.4149},
primaryClass={cs.NA cs.IR}
} | vavasis2007on |
arxiv-1083 | 0708.4155 | Coexistence of Social Norms based on In- and Out-group Interactions | <|reference_start|>Coexistence of Social Norms based on In- and Out-group Interactions: The question how social norms can emerge from microscopic interactions between individuals is a key problem in social sciences to explain collective behavior. In this paper we propose an agent-based model to show that randomly distr... | arxiv | @article{fent2007coexistence,
title={Coexistence of Social Norms based on In- and Out-group Interactions},
author={Thomas Fent, Patrick Groeber, Frank Schweitzer},
journal={ACS - Advances in Complex Systems, vol. 10, no. 2 (2007), pp.
271-286},
year={2007},
archivePrefix={arXiv},
eprint={0708.... | fent2007coexistence |
arxiv-1084 | 0708.4164 | Asymptotic improvement of the Gilbert-Varshamov bound for linear codes | <|reference_start|>Asymptotic improvement of the Gilbert-Varshamov bound for linear codes: The Gilbert-Varshamov bound states that the maximum size A_2(n,d) of a binary code of length n and minimum distance d satisfies A_2(n,d) >= 2^n/V(n,d-1) where V(n,d) stands for the volume of a Hamming ball of radius d. Recently J... | arxiv | @article{gaborit2007asymptotic,
title={Asymptotic improvement of the Gilbert-Varshamov bound for linear codes},
author={Philippe Gaborit and Gilles Zemor},
journal={IEEE Transactions on Information Theory, IT-54, No. 9 (2008) pp.
3865--3872.},
year={2007},
doi={10.1109/TIT.2008.928288},
archiv... | gaborit2007asymptotic |
arxiv-1085 | 0708.4170 | Raising a Hardness Result | <|reference_start|>Raising a Hardness Result: This article presents a technique for proving problems hard for classes of the polynomial hierarchy or for PSPACE. The rationale of this technique is that some problem restrictions are able to simulate existential or universal quantifiers. If this is the case, reductions fr... | arxiv | @article{liberatore2007raising,
title={Raising a Hardness Result},
author={Paolo Liberatore},
journal={arXiv preprint arXiv:0708.4170},
year={2007},
archivePrefix={arXiv},
eprint={0708.4170},
primaryClass={cs.AI cs.CC cs.LO}
} | liberatore2007raising |
arxiv-1086 | 0708.4176 | Classical and Effective Descriptive Complexities of omega-Powers | <|reference_start|>Classical and Effective Descriptive Complexities of omega-Powers: We prove that, for each non null countable ordinal alpha, there exist some Sigma^0_alpha-complete omega-powers, and some Pi^0_alpha-complete omega-powers, extending previous works on the topological complexity of omega-powers. We prove... | arxiv | @article{finkel2007classical,
title={Classical and Effective Descriptive Complexities of omega-Powers},
author={Olivier Finkel (LIP, ELM), Dominique Lecomte (UMR 7586)},
journal={Annals of Pure and Applied Logic 2, 160 (2009) 163-191},
year={2007},
number={LIP Research Report RR 2007-38},
archiv... | finkel2007classical |
arxiv-1087 | 0708.4214 | High Rate Single-Symbol Decodable Precoded DSTBCs for Cooperative Networks | <|reference_start|>High Rate Single-Symbol Decodable Precoded DSTBCs for Cooperative Networks: Distributed Orthogonal Space-Time Block Codes (DOSTBCs) achieving full diversity order and single-symbol ML decodability have been introduced recently for cooperative networks and an upper-bound on the maximal rate of such co... | arxiv | @article{harshan2007high,
title={High Rate Single-Symbol Decodable Precoded DSTBCs for Cooperative
Networks},
author={J. Harshan and B. Sundar Rajan},
journal={arXiv preprint arXiv:0708.4214},
year={2007},
number={TR-PME-2007-08},
archivePrefix={arXiv},
eprint={0708.4214},
primaryClass... | harshan2007high |
arxiv-1088 | 0708.4219 | Secure Transmission with Multiple Antennas: The MISOME Wiretap Channel | <|reference_start|>Secure Transmission with Multiple Antennas: The MISOME Wiretap Channel: The role of multiple antennas for secure communication is investigated within the framework of Wyner's wiretap channel. We characterize the secrecy capacity in terms of generalized eigenvalues when the sender and eavesdropper hav... | arxiv | @article{khisti2007secure,
title={Secure Transmission with Multiple Antennas: The MISOME Wiretap Channel},
author={Ashish Khisti, Gregory Wornell},
journal={arXiv preprint arXiv:0708.4219},
year={2007},
archivePrefix={arXiv},
eprint={0708.4219},
primaryClass={cs.IT math.IT}
} | khisti2007secure |
arxiv-1089 | 0708.4230 | Implicitization of Bihomogeneous Parametrizations of Algebraic Surfaces via Linear Syzygies | <|reference_start|>Implicitization of Bihomogeneous Parametrizations of Algebraic Surfaces via Linear Syzygies: We show that the implicit equation of a surface in 3-dimensional projective space parametrized by bi-homogeneous polynomials of bi-degree (d,d), for a given positive integer d, can be represented and computed... | arxiv | @article{busé2007implicitization,
title={Implicitization of Bihomogeneous Parametrizations of Algebraic Surfaces
via Linear Syzygies},
author={Laurent Bus'e (INRIA Sophia Antipolis), Marc Dohm (JAD)},
journal={Dans International Conference on Symbolic and Algebraic
Computation (2007) 69 - 76},
year=... | busé2007implicitization |
arxiv-1090 | 0708.4284 | Optimal Per-Edge Processing Times in the Semi-Streaming Model | <|reference_start|>Optimal Per-Edge Processing Times in the Semi-Streaming Model: We present semi-streaming algorithms for basic graph problems that have optimal per-edge processing times and therefore surpass all previous semi-streaming algorithms for these tasks. The semi-streaming model, which is appropriate when de... | arxiv | @article{zelke2007optimal,
title={Optimal Per-Edge Processing Times in the Semi-Streaming Model},
author={Mariano Zelke},
journal={Information Processing Letters, Volume 104, Issue 3, 2007, Pages
106-112},
year={2007},
archivePrefix={arXiv},
eprint={0708.4284},
primaryClass={cs.DM cs.DS}
} | zelke2007optimal |
arxiv-1091 | 0708.4288 | Pattern Matching in Trees and Strings | <|reference_start|>Pattern Matching in Trees and Strings: We study the design of efficient algorithms for combinatorial pattern matching. More concretely, we study algorithms for tree matching, string matching, and string matching in compressed texts.<|reference_end|> | arxiv | @article{bille2007pattern,
title={Pattern Matching in Trees and Strings},
author={Philip Bille},
journal={arXiv preprint arXiv:0708.4288},
year={2007},
archivePrefix={arXiv},
eprint={0708.4288},
primaryClass={cs.DS}
} | bille2007pattern |
arxiv-1092 | 0708.4311 | 2006: Celebrating 75 years of AI - History and Outlook: the Next 25 Years | <|reference_start|>2006: Celebrating 75 years of AI - History and Outlook: the Next 25 Years: When Kurt Goedel layed the foundations of theoretical computer science in 1931, he also introduced essential concepts of the theory of Artificial Intelligence (AI). Although much of subsequent AI research has focused on heuris... | arxiv | @article{schmidhuber20072006:,
title={2006: Celebrating 75 years of AI - History and Outlook: the Next 25
Years},
author={Juergen Schmidhuber},
journal={arXiv preprint arXiv:0708.4311},
year={2007},
archivePrefix={arXiv},
eprint={0708.4311},
primaryClass={cs.AI}
} | schmidhuber20072006: |
arxiv-1093 | 0708.4324 | Sensitivity Analysis of the Orthoglide, a 3-DOF Translational Parallel Kinematic Machine | <|reference_start|>Sensitivity Analysis of the Orthoglide, a 3-DOF Translational Parallel Kinematic Machine: This paper presents a sensitivity analysis of the Orthoglide, a 3-DOF translational Parallel Kinematic Machine. Two complementary methods are developed to analyze its sensitivity to its dimensional and angular v... | arxiv | @article{caro2007sensitivity,
title={Sensitivity Analysis of the Orthoglide, a 3-DOF Translational Parallel
Kinematic Machine},
author={St'ephane Caro (IRCCyN), Philippe Wenger (IRCCyN), Fouad Bennis
(IRCCyN), Damien Chablat (IRCCyN)},
journal={Journal of Mechanical Design 128 (2006) 392-402},
year=... | caro2007sensitivity |
arxiv-1094 | 0708.4328 | Dualities Between Entropy Functions and Network Codes | <|reference_start|>Dualities Between Entropy Functions and Network Codes: This paper provides a new duality between entropy functions and network codes. Given a function $g\geq 0$ defined on all proper subsets of $N$ random variables, we provide a construction for a network multicast problem which is solvable if and on... | arxiv | @article{chan2007dualities,
title={Dualities Between Entropy Functions and Network Codes},
author={Terence Chan and Alex Grant},
journal={arXiv preprint arXiv:0708.4328},
year={2007},
archivePrefix={arXiv},
eprint={0708.4328},
primaryClass={cs.IT math.IT}
} | chan2007dualities |
arxiv-1095 | 0708.4379 | A system for the simulation of simultaneous moves between two noncolocational players | <|reference_start|>A system for the simulation of simultaneous moves between two noncolocational players: We describe a new system for the simulation of simultaneous moves between noncolocational players. This has applications in the burgeoning Rock-Paper-Scissors by mail movement.<|reference_end|> | arxiv | @article{debowsky2007a,
title={A system for the simulation of simultaneous moves between two
noncolocational players},
author={Marisa Debowsky and Adrian Riskin},
journal={arXiv preprint arXiv:0708.4379},
year={2007},
archivePrefix={arXiv},
eprint={0708.4379},
primaryClass={cs.GT}
} | debowsky2007a |
arxiv-1096 | 0708.4387 | Conjugates of characteristic Sturmian words generated by morphisms | <|reference_start|>Conjugates of characteristic Sturmian words generated by morphisms: This article is concerned with characteristic Sturmian words of slope $\alpha$ and $1-\alpha$ (denoted by $c_\alpha$ and $c_{1-\alpha}$ respectively), where $\alpha \in (0,1)$ is an irrational number such that $\alpha = [0;1+d_1,\bar... | arxiv | @article{glen2007conjugates,
title={Conjugates of characteristic Sturmian words generated by morphisms},
author={Amy Glen},
journal={European Journal of Combinatorics 25 (2004) 1025-1037},
year={2007},
doi={10.1016/j.ejc.2003.12.012},
archivePrefix={arXiv},
eprint={0708.4387},
primaryCla... | glen2007conjugates |
arxiv-1097 | 0708.4389 | Occurrences of palindromes in characteristic Sturmian words | <|reference_start|>Occurrences of palindromes in characteristic Sturmian words: This paper is concerned with palindromes occurring in characteristic Sturmian words $c_\alpha$ of slope $\alpha$, where $\alpha \in (0,1)$ is an irrational. As $c_\alpha$ is a uniformly recurrent infinite word, any (palindromic) factor of $... | arxiv | @article{glen2007occurrences,
title={Occurrences of palindromes in characteristic Sturmian words},
author={Amy Glen},
journal={Theoretical Computer Science 352 (2006) 31-46},
year={2007},
doi={10.1016/j.tcs.2005.09.075},
archivePrefix={arXiv},
eprint={0708.4389},
primaryClass={math.CO cs... | glen2007occurrences |
arxiv-1098 | 0708.4399 | Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations | <|reference_start|>Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations: We present algorithms for the type-IV discrete cosine transform (DCT-IV) and discrete sine transform (DST-IV), as well as for the modified discrete cosine transform (MDCT) and its inverse, that achieve a lower count ... | arxiv | @article{shao2007type-iv,
title={Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic
operations},
author={Xuancheng Shao and Steven G. Johnson},
journal={Signal Processing vol. 88, issue 6, p. 1313-1326 (2008)},
year={2007},
doi={10.1016/j.sigpro.2007.11.024},
archivePrefi... | shao2007type-iv |
arxiv-1099 | 0708.4400 | Powers in a class of A-strict standard episturmian words | <|reference_start|>Powers in a class of A-strict standard episturmian words: This paper concerns a specific class of strict standard episturmian words whose directive words resemble those of characteristic Sturmian words. In particular, we explicitly determine all integer powers occurring in such infinite words, extend... | arxiv | @article{glen2007powers,
title={Powers in a class of A-strict standard episturmian words},
author={Amy Glen},
journal={Theoretical Computer Science 380 (2007) 330-354},
year={2007},
doi={10.1016/j.tcs.2007.03.023},
archivePrefix={arXiv},
eprint={0708.4400},
primaryClass={math.CO cs.DM}
} | glen2007powers |
arxiv-1100 | 0708.4406 | A characterization of fine words over a finite alphabet | <|reference_start|>A characterization of fine words over a finite alphabet: To any infinite word w over a finite alphabet A we can associate two infinite words min(w) and max(w) such that any prefix of min(w) (resp. max(w)) is the lexicographically smallest (resp. greatest) amongst the factors of w of the same length. ... | arxiv | @article{glen2007a,
title={A characterization of fine words over a finite alphabet},
author={Amy Glen},
journal={Theoretical Computer Science 391 (2008) 51-60},
year={2007},
doi={10.1016/j.tcs.2007.10.029},
archivePrefix={arXiv},
eprint={0708.4406},
primaryClass={math.CO cs.DM}
} | glen2007a |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.