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-2001 | 0712.0165 | On the Accepting Power of 2-Tape B\"uchi Automata | <|reference_start|>On the Accepting Power of 2-Tape B\"uchi Automata: We show that, from a topological point of view, 2-tape B\"uchi automata have the same accepting power than Turing machines equipped with a B\"uchi acceptance condition. In particular, we show that for every non null recursive ordinal alpha, there exi... | arxiv | @article{finkel2007on,
title={On the Accepting Power of 2-Tape B\"uchi Automata},
author={Olivier Finkel (ELM)},
journal={23rd International Symposium on Theoretical Aspects of Computer
Science, STACS 2006, France (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0712.0165},
primaryClas... | finkel2007on |
arxiv-2002 | 0712.0171 | A Spectral Approach to Analyzing Belief Propagation for 3-Coloring | <|reference_start|>A Spectral Approach to Analyzing Belief Propagation for 3-Coloring: Contributing to the rigorous understanding of BP, in this paper we relate the convergence of BP to spectral properties of the graph. This encompasses a result for random graphs with a ``planted'' solution; thus, we obtain the first r... | arxiv | @article{coja-oghlan2007a,
title={A Spectral Approach to Analyzing Belief Propagation for 3-Coloring},
author={Amin Coja-Oghlan and Elchanan Mossel and Dan Vilenchik},
journal={Combinatorics, Probability and Computing 18 (2009) 881 - 912},
year={2007},
doi={10.1017/S096354830900981X},
archivePre... | coja-oghlan2007a |
arxiv-2003 | 0712.0271 | Distributed Arithmetic Coding for the Asymmetric Slepian-Wolf problem | <|reference_start|>Distributed Arithmetic Coding for the Asymmetric Slepian-Wolf problem: Distributed source coding schemes are typically based on the use of channels codes as source codes. In this paper we propose a new paradigm, termed "distributed arithmetic coding", which exploits the fact that arithmetic codes are... | arxiv | @article{grangetto2007distributed,
title={Distributed Arithmetic Coding for the Asymmetric Slepian-Wolf problem},
author={M. Grangetto, E. Magli, G. Olmo},
journal={arXiv preprint arXiv:0712.0271},
year={2007},
archivePrefix={arXiv},
eprint={0712.0271},
primaryClass={cs.IT math.IT}
} | grangetto2007distributed |
arxiv-2004 | 0712.0305 | The analytic computability of the Shannon transform for a large class of random matrix channels | <|reference_start|>The analytic computability of the Shannon transform for a large class of random matrix channels: We define a class of "algebraic" random matrix channels for which one can generically compute the limiting Shannon transform using numerical techniques and often enumerate the low SNR series expansion coe... | arxiv | @article{rao2007the,
title={The analytic computability of the Shannon transform for a large class of
random matrix channels},
author={N. Raj Rao},
journal={arXiv preprint arXiv:0712.0305},
year={2007},
archivePrefix={arXiv},
eprint={0712.0305},
primaryClass={cs.IT math.IT}
} | rao2007the |
arxiv-2005 | 0712.0392 | Collaborative Gain in Resource Sharing Communication Networks | <|reference_start|>Collaborative Gain in Resource Sharing Communication Networks: This paper has been withdrawn<|reference_end|> | arxiv | @article{akhavan-astaneh2007collaborative,
title={Collaborative Gain in Resource Sharing Communication Networks},
author={Saeed Akhavan-Astaneh, Saeed Gazor},
journal={arXiv preprint arXiv:0712.0392},
year={2007},
archivePrefix={arXiv},
eprint={0712.0392},
primaryClass={cs.IT math.IT}
} | akhavan-astaneh2007collaborative |
arxiv-2006 | 0712.0411 | Period of the d-Sequence Based Random Number Generator | <|reference_start|>Period of the d-Sequence Based Random Number Generator: This paper presents an expression to compute the exact period of a recursive random number generator based on d-sequences. Using the multi-recursive version of this generator we can produce large number of pseudorandom sequences.<|reference_end|... | arxiv | @article{thippireddy2007period,
title={Period of the d-Sequence Based Random Number Generator},
author={Suresh Thippireddy and Sandeep Chalasani},
journal={arXiv preprint arXiv:0712.0411},
year={2007},
archivePrefix={arXiv},
eprint={0712.0411},
primaryClass={cs.CR}
} | thippireddy2007period |
arxiv-2007 | 0712.0451 | A Reactive Tabu Search Algorithm for Stimuli Generation in Psycholinguistics | <|reference_start|>A Reactive Tabu Search Algorithm for Stimuli Generation in Psycholinguistics: The generation of meaningless "words" matching certain statistical and/or linguistic criteria is frequently needed for experimental purposes in Psycholinguistics. Such stimuli receive the name of pseudowords or nonwords in ... | arxiv | @article{de lara2007a,
title={A Reactive Tabu Search Algorithm for Stimuli Generation in
Psycholinguistics},
author={Alejandro Chinea Manrique De Lara},
journal={Artificial Intelligence in Science and Technology AISAT 2004
Conference},
year={2007},
archivePrefix={arXiv},
eprint={0712.0451},
... | de lara2007a |
arxiv-2008 | 0712.0499 | Simrank++: Query rewriting through link analysis of the click graph | <|reference_start|>Simrank++: Query rewriting through link analysis of the click graph: We focus on the problem of query rewriting for sponsored search. We base rewrites on a historical click graph that records the ads that have been clicked on in response to past user queries. Given a query q, we first consider Simran... | arxiv | @article{antonellis2007simrank++:,
title={Simrank++: Query rewriting through link analysis of the click graph},
author={Ioannis Antonellis, Hector Garcia-Molina, Chi-Chao Chang},
journal={arXiv preprint arXiv:0712.0499},
year={2007},
number={Stanford University, Infolab TR 2007-32},
archivePrefi... | antonellis2007simrank++: |
arxiv-2009 | 0712.0531 | Prostate biopsies guided by three-dimensional real-time (4-D) transrectal ultrasonography on a phantom: comparative study versus two-dimensional transrectal ultrasound-guided biopsies | <|reference_start|>Prostate biopsies guided by three-dimensional real-time (4-D) transrectal ultrasonography on a phantom: comparative study versus two-dimensional transrectal ultrasound-guided biopsies: OBJECTIVE: This study evaluated the accuracy in localisation and distribution of real-time three-dimensional (4-D) u... | arxiv | @article{long2007prostate,
title={Prostate biopsies guided by three-dimensional real-time (4-D)
transrectal ultrasonography on a phantom: comparative study versus
two-dimensional transrectal ultrasound-guided biopsies},
author={Jean-Alexandre Long (TIMC), Vincent Daanen (TIMC), Alexandre
Moreau-Gaudry (TI... | long2007prostate |
arxiv-2010 | 0712.0541 | New Construction of A Family of Quasi-Twisted Two-Weight Codes | <|reference_start|>New Construction of A Family of Quasi-Twisted Two-Weight Codes: Based on cyclic and consta-cyclic simplex codes, a new explicit construction of a family of two-weight codes is presented. These two-weight codes obtained are in the form of 2-generator quasi-cyclic, or quasi-twisted structure. Based on ... | arxiv | @article{chen2007new,
title={New Construction of A Family of Quasi-Twisted Two-Weight Codes},
author={Eric Z. Chen},
journal={IEEE Trans. Inform. Theory, December 2008},
year={2007},
archivePrefix={arXiv},
eprint={0712.0541},
primaryClass={cs.IT math.IT}
} | chen2007new |
arxiv-2011 | 0712.0554 | Spanners of Complete $k$-Partite Geometric Graphs | <|reference_start|>Spanners of Complete $k$-Partite Geometric Graphs: We address the following problem: Given a complete $k$-partite geometric graph $K$ whose vertex set is a set of $n$ points in $\mathbb{R}^d$, compute a spanner of $K$ that has a ``small'' stretch factor and ``few'' edges. We present two algorithms fo... | arxiv | @article{bose2007spanners,
title={Spanners of Complete $k$-Partite Geometric Graphs},
author={Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Pat
Morin, Michiel Smid},
journal={arXiv preprint arXiv:0712.0554},
year={2007},
archivePrefix={arXiv},
eprint={0712.0554},
primaryClas... | bose2007spanners |
arxiv-2012 | 0712.0616 | Upper Bounds for the Number of Hamiltonian Cycles | <|reference_start|>Upper Bounds for the Number of Hamiltonian Cycles: An upper bound for the number of Hamiltonian cycles of symmetric diagraphs is established first in this paper, which is tighter than the famous Minc's bound and the Br$\acute{e}$gman's bound. A transformation on graphs is proposed, so that counting t... | arxiv | @article{zhang2007upper,
title={Upper Bounds for the Number of Hamiltonian Cycles},
author={Jinshan Zhang},
journal={arXiv preprint arXiv:0712.0616},
year={2007},
archivePrefix={arXiv},
eprint={0712.0616},
primaryClass={cs.DM}
} | zhang2007upper |
arxiv-2013 | 0712.0653 | Equations of States in Singular Statistical Estimation | <|reference_start|>Equations of States in Singular Statistical Estimation: Learning machines which have hierarchical structures or hidden variables are singular statistical models because they are nonidentifiable and their Fisher information matrices are singular. In singular statistical models, neither the Bayes a pos... | arxiv | @article{watanabe2007equations,
title={Equations of States in Singular Statistical Estimation},
author={Sumio Watanabe},
journal={arXiv preprint arXiv:0712.0653},
year={2007},
archivePrefix={arXiv},
eprint={0712.0653},
primaryClass={cs.LG}
} | watanabe2007equations |
arxiv-2014 | 0712.0693 | Cryptanalysis of an image encryption scheme based on the Hill cipher | <|reference_start|>Cryptanalysis of an image encryption scheme based on the Hill cipher: This paper studies the security of an image encryption scheme based on the Hill cipher and reports its following problems: 1) there is a simple necessary and sufficient condition that makes a number of secret keys invalid; 2) it is... | arxiv | @article{li2007cryptanalysis,
title={Cryptanalysis of an image encryption scheme based on the Hill cipher},
author={Chengqing Li, Dan Zhang, and Guanrong Chen},
journal={arXiv preprint arXiv:0712.0693},
year={2007},
doi={10.1631/jzus.A0720102},
archivePrefix={arXiv},
eprint={0712.0693},
... | li2007cryptanalysis |
arxiv-2015 | 0712.0744 | Computational Chemotaxis in Ants and Bacteria over Dynamic Environments | <|reference_start|>Computational Chemotaxis in Ants and Bacteria over Dynamic Environments: Chemotaxis can be defined as an innate behavioural response by an organism to a directional stimulus, in which bacteria, and other single-cell or multicellular organisms direct their movements according to certain chemicals in t... | arxiv | @article{ramos2007computational,
title={Computational Chemotaxis in Ants and Bacteria over Dynamic Environments},
author={Vitorino Ramos, C. M. Fernandes, A. C. Rosa, A. Abraham},
journal={arXiv preprint arXiv:0712.0744},
year={2007},
doi={10.1109/CEC.2007.4424594},
archivePrefix={arXiv},
ep... | ramos2007computational |
arxiv-2016 | 0712.0769 | Towards 3D ultrasound image based soft tissue tracking: a transrectal ultrasound prostate image alignment system | <|reference_start|>Towards 3D ultrasound image based soft tissue tracking: a transrectal ultrasound prostate image alignment system: The emergence of real-time 3D ultrasound (US) makes it possible to consider image-based tracking of subcutaneous soft tissue targets for computer guided diagnosis and therapy. We propose ... | arxiv | @article{baumann2007towards,
title={Towards 3D ultrasound image based soft tissue tracking: a transrectal
ultrasound prostate image alignment system},
author={Michael Baumann (TIMC), Pierre Mozer (TIMC), Vincent Daanen (TIMC),
Jocelyne Troccaz (TIMC)},
journal={Dans Proceedings of MICCAI 2007 - Medical ... | baumann2007towards |
arxiv-2017 | 0712.0804 | Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs | <|reference_start|>Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive 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... | arxiv | @article{gupta2007minimum,
title={Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive
Digraphs},
author={A. Gupta, G. Gutin, M. Karimi, E.J. Kim, A. Rafiey},
journal={arXiv preprint arXiv:0712.0804},
year={2007},
archivePrefix={arXiv},
eprint={0712.0804},
primaryClass={... | gupta2007minimum |
arxiv-2018 | 0712.0811 | The Fast Fibonacci Decompression Algorithm | <|reference_start|>The Fast Fibonacci Decompression Algorithm: Data compression has been widely applied in many data processing areas. Compression methods use variable-size codes with the shorter codes assigned to symbols or groups of symbols that appear in the data frequently. Fibonacci coding, as a representative of ... | arxiv | @article{baca2007the,
title={The Fast Fibonacci Decompression Algorithm},
author={R.Baca, V.Snasel, J.Platos, M.Kratky, E.El-Qawasmeh},
journal={arXiv preprint arXiv:0712.0811},
year={2007},
archivePrefix={arXiv},
eprint={0712.0811},
primaryClass={cs.PF cs.OH}
} | baca2007the |
arxiv-2019 | 0712.0836 | Evolving localizations in reaction-diffusion cellular automata | <|reference_start|>Evolving localizations in reaction-diffusion cellular automata: We consider hexagonal cellular automata with immediate cell neighbourhood and three cell-states. Every cell calculates its next state depending on the integral representation of states in its neighbourhood, i.e. how many neighbours are i... | arxiv | @article{adamatzky2007evolving,
title={Evolving localizations in reaction-diffusion cellular automata},
author={Andrew Adamatzky, Larry Bull, Pierre Collet, Emmanuel Sapin},
journal={International Journal of Modern Physics C (IJMPC) Volume: 19,
Issue: 4 (April 2008) pp. 557-567},
year={2007},
doi=... | adamatzky2007evolving |
arxiv-2020 | 0712.0840 | A Universal Kernel for Learning Regular Languages | <|reference_start|>A Universal Kernel for Learning Regular Languages: We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but we do have an efficient $\eps$-approximation.<|reference_end|> | arxiv | @article{leonid2007a,
title={A Universal Kernel for Learning Regular Languages},
author={Leonid (Aryeh) Kontorovich},
journal={The 5th International Workshop on Mining and Learning with Graphs,
2007},
year={2007},
archivePrefix={arXiv},
eprint={0712.0840},
primaryClass={cs.LG cs.DM}
} | leonid2007a |
arxiv-2021 | 0712.0871 | Balancing forward and feedback error correction for erasure channels with unreliable feedback | <|reference_start|>Balancing forward and feedback error correction for erasure channels with unreliable feedback: The traditional information theoretic approach to studying feedback is to consider ideal instantaneous high-rate feedback of the channel outputs to the encoder. This was acceptable in classical work because... | arxiv | @article{sahai2007balancing,
title={Balancing forward and feedback error correction for erasure channels
with unreliable feedback},
author={Anant Sahai},
journal={arXiv preprint arXiv:0712.0871},
year={2007},
archivePrefix={arXiv},
eprint={0712.0871},
primaryClass={cs.IT math.IT}
} | sahai2007balancing |
arxiv-2022 | 0712.0873 | The price of ignorance: The impact of side-information on delay for lossless source-coding | <|reference_start|>The price of ignorance: The impact of side-information on delay for lossless source-coding: Inspired by the context of compressing encrypted sources, this paper considers the general tradeoff between rate, end-to-end delay, and probability of error for lossless source coding with side-information. Th... | arxiv | @article{chang2007the,
title={The price of ignorance: The impact of side-information on delay for
lossless source-coding},
author={Cheng Chang and Anant Sahai},
journal={arXiv preprint arXiv:0712.0873},
year={2007},
archivePrefix={arXiv},
eprint={0712.0873},
primaryClass={cs.IT math.IT}
} | chang2007the |
arxiv-2023 | 0712.0917 | Some properties of finite meadows | <|reference_start|>Some properties of finite meadows: The aim of this note is to describe the structure of finite meadows. We will show that the class of finite meadows is the closure of the class of finite fields under finite products. As a corollary, we obtain a unique representation of minimal meadows in terms of pr... | arxiv | @article{bethke2007some,
title={Some properties of finite meadows},
author={Inge Bethke and Piet Rodenburg},
journal={arXiv preprint arXiv:0712.0917},
year={2007},
archivePrefix={arXiv},
eprint={0712.0917},
primaryClass={math.RA cs.SC}
} | bethke2007some |
arxiv-2024 | 0712.0932 | Dimensionality Reduction and Reconstruction using Mirroring Neural Networks and Object Recognition based on Reduced Dimension Characteristic Vector | <|reference_start|>Dimensionality Reduction and Reconstruction using Mirroring Neural Networks and Object Recognition based on Reduced Dimension Characteristic Vector: In this paper, we present a Mirroring Neural Network architecture to perform non-linear dimensionality reduction and Object Recognition using a reduced ... | arxiv | @article{deepthi2007dimensionality,
title={Dimensionality Reduction and Reconstruction using Mirroring Neural
Networks and Object Recognition based on Reduced Dimension Characteristic
Vector},
author={Dasika Ratna Deepthi, Sujeet Kuchibhotla and K.Eswaran},
journal={IEEE International Conference On Adva... | deepthi2007dimensionality |
arxiv-2025 | 0712.0938 | Automatic Pattern Classification by Unsupervised Learning Using Dimensionality Reduction of Data with Mirroring Neural Networks | <|reference_start|>Automatic Pattern Classification by Unsupervised Learning Using Dimensionality Reduction of Data with Mirroring Neural Networks: This paper proposes an unsupervised learning technique by using Multi-layer Mirroring Neural Network and Forgy's clustering algorithm. Multi-layer Mirroring Neural Network ... | arxiv | @article{deepthi2007automatic,
title={Automatic Pattern Classification by Unsupervised Learning Using
Dimensionality Reduction of Data with Mirroring Neural Networks},
author={Dasika Ratna Deepthi, G.R.Aditya Krishna and K. Eswaran},
journal={IEEE International Conference on Advances in Computer Vision an... | deepthi2007automatic |
arxiv-2026 | 0712.0948 | A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming | <|reference_start|>A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming: Logic programming under the answer-set semantics nowadays deals with numerous different notions of program equivalence. This is due to the fact that equivalence for substitution (known as strong equivalence)... | arxiv | @article{woltran2007a,
title={A Common View on Strong, Uniform, and Other Notions of Equivalence in
Answer-Set Programming},
author={Stefan Woltran},
journal={arXiv preprint arXiv:0712.0948},
year={2007},
archivePrefix={arXiv},
eprint={0712.0948},
primaryClass={cs.AI cs.LO}
} | woltran2007a |
arxiv-2027 | 0712.0975 | Random quantum codes from Gaussian ensembles and an uncertainty relation | <|reference_start|>Random quantum codes from Gaussian ensembles and an uncertainty relation: Using random Gaussian vectors and an information-uncertainty relation, we give a proof that the coherent information is an achievable rate for entanglement transmission through a noisy quantum channel. The codes are random subs... | arxiv | @article{hayden2007random,
title={Random quantum codes from Gaussian ensembles and an uncertainty relation},
author={Patrick Hayden, Peter W. Shor, Andreas Winter},
journal={Open Syst. Inf. Dyn. 15 (2008) 71-89},
year={2007},
doi={10.1142/S1230161208000079},
archivePrefix={arXiv},
eprint={07... | hayden2007random |
arxiv-2028 | 0712.1014 | Characterization Of A Class Of Graphs Related To Pairs Of Disjoint Matchings | <|reference_start|>Characterization Of A Class Of Graphs Related To Pairs Of Disjoint Matchings: For a given graph consider a pair of disjoint matchings the union of which contains as many edges as possible. Furthermore, consider the relation of the cardinalities of a maximum matching and the largest matching in those ... | arxiv | @article{tserunyan2007characterization,
title={Characterization Of A Class Of Graphs Related To Pairs Of Disjoint
Matchings},
author={A. V. Tserunyan},
journal={Discrete Mathematics 309 (2009) 693--713},
year={2007},
doi={10.1016/j.disc.2008.01.004},
archivePrefix={arXiv},
eprint={0712.101... | tserunyan2007characterization |
arxiv-2029 | 0712.1037 | The Importance of Being First: Position Dependent Citation Rates on arXiv:astro-ph | <|reference_start|>The Importance of Being First: Position Dependent Citation Rates on arXiv:astro-ph: We study the dependence of citation counts of e-prints published on the arXiv:astro-ph server on their position in the daily astro-ph listing. Using the SPIRES literature database we reconstruct the astro-ph listings ... | arxiv | @article{dietrich2007the,
title={The Importance of Being First: Position Dependent Citation Rates on
arXiv:astro-ph},
author={J. P. Dietrich},
journal={arXiv preprint arXiv:0712.1037},
year={2007},
doi={10.1086/527522},
archivePrefix={arXiv},
eprint={0712.1037},
primaryClass={astro-ph ... | dietrich2007the |
arxiv-2030 | 0712.1097 | On Using Unsatisfiability for Solving Maximum Satisfiability | <|reference_start|>On Using Unsatisfiability for Solving Maximum Satisfiability: Maximum Satisfiability (MaxSAT) is a well-known optimization pro- blem, with several practical applications. The most widely known MAXS AT algorithms are ineffective at solving hard problems instances from practical application domains. Re... | arxiv | @article{marques-silva2007on,
title={On Using Unsatisfiability for Solving Maximum Satisfiability},
author={Joao Marques-Silva, Jordi Planes},
journal={arXiv preprint arXiv:0712.1097},
year={2007},
archivePrefix={arXiv},
eprint={0712.1097},
primaryClass={cs.AI cs.DS}
} | marques-silva2007on |
arxiv-2031 | 0712.1163 | Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement | <|reference_start|>Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement: Identifying strongly connected substructures in large networks provides insight into their coarse-grained organization. Several approaches based on the optimization of a quality function, e.g., the modularity... | arxiv | @article{schuetz2007efficient,
title={Efficient modularity optimization by multistep greedy algorithm and
vertex mover refinement},
author={Philipp Schuetz and Amedeo Caflisch},
journal={Phys. Rev. E 77,046112 (2008)},
year={2007},
doi={10.1103/PhysRevE.77.046112},
archivePrefix={arXiv},
e... | schuetz2007efficient |
arxiv-2032 | 0712.1167 | Transactional WaveCache: Towards Speculative and Out-of-Order DataFlow Execution of Memory Operations | <|reference_start|>Transactional WaveCache: Towards Speculative and Out-of-Order DataFlow Execution of Memory Operations: The WaveScalar is the first DataFlow Architecture that can efficiently provide the sequential memory semantics required by imperative languages. This work presents an alternative memory ordering mec... | arxiv | @article{marzulo2007transactional,
title={Transactional WaveCache: Towards Speculative and Out-of-Order DataFlow
Execution of Memory Operations},
author={Leandro A. J. Marzulo, Felipe M. G. Franc{c}a and V'itor Santos
Costa},
journal={arXiv preprint arXiv:0712.1167},
year={2007},
archivePrefix={... | marzulo2007transactional |
arxiv-2033 | 0712.1169 | Opportunistic Relaying in Wireless Networks | <|reference_start|>Opportunistic Relaying in Wireless Networks: Relay networks having $n$ source-to-destination pairs and $m$ half-duplex relays, all operating in the same frequency band in the presence of block fading, are analyzed. This setup has attracted significant attention and several relaying protocols have bee... | arxiv | @article{cui2007opportunistic,
title={Opportunistic Relaying in Wireless Networks},
author={Shengshan Cui, Alexander M. Haimovich, Oren Somekh and H. Vincent Poor},
journal={arXiv preprint arXiv:0712.1169},
year={2007},
doi={10.1109/TIT.2009.2030435},
archivePrefix={arXiv},
eprint={0712.1169... | cui2007opportunistic |
arxiv-2034 | 0712.1182 | Cumulative and Averaging Fission of Beliefs | <|reference_start|>Cumulative and Averaging Fission of Beliefs: Belief fusion is the principle of combining separate beliefs or bodies of evidence originating from different sources. Depending on the situation to be modelled, different belief fusion methods can be applied. Cumulative and averaging belief fusion is defi... | arxiv | @article{josang2007cumulative,
title={Cumulative and Averaging Fission of Beliefs},
author={Audun Josang},
journal={arXiv preprint arXiv:0712.1182},
year={2007},
archivePrefix={arXiv},
eprint={0712.1182},
primaryClass={cs.AI cs.LO}
} | josang2007cumulative |
arxiv-2035 | 0712.1189 | Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems - Report on the Workshop ICOOOLPS'2007 at ECOOP'07 | <|reference_start|>Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems - Report on the Workshop ICOOOLPS'2007 at ECOOP'07: ICOOOLPS'2007 was the second edition of the ECOOP-ICOOOLPS workshop. ICOOOLPS intends to bring researchers and practitioners both from academia and industry... | arxiv | @article{zendra2007implementation,,
title={Implementation, Compilation, Optimization of Object-Oriented Languages,
Programs and Systems - Report on the Workshop ICOOOLPS'2007 at ECOOP'07},
author={Olivier Zendra (INRIA Lorraine - LORIA), Eric Jul (DIKU), Roland
Ducournau (LIRMM), Etienne Gagnon, Richard E. ... | zendra2007implementation, |
arxiv-2036 | 0712.1205 | Lambda-RBAC: Programming with Role-Based Access Control | <|reference_start|>Lambda-RBAC: Programming with Role-Based Access Control: We study mechanisms that permit program components to express role constraints on clients, focusing on programmatic security mechanisms, which permit access controls to be expressed, in situ, as part of the code realizing basic functionality. I... | arxiv | @article{jagadeesan2007lambda-rbac:,
title={Lambda-RBAC: Programming with Role-Based Access Control},
author={Radha Jagadeesan, Alan Jeffrey, Corin Pitcher, James Riely},
journal={Logical Methods in Computer Science, Volume 4, Issue 1 (January 9,
2008) lmcs:1195},
year={2007},
doi={10.2168/LMCS-4(... | jagadeesan2007lambda-rbac: |
arxiv-2037 | 0712.1224 | Evaluating the Utility of Anonymized Network Traces for Intrusion Detection | <|reference_start|>Evaluating the Utility of Anonymized Network Traces for Intrusion Detection: Anonymization is the process of removing or hiding sensitive information in logs. Anonymization allows organizations to share network logs while not exposing sensitive information. However, there is an inherent trade off bet... | arxiv | @article{lakkaraju2007evaluating,
title={Evaluating the Utility of Anonymized Network Traces for Intrusion
Detection},
author={Kiran Lakkaraju, Adam Slagell},
journal={arXiv preprint arXiv:0712.1224},
year={2007},
archivePrefix={arXiv},
eprint={0712.1224},
primaryClass={cs.CR}
} | lakkaraju2007evaluating |
arxiv-2038 | 0712.1279 | Kleene, Rogers and Rice Theorems Revisited in C and in Bash | <|reference_start|>Kleene, Rogers and Rice Theorems Revisited in C and in Bash: The recursion theorem in the weak form {e}(z)=x(e,z) (universal function not needed) and in Rogers form {n}(z)={{x}(n)}(z) and Rice theorem are proved a first time using programs in C, and a second time with scripts in Bash.<|reference_end|... | arxiv | @article{caporaso2007kleene,,
title={Kleene, Rogers and Rice Theorems Revisited in C and in Bash},
author={Salvatore Caporaso and Nicola Corriero},
journal={arXiv preprint arXiv:0712.1279},
year={2007},
archivePrefix={arXiv},
eprint={0712.1279},
primaryClass={cs.LO}
} | caporaso2007kleene, |
arxiv-2039 | 0712.1309 | Complex base numeral systems | <|reference_start|>Complex base numeral systems: In this paper will be introduced large, probably complete family of complex base systems, which are 'proper' - for each point of the space there is a representation which is unique for all but some zero measure set. The condition defining this family is the periodicity -... | arxiv | @article{duda2007complex,
title={Complex base numeral systems},
author={Jarek Duda},
journal={arXiv preprint arXiv:0712.1309},
year={2007},
archivePrefix={arXiv},
eprint={0712.1309},
primaryClass={math.DS cs.DM}
} | duda2007complex |
arxiv-2040 | 0712.1310 | About Algorithm for Transformation of Logic Functions (ATLF) | <|reference_start|>About Algorithm for Transformation of Logic Functions (ATLF): In this article the algorithm for transformation of logic functions which are given by truth tables is considered. The suggested algorithm allows the transformation of many-valued logic functions with the required number of variables and c... | arxiv | @article{cherbanski2007about,
title={About Algorithm for Transformation of Logic Functions (ATLF)},
author={Lev Cherbanski},
journal={arXiv preprint arXiv:0712.1310},
year={2007},
archivePrefix={arXiv},
eprint={0712.1310},
primaryClass={cs.LO cs.AI}
} | cherbanski2007about |
arxiv-2041 | 0712.1337 | Axiomatizing rational power series | <|reference_start|>Axiomatizing rational power series: Iteration semirings are Conway semirings satisfying Conway's group identities. We show that the semirings $\N^{\rat}\llangle \Sigma^* \rrangle$ of rational power series with coefficients in the semiring $\N$ of natural numbers are the free partial iteration semirin... | arxiv | @article{bloom2007axiomatizing,
title={Axiomatizing rational power series},
author={S. L. Bloom, Z. Esik},
journal={arXiv preprint arXiv:0712.1337},
year={2007},
archivePrefix={arXiv},
eprint={0712.1337},
primaryClass={cs.LO cs.DM}
} | bloom2007axiomatizing |
arxiv-2042 | 0712.1339 | Joint Receiver and Transmitter Optimization for Energy-Efficient CDMA Communications | <|reference_start|>Joint Receiver and Transmitter Optimization for Energy-Efficient CDMA Communications: This paper focuses on the cross-layer issue of joint multiuser detection and resource allocation for energy efficiency in wireless CDMA networks. In particular, assuming that a linear multiuser detector is adopted i... | arxiv | @article{buzzi2007joint,
title={Joint Receiver and Transmitter Optimization for Energy-Efficient CDMA
Communications},
author={Stefano Buzzi and H. Vincent Poor},
journal={arXiv preprint arXiv:0712.1339},
year={2007},
archivePrefix={arXiv},
eprint={0712.1339},
primaryClass={cs.IT cs.GT mat... | buzzi2007joint |
arxiv-2043 | 0712.1345 | Sequential operators in computability logic | <|reference_start|>Sequential operators in computability logic: Computability logic (CL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a semantical platform and research program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth which it has more traditionally been.... | arxiv | @article{japaridze2007sequential,
title={Sequential operators in computability logic},
author={Giorgi Japaridze},
journal={Information and Computation 206 (2008), pp. 1443-1475},
year={2007},
doi={10.1016/j.ic.2008.10.001},
archivePrefix={arXiv},
eprint={0712.1345},
primaryClass={cs.LO c... | japaridze2007sequential |
arxiv-2044 | 0712.1359 | Borel Ranks and Wadge Degrees of Context Free Omega Languages | <|reference_start|>Borel Ranks and Wadge Degrees of Context Free Omega Languages: We show that, from a topological point of view, considering the Borel and the Wadge hierarchies, 1-counter B\"uchi automata have the same accepting power than Turing machines equipped with a B\"uchi acceptance condition. In particular, fo... | arxiv | @article{finkel2007borel,
title={Borel Ranks and Wadge Degrees of Context Free Omega Languages},
author={Olivier Finkel (ELM)},
journal={Mathematical Structures in Computer Science 16 (5) (2006) 813-840},
year={2007},
archivePrefix={arXiv},
eprint={0712.1359},
primaryClass={cs.LO cs.GT math.... | finkel2007borel |
arxiv-2045 | 0712.1363 | Undecidable Problems About Timed Automata | <|reference_start|>Undecidable Problems About Timed Automata: We solve some decision problems for timed automata which were recently raised by S. Tripakis in [ Folk Theorems on the Determinization and Minimization of Timed Automata, in the Proceedings of the International Workshop FORMATS'2003, LNCS, Volume 2791, p. 18... | arxiv | @article{finkel2007undecidable,
title={Undecidable Problems About Timed Automata},
author={Olivier Finkel (ELM)},
journal={Dans Proceedings of the 4th International Conference on Formal
Modelling and Analysis of Timed Systems - FORMATS'06, France (2006)},
year={2007},
archivePrefix={arXiv},
ep... | finkel2007undecidable |
arxiv-2046 | 0712.1365 | Population stratification using a statistical model on hypergraphs | <|reference_start|>Population stratification using a statistical model on hypergraphs: Population stratification is a problem encountered in several areas of biology and public health. We tackle this problem by mapping a population and its elements attributes into a hypergraph, a natural extension of the concept of gra... | arxiv | @article{vazquez2007population,
title={Population stratification using a statistical model on hypergraphs},
author={Alexei Vazquez},
journal={Phys. Rev. E 77, 066106 (2008)},
year={2007},
doi={10.1103/PhysRevE.77.066106},
archivePrefix={arXiv},
eprint={0712.1365},
primaryClass={q-bio.PE ... | vazquez2007population |
arxiv-2047 | 0712.1400 | Birthday attack to discrete logarithm | <|reference_start|>Birthday attack to discrete logarithm: The discrete logarithm in a finite group of large order has been widely applied in public key cryptosystem. In this paper, we will present a probabilistic algorithm for discrete logarithm.<|reference_end|> | arxiv | @article{li2007birthday,
title={Birthday attack to discrete logarithm},
author={An-Ping Li},
journal={arXiv preprint arXiv:0712.1400},
year={2007},
archivePrefix={arXiv},
eprint={0712.1400},
primaryClass={cs.CR}
} | li2007birthday |
arxiv-2048 | 0712.1402 | Reconstruction of Markov Random Fields from Samples: Some Easy Observations and Algorithms | <|reference_start|>Reconstruction of Markov Random Fields from Samples: Some Easy Observations and Algorithms: Markov random fields are used to model high dimensional distributions in a number of applied areas. Much recent interest has been devoted to the reconstruction of the dependency structure from independent samp... | arxiv | @article{bresler2007reconstruction,
title={Reconstruction of Markov Random Fields from Samples: Some Easy
Observations and Algorithms},
author={Guy Bresler, Elchanan Mossel, Allan Sly},
journal={arXiv preprint arXiv:0712.1402},
year={2007},
archivePrefix={arXiv},
eprint={0712.1402},
primar... | bresler2007reconstruction |
arxiv-2049 | 0712.1442 | On types of growth for graph-different permutations | <|reference_start|>On types of growth for graph-different permutations: We consider an infinite graph G whose vertex set is the set of natural numbers and adjacency depends solely on the difference between vertices. We study the largest cardinality of a set of permutations of [n] any pair of which differ somewhere in a... | arxiv | @article{körner2007on,
title={On types of growth for graph-different permutations},
author={J'anos K"orner, G'abor Simonyi, Blerina Sinaimeri},
journal={arXiv preprint arXiv:0712.1442},
year={2007},
archivePrefix={arXiv},
eprint={0712.1442},
primaryClass={math.CO cs.IT math.IT}
} | körner2007on |
arxiv-2050 | 0712.1499 | On the computational complexity of cut-reduction | <|reference_start|>On the computational complexity of cut-reduction: Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all the known re... | arxiv | @article{aehlig2007on,
title={On the computational complexity of cut-reduction},
author={Klaus Aehlig, Arnold Beckmann},
journal={arXiv preprint arXiv:0712.1499},
year={2007},
number={CSR15-2007},
archivePrefix={arXiv},
eprint={0712.1499},
primaryClass={cs.LO cs.CC}
} | aehlig2007on |
arxiv-2051 | 0712.1519 | Discrete Nondeterminism and Nash Equilibria for Strategy-Based Games | <|reference_start|>Discrete Nondeterminism and Nash Equilibria for Strategy-Based Games: Several notions of game enjoy a Nash-like notion of equilibrium without guarantee of existence. There are different ways of weakening a definition of Nash-like equilibrium in order to guarantee the existence of a weakened equilibri... | arxiv | @article{roux2007discrete,
title={Discrete Nondeterminism and Nash Equilibria for Strategy-Based Games},
author={St'ephane Le Roux (LIP)},
journal={arXiv preprint arXiv:0712.1519},
year={2007},
archivePrefix={arXiv},
eprint={0712.1519},
primaryClass={cs.GT}
} | roux2007discrete |
arxiv-2052 | 0712.1521 | Graphs and Path Equilibria | <|reference_start|>Graphs and Path Equilibria: The quest for optimal/stable paths in graphs has gained attention in a few practical or theoretical areas. To take part in this quest this chapter adopts an equilibrium-oriented approach that is abstract and general: it works with (quasi-arbitrary) arc-labelled digraphs, a... | arxiv | @article{roux2007graphs,
title={Graphs and Path Equilibria},
author={St'ephane Le Roux (LIP)},
journal={arXiv preprint arXiv:0712.1521},
year={2007},
archivePrefix={arXiv},
eprint={0712.1521},
primaryClass={cs.GT}
} | roux2007graphs |
arxiv-2053 | 0712.1529 | Ontology and Formal Semantics - Integration Overdue | <|reference_start|>Ontology and Formal Semantics - Integration Overdue: In this note we suggest that difficulties encountered in natural language semantics are, for the most part, due to the use of mere symbol manipulation systems that are devoid of any content. In such systems, where there is hardly any link with our ... | arxiv | @article{saba2007ontology,
title={Ontology and Formal Semantics - Integration Overdue},
author={Walid S. Saba},
journal={arXiv preprint arXiv:0712.1529},
year={2007},
archivePrefix={arXiv},
eprint={0712.1529},
primaryClass={cs.AI cs.CL}
} | saba2007ontology |
arxiv-2054 | 0712.1532 | Hard constraint satisfaction problems have hard gaps at location 1 | <|reference_start|>Hard constraint satisfaction problems have hard gaps at location 1: An instance of Max CSP is a finite collection of constraints on a set of variables, and the goal is to assign values to the variables that maximises the number of satisfied constraints. Max CSP captures many well-known problems (such... | arxiv | @article{jonsson2007hard,
title={Hard constraint satisfaction problems have hard gaps at location 1},
author={Peter Jonsson, Andrei Krokhin, Fredrik Kuivinen},
journal={arXiv preprint arXiv:0712.1532},
year={2007},
archivePrefix={arXiv},
eprint={0712.1532},
primaryClass={cs.CC}
} | jonsson2007hard |
arxiv-2055 | 0712.1549 | Dynamic Multilevel Graph Visualization | <|reference_start|>Dynamic Multilevel Graph Visualization: We adapt multilevel, force-directed graph layout techniques to visualizing dynamic graphs in which vertices and edges are added and removed in an online fashion (i.e., unpredictably). We maintain multiple levels of coarseness using a dynamic, randomized coarsen... | arxiv | @article{veldhuizen2007dynamic,
title={Dynamic Multilevel Graph Visualization},
author={Todd L. Veldhuizen},
journal={arXiv preprint arXiv:0712.1549},
year={2007},
archivePrefix={arXiv},
eprint={0712.1549},
primaryClass={cs.GR cs.DM}
} | veldhuizen2007dynamic |
arxiv-2056 | 0712.1609 | Distributed Consensus Algorithms in Sensor Networks: Quantized Data and Random Link Failures | <|reference_start|>Distributed Consensus Algorithms in Sensor Networks: Quantized Data and Random Link Failures: The paper studies the problem of distributed average consensus in sensor networks with quantized data and random link failures. To achieve consensus, dither (small noise) is added to the sensor states before... | arxiv | @article{kar2007distributed,
title={Distributed Consensus Algorithms in Sensor Networks: Quantized Data and
Random Link Failures},
author={Soummya Kar and Jose M.F.Moura},
journal={arXiv preprint arXiv:0712.1609},
year={2007},
archivePrefix={arXiv},
eprint={0712.1609},
primaryClass={cs.MA ... | kar2007distributed |
arxiv-2057 | 0712.1655 | Virtual Laboratories and Virtual Worlds | <|reference_start|>Virtual Laboratories and Virtual Worlds: Since we cannot put stars in a laboratory, astrophysicists had to wait till the invention of computers before becoming laboratory scientists. For half a century now, we have been conducting experiments in our virtual laboratories. However, we ourselves have re... | arxiv | @article{hut2007virtual,
title={Virtual Laboratories and Virtual Worlds},
author={Piet Hut (IAS, Princeton)},
journal={arXiv preprint arXiv:0712.1655},
year={2007},
doi={10.1017/S1743921308016153},
archivePrefix={arXiv},
eprint={0712.1655},
primaryClass={astro-ph cs.HC physics.comp-ph}
} | hut2007virtual |
arxiv-2058 | 0712.1658 | Program algebra with a jump-shift instruction | <|reference_start|>Program algebra with a jump-shift instruction: We study sequential programs that are instruction sequences with jump-shift instructions in the setting of PGA (ProGram Algebra). Jump-shift instructions preceding a jump instruction increase the position to jump to. The jump-shift instruction is not fou... | arxiv | @article{bergstra2007program,
title={Program algebra with a jump-shift instruction},
author={J. A. Bergstra, C. A. Middelburg},
journal={Journal of Applied Logic, 6(4):553--563, 2008},
year={2007},
doi={10.1016/j.jal.2008.07.001},
number={PRG0711},
archivePrefix={arXiv},
eprint={0712.165... | bergstra2007program |
arxiv-2059 | 0712.1659 | Non-linear and Linear Broadcasting with QoS Requirements: Tractable Approaches for Bounded Channel Uncertainties | <|reference_start|>Non-linear and Linear Broadcasting with QoS Requirements: Tractable Approaches for Bounded Channel Uncertainties: We consider the downlink of a cellular system in which the base station employs multiple transmit antennas, each receiver has a single antenna, and the users specify. We consider communic... | arxiv | @article{shenouda2007non-linear,
title={Non-linear and Linear Broadcasting with QoS Requirements: Tractable
Approaches for Bounded Channel Uncertainties},
author={Michael Botros Shenouda and Timothy N. Davidson},
journal={arXiv preprint arXiv:0712.1659},
year={2007},
archivePrefix={arXiv},
epr... | shenouda2007non-linear |
arxiv-2060 | 0712.1662 | Link Scheduling in STDMA Wireless Networks: A Line Graph Approach | <|reference_start|>Link Scheduling in STDMA Wireless Networks: A Line Graph Approach: We consider point to point link scheduling in Spatial Time Division Multiple Access (STDMA) wireless networks under the physical interference model. We propose a novel link scheduling algorithm based on a line graph representation of ... | arxiv | @article{kumar2007link,
title={Link Scheduling in STDMA Wireless Networks: A Line Graph Approach},
author={N. Praneeth Kumar, Ashutosh Deepak Gore and Abhay Karandikar},
journal={arXiv preprint arXiv:0712.1662},
year={2007},
archivePrefix={arXiv},
eprint={0712.1662},
primaryClass={cs.NI}
} | kumar2007link |
arxiv-2061 | 0712.1759 | A Web-based System for Observing and Analyzing Computer Mediated Communications | <|reference_start|>A Web-based System for Observing and Analyzing Computer Mediated Communications: Tracking data of user's activities resulting from Computer Mediated Communication (CMC) tools (forum, chat, etc.) is often carried out in an ad-hoc manner, which either confines the reusability of data in different purpo... | arxiv | @article{may2007a,
title={A Web-based System for Observing and Analyzing Computer Mediated
Communications},
author={Madeth May (LIESP), S'ebastien George (LIESP), Patrick Pr'ev^ot
(LIESP)},
journal={Dans Proceedings of the IEEE/WIC/ACM International Conference on
Web Intelligence (WI 2006) - IEEE/WIC/... | may2007a |
arxiv-2062 | 0712.1765 | Solving Simple Stochastic Games with Few Random Vertices | <|reference_start|>Solving Simple Stochastic Games with Few Random Vertices: Simple stochastic games are two-player zero-sum stochastic games with turn-based moves, perfect information, and reachability winning conditions. We present two new algorithms computing the values of simple stochastic games. Both of them rely ... | arxiv | @article{gimbert2007solving,
title={Solving Simple Stochastic Games with Few Random Vertices},
author={Hugo Gimbert (LaBRI), Florian Horn (LIAFA, Cwi)},
journal={Logical Methods in Computer Science, Volume 5, Issue 2 (May 25,
2009) lmcs:1119},
year={2007},
doi={10.2168/LMCS-5(2:9)2009},
archiv... | gimbert2007solving |
arxiv-2063 | 0712.1768 | Conceptions et usages des plates-formes de formation, Revue Sciences et Technologies de l'Information et de la Communication pour l'\'Education et la Formation | <|reference_start|>Conceptions et usages des plates-formes de formation, Revue Sciences et Technologies de l'Information et de la Communication pour l'\'Education et la Formation: Educative platforms are at the heart of the development of online education. They can not only be reduced to technological aspects. Underlyi... | arxiv | @article{george2007conceptions,
title={Conceptions et usages des plates-formes de formation, Revue Sciences et
Technologies de l'Information et de la Communication pour l'\'Education et la
Formation},
author={S'ebastien George (LIESP), Alain Derycke (TRIGONE)},
journal={Sciences et Technologies de l'Inf... | george2007conceptions |
arxiv-2064 | 0712.1775 | On Computation of Error Locations and Values in Hermitian Codes | <|reference_start|>On Computation of Error Locations and Values in Hermitian Codes: We obtain a technique to reduce the computational complexity associated with decoding of Hermitian codes. In particular, we propose a method to compute the error locations and values using an uni-variate error locator and an uni-variate... | arxiv | @article{agarwal2007on,
title={On Computation of Error Locations and Values in Hermitian Codes},
author={Rachit Agarwal},
journal={arXiv preprint arXiv:0712.1775},
year={2007},
archivePrefix={arXiv},
eprint={0712.1775},
primaryClass={cs.IT math.IT}
} | agarwal2007on |
arxiv-2065 | 0712.1800 | Conception d'outils de communication sp\'ecifiques au contexte \'educatif | <|reference_start|>Conception d'outils de communication sp\'ecifiques au contexte \'educatif: In a distance learning context, providing usual communication tools (forum, chat, ...) is not always enough to create efficient interactions between learners and to favour collective knowledge building. A solution consists in ... | arxiv | @article{george2007conception,
title={Conception d'outils de communication sp\'ecifiques au contexte
\'educatif},
author={S'ebastien George (LIESP), C'ecile Bothorel (TECH/EASY)},
journal={Sciences et Technologies de l'Information et de la Communication
pour l'Education et la Formation 13 (2007) 317-344... | george2007conception |
arxiv-2066 | 0712.1803 | Tournament MAC with Constant Size Congestion Window for WLAN | <|reference_start|>Tournament MAC with Constant Size Congestion Window for WLAN: In the context of radio distributed networks, we present a generalized approach for the Medium Access Control (MAC) with fixed congestion window. Our protocol is quite simple to analyze and can be used in a lot of different situations. We ... | arxiv | @article{galtier2007tournament,
title={Tournament MAC with Constant Size Congestion Window for WLAN},
author={Jerome Galtier (INRIA Sophia Antipolis)},
journal={arXiv preprint arXiv:0712.1803},
year={2007},
archivePrefix={arXiv},
eprint={0712.1803},
primaryClass={cs.NI}
} | galtier2007tournament |
arxiv-2067 | 0712.1854 | Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks | <|reference_start|>Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks: This work started out with our accidental discovery of a pattern of throughput distributions among links in IEEE 802.11 networks from experimental results. This pattern gives rise to an easy computation method, wh... | arxiv | @article{liew2007back-of-the-envelope,
title={Back-of-the-Envelope Computation of Throughput Distributions in CSMA
Wireless Networks},
author={S.C. Liew, C. Kai, J. Leung, B. Wong},
journal={arXiv preprint arXiv:0712.1854},
year={2007},
archivePrefix={arXiv},
eprint={0712.1854},
primaryCla... | liew2007back-of-the-envelope |
arxiv-2068 | 0712.1863 | Constructing Bio-molecular Databases on a DNA-based Computer | <|reference_start|>Constructing Bio-molecular Databases on a DNA-based Computer: Codd [Codd 1970] wrote the first paper in which the model of a relational database was proposed. Adleman [Adleman 1994] wrote the first paper in which DNA strands in a test tube were used to solve an instance of the Hamiltonian path proble... | arxiv | @article{chang2007constructing,
title={Constructing Bio-molecular Databases on a DNA-based Computer},
author={Weng-Long Chang, Michael (Shan-Hui) Ho, and Minyi Guo},
journal={arXiv preprint arXiv:0712.1863},
year={2007},
archivePrefix={arXiv},
eprint={0712.1863},
primaryClass={cs.NE cs.DB q-... | chang2007constructing |
arxiv-2069 | 0712.1869 | Two-connected graphs with prescribed three-connected components | <|reference_start|>Two-connected graphs with prescribed three-connected components: We adapt the classical 3-decomposition of any 2-connected graph to the case of simple graphs (no loops or multiple edges). By analogy with the block-cutpoint tree of a connected graph, we deduce from this decomposition a bicolored tree ... | arxiv | @article{gagarin2007two-connected,
title={Two-connected graphs with prescribed three-connected components},
author={Andrei Gagarin (1), Gilbert Labelle (2), Pierre Leroux (2) and Timothy
Walsh (2) ((1) Acadia Un. Wolfville N. S. Canada, (2) LaCIM UQAM Montreal Qc
Canada)},
journal={Adv. in Appl. Math. 4... | gagarin2007two-connected |
arxiv-2070 | 0712.1875 | Critique du rapport signal \`a bruit en th\'eorie de l'information -- A critical appraisal of the signal to noise ratio in information theory | <|reference_start|>Critique du rapport signal \`a bruit en th\'eorie de l'information -- A critical appraisal of the signal to noise ratio in information theory: The signal to noise ratio, which plays such an important role in information theory, is shown to become pointless in digital communications where - symbols ar... | arxiv | @article{fliess2007critique,
title={Critique du rapport signal \`a bruit en th\'eorie de l'information -- A
critical appraisal of the signal to noise ratio in information theory},
author={Michel Fliess (INRIA Futurs)},
journal={arXiv preprint arXiv:0712.1875},
year={2007},
archivePrefix={arXiv},
... | fliess2007critique |
arxiv-2071 | 0712.1878 | Hierarchy construction schemes within the Scale set framework | <|reference_start|>Hierarchy construction schemes within the Scale set framework: Segmentation algorithms based on an energy minimisation framework often depend on a scale parameter which balances a fit to data and a regularising term. Irregular pyramids are defined as a stack of graphs successively reduced. Within thi... | arxiv | @article{pruvot2007hierarchy,
title={Hierarchy construction schemes within the Scale set framework},
author={Jean Hugues Pruvot (GREYC), Luc Brun (GREYC)},
journal={Dans Graph-Based Representations in Pattern Recognition - Graph
based Representation 2007, Alicante : Espagne (2007)},
year={2007},
a... | pruvot2007hierarchy |
arxiv-2072 | 0712.1916 | Ranking forestry journals using the h-index | <|reference_start|>Ranking forestry journals using the h-index: An expert ranking of forestry journals was compared with journal impact factors and h-indices computed from the ISI Web of Science and internet-based data. Citations reported by Google Scholar appear to offer the most efficient way to rank all journals obj... | arxiv | @article{vanclay2007ranking,
title={Ranking forestry journals using the h-index},
author={Jerome K. Vanclay},
journal={Journal of Informetrics 2 (2008) 326-334},
year={2007},
doi={10.1016/j.joi.2008.07.002},
archivePrefix={arXiv},
eprint={0712.1916},
primaryClass={cs.DL}
} | vanclay2007ranking |
arxiv-2073 | 0712.1928 | Distribution of Edge Load in Scale-free Trees | <|reference_start|>Distribution of Edge Load in Scale-free Trees: Node betweenness has been studied recently by a number of authors, but until now less attention has been paid to edge betweenness. In this paper, we present an exact analytic study of edge betweenness in evolving scale-free and non-scale-free trees. We a... | arxiv | @article{fekete2007distribution,
title={Distribution of Edge Load in Scale-free Trees},
author={Attila Fekete, G'abor Vattay, Ljupco Kocarev},
journal={Phys. Rev. E 73, 046102 (2006)},
year={2007},
doi={10.1103/PhysRevE.73.046102},
archivePrefix={arXiv},
eprint={0712.1928},
primaryClass=... | fekete2007distribution |
arxiv-2074 | 0712.1959 | Delaunay Edge Flips in Dense Surface Triangulations | <|reference_start|>Delaunay Edge Flips in Dense Surface Triangulations: Delaunay flip is an elegant, simple tool to convert a triangulation of a point set to its Delaunay triangulation. The technique has been researched extensively for full dimensional triangulations of point sets. However, an important case of triangu... | arxiv | @article{cheng2007delaunay,
title={Delaunay Edge Flips in Dense Surface Triangulations},
author={Siu-Wing Cheng and Tamal K. Dey},
journal={arXiv preprint arXiv:0712.1959},
year={2007},
archivePrefix={arXiv},
eprint={0712.1959},
primaryClass={cs.CG cs.DS}
} | cheng2007delaunay |
arxiv-2075 | 0712.1987 | A New Outer Bound and the Noisy-Interference Sum-Rate Capacity for Gaussian Interference Channels | <|reference_start|>A New Outer Bound and the Noisy-Interference Sum-Rate Capacity for Gaussian Interference Channels: A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genie-aided methods and is shown to give the sum-rate capacity for noisy... | arxiv | @article{shang2007a,
title={A New Outer Bound and the Noisy-Interference Sum-Rate Capacity for
Gaussian Interference Channels},
author={Xiaohu Shang, Gerhard Kramer, and Biao Chen},
journal={arXiv preprint arXiv:0712.1987},
year={2007},
doi={10.1109/TIT.2008.2009793},
archivePrefix={arXiv},
... | shang2007a |
arxiv-2076 | 0712.1994 | Knowledge Engineering Technique for Cluster Development | <|reference_start|>Knowledge Engineering Technique for Cluster Development: After the concept of industry cluster was tangibly applied in many countries, SMEs trended to link to each other to maintain their competitiveness in the market. The major key success factors of the cluster are knowledge sharing and collaborati... | arxiv | @article{sureephong2007knowledge,
title={Knowledge Engineering Technique for Cluster Development},
author={Pradorn Sureephong (LIESP, CAMT), Nopasit Chakpitak (CAMT), Yacine
Ouzrout (LIESP), Gilles Neubert (LIESP), Abdelaziz Bouras (LIESP)},
journal={Dans Proceeding of Knowledge Science, Engineering and M... | sureephong2007knowledge |
arxiv-2077 | 0712.1996 | A case study of the difficulty of quantifier elimination in constraint databases: the alibi query in moving object databases | <|reference_start|>A case study of the difficulty of quantifier elimination in constraint databases: the alibi query in moving object databases: In the constraint database model, spatial and spatio-temporal data are stored by boolean combinations of polynomial equalities and inequalities over the real numbers. The rela... | arxiv | @article{kuijpers2007a,
title={A case study of the difficulty of quantifier elimination in constraint
databases: the alibi query in moving object databases},
author={Bart Kuijpers, Walied Othman, Rafael Grimson},
journal={arXiv preprint arXiv:0712.1996},
year={2007},
archivePrefix={arXiv},
epr... | kuijpers2007a |
arxiv-2078 | 0712.2054 | Distributed Fair Scheduling Using Variable Transmission Lengths in Carrier-Sensing-based Wireless Networks | <|reference_start|>Distributed Fair Scheduling Using Variable Transmission Lengths in Carrier-Sensing-based Wireless Networks: The fairness of IEEE 802.11 wireless networks (including Wireless LAN and Ad-hoc networks) is hard to predict and control because of the randomness and complexity of the MAC contentions and dyn... | arxiv | @article{jiang2007distributed,
title={Distributed Fair Scheduling Using Variable Transmission Lengths in
Carrier-Sensing-based Wireless Networks},
author={Libin Jiang, Jean Walrand},
journal={arXiv preprint arXiv:0712.2054},
year={2007},
archivePrefix={arXiv},
eprint={0712.2054},
primaryCl... | jiang2007distributed |
arxiv-2079 | 0712.2063 | An axiomatic approach to intrinsic dimension of a dataset | <|reference_start|>An axiomatic approach to intrinsic dimension of a dataset: We perform a deeper analysis of an axiomatic approach to the concept of intrinsic dimension of a dataset proposed by us in the IJCNN'07 paper (arXiv:cs/0703125). The main features of our approach are that a high intrinsic dimension of a datas... | arxiv | @article{pestov2007an,
title={An axiomatic approach to intrinsic dimension of a dataset},
author={Vladimir Pestov},
journal={Neural Networks 21, 2-3 (2008), 204-213.},
year={2007},
archivePrefix={arXiv},
eprint={0712.2063},
primaryClass={cs.IR}
} | pestov2007an |
arxiv-2080 | 0712.2083 | VoIP over Multiple IEEE 80211 Wireless LANs | <|reference_start|>VoIP over Multiple IEEE 80211 Wireless LANs: Prior work indicates that 802.11 is extremely inefficient for VoIP transport. Only 12 and 60 VoIP sessions can be supported in an 802.11b and an 802.11g WLAN, respectively. This paper shows that the bad news does not stop there. When there are multiple WLA... | arxiv | @article{chan2007voip,
title={VoIP over Multiple IEEE 802.11 Wireless LANs},
author={A. Chan, S. C. Liew},
journal={arXiv preprint arXiv:0712.2083},
year={2007},
archivePrefix={arXiv},
eprint={0712.2083},
primaryClass={cs.NI}
} | chan2007voip |
arxiv-2081 | 0712.2094 | Hinged Dissections Exist | <|reference_start|>Hinged Dissections Exist: We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously without self-intersection to form any p... | arxiv | @article{abbott2007hinged,
title={Hinged Dissections Exist},
author={Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine,
Martin L. Demaine, Scott D. Kominers},
journal={Proceedings of the Twenty-fourth Annual Symposium on Computational
Geometry (2008): 110-119.},
year={2007},
doi={... | abbott2007hinged |
arxiv-2082 | 0712.2099 | MRI/TRUS data fusion for brachytherapy | <|reference_start|>MRI/TRUS data fusion for brachytherapy: BACKGROUND: Prostate brachytherapy consists in placing radioactive seeds for tumour destruction under transrectal ultrasound imaging (TRUS) control. It requires prostate delineation from the images for dose planning. Because ultrasound imaging is patient- and o... | arxiv | @article{daanen2007mri/trus,
title={MRI/TRUS data fusion for brachytherapy},
author={V. Daanen (TIMC), J. Gastaldo, J. Y. Giraud, P. Fourneret, J. L.
Descotes, M. Bolla, D. Collomb, Jocelyne Troccaz (TIMC)},
journal={International Journal of Medical Robotics and Computer Assisted
Surgery 2, 3 (2006) 256... | daanen2007mri/trus |
arxiv-2083 | 0712.2100 | Medical image computing and computer-aided medical interventions applied to soft tissues Work in progress in urology | <|reference_start|>Medical image computing and computer-aided medical interventions applied to soft tissues Work in progress in urology: Until recently, Computer-Aided Medical Interventions (CAMI) and Medical Robotics have focused on rigid and non deformable anatomical structures. Nowadays, special attention is paid to... | arxiv | @article{troccaz2007medical,
title={Medical image computing and computer-aided medical interventions applied
to soft tissues. Work in progress in urology},
author={Jocelyne Troccaz (TIMC), Michael Baumann (TIMC), Peter Berkelman
(TIMC), Philippe Cinquin (TIMC), Vincent Daanen (TIMC), Antoine Leroy (TIMC),
... | troccaz2007medical |
arxiv-2084 | 0712.2113 | On the deployment of Mobile Trusted Modules | <|reference_start|>On the deployment of Mobile Trusted Modules: In its recently published TCG Mobile Reference Architecture, the TCG Mobile Phone Work Group specifies a new concept to enable trust into future mobile devices. For this purpose, the TCG devises a trusted mobile platform as a set of trusted engines on beha... | arxiv | @article{schmidt2007on,
title={On the deployment of Mobile Trusted Modules},
author={Andreas U. Schmidt, Nicolai Kuntze and Michael Kasper},
journal={arXiv preprint arXiv:0712.2113},
year={2007},
doi={10.1109/WCNC.2008.553},
archivePrefix={arXiv},
eprint={0712.2113},
primaryClass={cs.CR}... | schmidt2007on |
arxiv-2085 | 0712.2141 | Numerical Sensitivity and Efficiency in the Treatment of Epistemic and Aleatory Uncertainty | <|reference_start|>Numerical Sensitivity and Efficiency in the Treatment of Epistemic and Aleatory Uncertainty: The treatment of both aleatory and epistemic uncertainty by recent methods often requires an high computational effort. In this abstract, we propose a numerical sampling method allowing to lighten the computa... | arxiv | @article{chojnacki2007numerical,
title={Numerical Sensitivity and Efficiency in the Treatment of Epistemic and
Aleatory Uncertainty},
author={Eric Chojnacki (IRSN), Jean Baccou (IRSN), S'ebastien Destercke
(IRSN, IRIT)},
journal={Fifth International Conference on Sensitivity Analysis of Model
Output, ... | chojnacki2007numerical |
arxiv-2086 | 0712.2168 | Study of conditions of use of E-services accessible to visually disabled persons | <|reference_start|>Study of conditions of use of E-services accessible to visually disabled persons: The aim of this paper is to determine the expectations that French-speaking disabled persons have for electronic administrative sites (utility). At the same time, it is a matter of identifying the difficulties of use th... | arxiv | @article{bobiller-chaumon2007study,
title={Study of conditions of use of E-services accessible to visually disabled
persons},
author={Marc-Eric Bobiller-Chaumon (GRePS), Michel Dubois (LIP - PC2S),
Franc{c}oise Sandoz-Guermond (LIESP)},
journal={Dans CEUR Workshop Proceedings - DEGAS'07 : Workshop of De... | bobiller-chaumon2007study |
arxiv-2087 | 0712.2182 | Optimal codes for correcting a single (wrap-around) burst of errors | <|reference_start|>Optimal codes for correcting a single (wrap-around) burst of errors: In 2007, Martinian and Trott presented codes for correcting a burst of erasures with a minimum decoding delay. Their construction employs [n,k] codes that can correct any burst of erasures (including wrap-around bursts) of length n-... | arxiv | @article{hollmann2007optimal,
title={Optimal codes for correcting a single (wrap-around) burst of errors},
author={Henk D.L. Hollmann and Ludo M.G.M. Tolhuizen},
journal={arXiv preprint arXiv:0712.2182},
year={2007},
archivePrefix={arXiv},
eprint={0712.2182},
primaryClass={cs.IT math.IT}
} | hollmann2007optimal |
arxiv-2088 | 0712.2183 | Apports des d\'emarches d'inspection et des tests d'usage dans l'\'evaluation de l'accessibilit\'e de E-services | <|reference_start|>Apports des d\'emarches d'inspection et des tests d'usage dans l'\'evaluation de l'accessibilit\'e de E-services: This article proposes to describe and compare the contributions of various techniques of evaluation of the accessibility of E-services carried out starting from (i) methods of inspection ... | arxiv | @article{bobiller-chaumon2007apports,
title={Apports des d\'emarches d'inspection et des tests d'usage dans
l'\'evaluation de l'accessibilit\'e de E-services},
author={Marc-Eric Bobiller-Chaumon (GRePS), Franc{c}oise Sandoz-Guermond
(LIESP)},
journal={Dans Actes du congr\`es ERGO IA'2006 - ERGO'IA : L'h... | bobiller-chaumon2007apports |
arxiv-2089 | 0712.2223 | Entanglement-Assisted Quantum Convolutional Coding | <|reference_start|>Entanglement-Assisted Quantum Convolutional Coding: We show how to protect a stream of quantum information from decoherence induced by a noisy quantum communication channel. We exploit preshared entanglement and a convolutional coding structure to develop a theory of entanglement-assisted quantum con... | arxiv | @article{wilde2007entanglement-assisted,
title={Entanglement-Assisted Quantum Convolutional Coding},
author={Mark M. Wilde and Todd A. Brun},
journal={Physical Review A 81, 042333 (2010)},
year={2007},
doi={10.1103/PhysRevA.81.042333},
number={CSI-07-12-01},
archivePrefix={arXiv},
eprint... | wilde2007entanglement-assisted |
arxiv-2090 | 0712.2231 | Trust for Location-based Authorisation | <|reference_start|>Trust for Location-based Authorisation: We propose a concept for authorisation using the location of a mobile device and the enforcement of location-based policies. Mobile devices enhanced by Trusted Computing capabilities operate an autonomous and secure location trigger and policy enforcement entit... | arxiv | @article{schmidt2007trust,
title={Trust for Location-based Authorisation},
author={Andreas U. Schmidt, Nicolai Kuntze and Joerg Abendroth},
journal={arXiv preprint arXiv:0712.2231},
year={2007},
doi={10.1109/WCNC.2008.552},
archivePrefix={arXiv},
eprint={0712.2231},
primaryClass={cs.CR}
... | schmidt2007trust |
arxiv-2091 | 0712.2235 | A Dynamic ID-based Remote User Authentication Scheme | <|reference_start|>A Dynamic ID-based Remote User Authentication Scheme: Password-based authentication schemes are the most widely used techniques for remote user authentication. Many static ID-based remote user authentication schemes both with and without smart cards have been proposed. Most of the schemes do not allo... | arxiv | @article{das2007a,
title={A Dynamic ID-based Remote User Authentication Scheme},
author={Manik Lal Das, Ashutosh Saxena, and Ved P. Gulati},
journal={IEEE Transactions on Consumer Electronics, Vol. 50, No. 2, 2004,
pp. 629-631},
year={2007},
doi={10.1109/TCE.2004.1309441},
archivePrefix={arXiv... | das2007a |
arxiv-2092 | 0712.2245 | Exact and Approximate Expressions for the Probability of Undetected Error of Varshamov-Tenengol'ts Codes | <|reference_start|>Exact and Approximate Expressions for the Probability of Undetected Error of Varshamov-Tenengol'ts Codes: Computation of the undetected error probability for error correcting codes over the Z-channel is an important issue, explored only in part in previous literature. In this paper we consider the ca... | arxiv | @article{baldi2007exact,
title={Exact and Approximate Expressions for the Probability of Undetected
Error of Varshamov-Tenengol'ts Codes},
author={Marco Baldi, Franco Chiaraluce and Torleiv Kl{o}ve},
journal={IEEE Transactions on Information Theory, ISSN 0018-9448, Vol. 54,
No. 11, pp. 5019-5029, Nov. 2... | baldi2007exact |
arxiv-2093 | 0712.2255 | Human-Machine Symbiosis, 50 Years On | <|reference_start|>Human-Machine Symbiosis, 50 Years On: Licklider advocated in 1960 the construction of computers capable of working symbiotically with humans to address problems not easily addressed by humans working alone. Since that time, many of the advances that he envisioned have been achieved, yet the time spen... | arxiv | @article{foster2007human-machine,
title={Human-Machine Symbiosis, 50 Years On},
author={Ian Foster},
journal={arXiv preprint arXiv:0712.2255},
year={2007},
archivePrefix={arXiv},
eprint={0712.2255},
primaryClass={cs.DC cs.CE cs.HC}
} | foster2007human-machine |
arxiv-2094 | 0712.2262 | The Earth System Grid: Supporting the Next Generation of Climate Modeling Research | <|reference_start|>The Earth System Grid: Supporting the Next Generation of Climate Modeling Research: Understanding the earth's climate system and how it might be changing is a preeminent scientific challenge. Global climate models are used to simulate past, present, and future climates, and experiments are executed c... | arxiv | @article{bernholdt2007the,
title={The Earth System Grid: Supporting the Next Generation of Climate
Modeling Research},
author={David Bernholdt, Shishir Bharathi, David Brown, Kasidit Chanchio,
Meili Chen, Ann Chervenak, Luca Cinquini, Bob Drach, Ian Foster, Peter Fox,
Jose Garcia, Carl Kesselman, Rob Mark... | bernholdt2007the |
arxiv-2095 | 0712.2274 | Distributed MAC Strategy for Exploiting Multi-user Diversity in Multi-rate IEEE 80211 Wireless LANs | <|reference_start|>Distributed MAC Strategy for Exploiting Multi-user Diversity in Multi-rate IEEE 80211 Wireless LANs: Fast rate adaptation has been established as an effective way to improve the PHY-layer raw date rate of wireless networks. However, within the current IEEE 802.11 legacy, MAC-layer throughput is domin... | arxiv | @article{chen2007distributed,
title={Distributed MAC Strategy for Exploiting Multi-user Diversity in
Multi-rate IEEE 802.11 Wireless LANs},
author={Da Rui Chen and Ying Jun (Angela) Zhang},
journal={arXiv preprint arXiv:0712.2274},
year={2007},
archivePrefix={arXiv},
eprint={0712.2274},
pr... | chen2007distributed |
arxiv-2096 | 0712.2302 | Data access optimizations for highly threaded multi-core CPUs with multiple memory controllers | <|reference_start|>Data access optimizations for highly threaded multi-core CPUs with multiple memory controllers: Processor and system architectures that feature multiple memory controllers are prone to show bottlenecks and erratic performance numbers on codes with regular access patterns. Although such effects are we... | arxiv | @article{hager2007data,
title={Data access optimizations for highly threaded multi-core CPUs with
multiple memory controllers},
author={Georg Hager, Thomas Zeiser, Gerhard Wellein},
journal={arXiv preprint arXiv:0712.2302},
year={2007},
archivePrefix={arXiv},
eprint={0712.2302},
primaryCla... | hager2007data |
arxiv-2097 | 0712.2371 | Maximum-rate, Minimum-Decoding-Complexity STBCs from Clifford Algebras | <|reference_start|>Maximum-rate, Minimum-Decoding-Complexity STBCs from Clifford Algebras: It is well known that Space-Time Block Codes (STBCs) from orthogonal designs (ODs) are single-symbol decodable/symbol-by-symbol decodable (SSD) and are obtainable from unitary matrix representations of Clifford algebras. However,... | arxiv | @article{karmakar2007maximum-rate,,
title={Maximum-rate, Minimum-Decoding-Complexity STBCs from Clifford Algebras},
author={Sanjay Karmakar and B. Sundar Rajan},
journal={arXiv preprint arXiv:0712.2371},
year={2007},
archivePrefix={arXiv},
eprint={0712.2371},
primaryClass={cs.IT math.IT}
} | karmakar2007maximum-rate, |
arxiv-2098 | 0712.2384 | Multi-group ML Decodable Collocated and Distributed Space Time Block Codes | <|reference_start|>Multi-group ML Decodable Collocated and Distributed Space Time Block Codes: In this paper, collocated and distributed space-time block codes (DSTBCs) which admit multi-group maximum likelihood (ML) decoding are studied. First the collocated case is considered and the problem of constructing space-tim... | arxiv | @article{rajan2007multi-group,
title={Multi-group ML Decodable Collocated and Distributed Space Time Block
Codes},
author={G. Susinder Rajan and B. Sundar Rajan},
journal={arXiv preprint arXiv:0712.2384},
year={2007},
archivePrefix={arXiv},
eprint={0712.2384},
primaryClass={cs.IT cs.DM mat... | rajan2007multi-group |
arxiv-2099 | 0712.2389 | Decomposition During Search for Propagation-Based Constraint Solvers | <|reference_start|>Decomposition During Search for Propagation-Based Constraint Solvers: We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically decomposes sub-problems of a constraint satisfaction problem ... | arxiv | @article{mann2007decomposition,
title={Decomposition During Search for Propagation-Based Constraint Solvers},
author={Martin Mann and Guido Tack and Sebastian Will},
journal={arXiv preprint arXiv:0712.2389},
year={2007},
archivePrefix={arXiv},
eprint={0712.2389},
primaryClass={cs.AI}
} | mann2007decomposition |
arxiv-2100 | 0712.2430 | Limits to consistent on-line forecasting for ergodic time series | <|reference_start|>Limits to consistent on-line forecasting for ergodic time series: This study concerns problems of time-series forecasting under the weakest of assumptions. Related results are surveyed and are points of departure for the developments here, some of which are new and others are new derivations of previ... | arxiv | @article{gyorfi2007limits,
title={Limits to consistent on-line forecasting for ergodic time series},
author={L. Gyorfi, G. Morvai, and S. Yakowitz},
journal={IEEE Trans. Inform. Theory 44 (1998), no. 2, 886--892},
year={2007},
doi={10.1109/18.661540},
archivePrefix={arXiv},
eprint={0712.2430... | gyorfi2007limits |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.