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-2501 | 0801.4405 | A Locked Orthogonal Tree | <|reference_start|>A Locked Orthogonal Tree: We give a counterexample to a conjecture of Poon [Poo06] that any orthogonal tree in two dimensions can always be flattened by a continuous motion that preserves edge lengths and avoids self-intersection. We show our example is locked by extending results on strongly locked ... | arxiv | @article{charlton2008a,
title={A Locked Orthogonal Tree},
author={David Charlton, Erik D. Demaine, Martin L. Demaine, Gregory Price,
Yaa-Lirng Tu},
journal={arXiv preprint arXiv:0801.4405},
year={2008},
archivePrefix={arXiv},
eprint={0801.4405},
primaryClass={cs.CG}
} | charlton2008a |
arxiv-2502 | 0801.4417 | Controllable coherent population transfers in superconducting qubits for quantum computing | <|reference_start|>Controllable coherent population transfers in superconducting qubits for quantum computing: We propose an approach to coherently transfer populations between selected quantum states in one- and two-qubit systems by using controllable Stark-chirped rapid adiabatic passages (SCRAPs). These {\it evoluti... | arxiv | @article{wei2008controllable,
title={Controllable coherent population transfers in superconducting qubits for
quantum computing},
author={L.F. Wei, J.R. Johansson, L.X. Cen, S. Ashhab, Franco Nori},
journal={Phys. Rev. Lett. 100, 113601 (2008)},
year={2008},
doi={10.1103/PhysRevLett.100.113601},
... | wei2008controllable |
arxiv-2503 | 0801.4423 | It's Not What You Have, But How You Use It: Compromises in Mobile Device Use | <|reference_start|>It's Not What You Have, But How You Use It: Compromises in Mobile Device Use: As users begin to use many more devices for personal information management (PIM) than just the traditional desktop computer, it is essential for HCI researchers to understand how these devices are being used in the wild an... | arxiv | @article{tungare2008it's,
title={It's Not What You Have, But How You Use It: Compromises in Mobile Device
Use},
author={Manas Tungare, Manuel Perez-Quinones},
journal={arXiv preprint arXiv:0801.4423},
year={2008},
archivePrefix={arXiv},
eprint={0801.4423},
primaryClass={cs.HC}
} | tungare2008it's |
arxiv-2504 | 0801.4480 | Abstractions for biomolecular computations | <|reference_start|>Abstractions for biomolecular computations: Deoxyribonucleic acid is increasingly being understood to be an informational molecule, capable of information processing.It has found application in the determination of non-deterministic algorithms and in the design of molecular computing devices. This is... | arxiv | @article{okunoye2008abstractions,
title={Abstractions for biomolecular computations},
author={Babatunde O. Okunoye},
journal={arXiv preprint arXiv:0801.4480},
year={2008},
archivePrefix={arXiv},
eprint={0801.4480},
primaryClass={cs.OH}
} | okunoye2008abstractions |
arxiv-2505 | 0801.4483 | Biopsies prostatiques sous guidage \'echographique 3D et temps r\'eel (4D) sur fant\^ome Etude comparative versus guidage 2D | <|reference_start|>Biopsies prostatiques sous guidage \'echographique 3D et temps r\'eel (4D) sur fant\^ome Etude comparative versus guidage 2D: This paper analyzes the impact of using 2D or 3D ultrasound on the efficiency of prostate biopsies. The evaluation is performed on home-made phantoms. The study shows that the... | arxiv | @article{long2008biopsies,
title={Biopsies prostatiques sous guidage \'echographique 3D et temps r\'eel
(4D) sur fant\^ome. Etude comparative versus guidage 2D},
author={Jean-Alexandre Long (TIMC), Vincent Daanen (TIMC), Alexandre
Moreau-Gaudry (TIMC, CHU-Grenoble CIC), Jocelyne Troccaz (TIMC), Jean-Jacques... | long2008biopsies |
arxiv-2506 | 0801.4544 | A Neyman-Pearson Approach to Universal Erasure and List Decoding | <|reference_start|>A Neyman-Pearson Approach to Universal Erasure and List Decoding: When information is to be transmitted over an unknown, possibly unreliable channel, an erasure option at the decoder is desirable. Using constant-composition random codes, we propose a generalization of Csiszar and Korner's Maximum Mut... | arxiv | @article{moulin2008a,
title={A Neyman-Pearson Approach to Universal Erasure and List Decoding},
author={Pierre Moulin},
journal={arXiv preprint arXiv:0801.4544},
year={2008},
doi={10.1109/ISIT.2008.4594948},
archivePrefix={arXiv},
eprint={0801.4544},
primaryClass={cs.IT math.IT}
} | moulin2008a |
arxiv-2507 | 0801.4571 | Is SP BP? | <|reference_start|>Is SP BP?: The Survey Propagation (SP) algorithm for solving $k$-SAT problems has been shown recently as an instance of the Belief Propagation (BP) algorithm. In this paper, we show that for general constraint-satisfaction problems, SP may not be reducible from BP. We also establish the conditions un... | arxiv | @article{tu2008is,
title={Is SP BP?},
author={Ronghui Tu, Yongyi Mao and Jiying Zhao},
journal={arXiv preprint arXiv:0801.4571},
year={2008},
archivePrefix={arXiv},
eprint={0801.4571},
primaryClass={cs.IT math.IT}
} | tu2008is |
arxiv-2508 | 0801.4585 | The Complexity of Power-Index Comparison | <|reference_start|>The Complexity of Power-Index Comparison: We study the complexity of the following problem: Given two weighted voting games G' and G'' that each contain a player p, in which of these games is p's power index value higher? We study this problem with respect to both the Shapley-Shubik power index [SS54... | arxiv | @article{faliszewski2008the,
title={The Complexity of Power-Index Comparison},
author={Piotr Faliszewski, Lane A. Hemaspaandra},
journal={arXiv preprint arXiv:0801.4585},
year={2008},
number={URCS TR-2008-929},
archivePrefix={arXiv},
eprint={0801.4585},
primaryClass={cs.CC cs.GT}
} | faliszewski2008the |
arxiv-2509 | 0801.4592 | Understanding the Paradoxical Effects of Power Control on the Capacity of Wireless Networks | <|reference_start|>Understanding the Paradoxical Effects of Power Control on the Capacity of Wireless Networks: Recent works show conflicting results: network capacity may increase or decrease with higher transmission power under different scenarios. In this work, we want to understand this paradox. Specifically, we ad... | arxiv | @article{wang2008understanding,
title={Understanding the Paradoxical Effects of Power Control on the Capacity
of Wireless Networks},
author={Yue Wang, John C. S. Lui, Dah-Ming Chiu},
journal={arXiv preprint arXiv:0801.4592},
year={2008},
doi={10.1109/T-WC.2009.080142},
archivePrefix={arXiv},
... | wang2008understanding |
arxiv-2510 | 0801.4664 | A Molecular Model for Communication through a Secrecy System | <|reference_start|>A Molecular Model for Communication through a Secrecy System: Codes have been used for centuries to convey secret information.To a cryptanalyst, the interception of a code is only the first step in recovering a secret message.Deoxyribonucleic acid (DNA) is a biological and molecular code.Through the ... | arxiv | @article{babatunde2008a,
title={A Molecular Model for Communication through a Secrecy System},
author={O. Okunoye Babatunde},
journal={arXiv preprint arXiv:0801.4664},
year={2008},
archivePrefix={arXiv},
eprint={0801.4664},
primaryClass={cs.CR}
} | babatunde2008a |
arxiv-2511 | 0801.4699 | On Cobweb Admissible Sequences - The Production Theorem | <|reference_start|>On Cobweb Admissible Sequences - The Production Theorem: In this note further clue decisive observations on cobweb admissible sequences are shared with the audience. In particular an announced proof of the Theorem 1 (by Dziemia\'nczuk) from [1] announced in India -Kolkata- December 2007 is delivered ... | arxiv | @article{dziemiańczuk2008on,
title={On Cobweb Admissible Sequences - The Production Theorem},
author={M. Dziemia'nczuk},
journal={Proceedings of FCS'08, Interesting results, new models, and
methodologies, pp.163-165, July 14-17, 2008, Las Vegas, USA},
year={2008},
archivePrefix={arXiv},
eprint... | dziemiańczuk2008on |
arxiv-2512 | 0801.4706 | A Class of Errorless Codes for Over-loaded Synchronous Wireless and Optical CDMA Systems | <|reference_start|>A Class of Errorless Codes for Over-loaded Synchronous Wireless and Optical CDMA Systems: In this paper we introduce a new class of codes for over-loaded synchronous wireless and optical CDMA systems which increases the number of users for fixed number of chips without introducing any errors. Equival... | arxiv | @article{pad2008a,
title={A Class of Errorless Codes for Over-loaded Synchronous Wireless and
Optical CDMA Systems},
author={P. Pad, F. Marvasti, K. Alishahi, S. Akbari},
journal={arXiv preprint arXiv:0801.4706},
year={2008},
archivePrefix={arXiv},
eprint={0801.4706},
primaryClass={cs.IT m... | pad2008a |
arxiv-2513 | 0801.4709 | Temporal Correlations of Local Network Losses | <|reference_start|>Temporal Correlations of Local Network Losses: We introduce a continuum model describing data losses in a single node of a packet-switched network (like the Internet) which preserves the discrete nature of the data loss process. {\em By construction}, the model has critical behavior with a sharp tran... | arxiv | @article{stepanenko2008temporal,
title={Temporal Correlations of Local Network Losses},
author={A. S. Stepanenko, C. C. Constantinou, I. V. Yurkevich and I. V. Lerner},
journal={Phys. Rev. E 77, 046115 (2008)},
year={2008},
doi={10.1103/PhysRevE.77.046115},
archivePrefix={arXiv},
eprint={080... | stepanenko2008temporal |
arxiv-2514 | 0801.4714 | Breaking One-Round Key-Agreement Protocols in the Random Oracle Model | <|reference_start|>Breaking One-Round Key-Agreement Protocols in the Random Oracle Model: In this paper we study one-round key-agreement protocols analogous to Merkle's puzzles in the random oracle model. The players Alice and Bob are allowed to query a random permutation oracle $n$ times and upon their queries and com... | arxiv | @article{sotakova2008breaking,
title={Breaking One-Round Key-Agreement Protocols in the Random Oracle Model},
author={Miroslava Sotakova},
journal={arXiv preprint arXiv:0801.4714},
year={2008},
archivePrefix={arXiv},
eprint={0801.4714},
primaryClass={cs.CC cs.CR}
} | sotakova2008breaking |
arxiv-2515 | 0801.4716 | Methods to integrate a language model with semantic information for a word prediction component | <|reference_start|>Methods to integrate a language model with semantic information for a word prediction component: Most current word prediction systems make use of n-gram language models (LM) to estimate the probability of the following word in a phrase. In the past years there have been many attempts to enrich such l... | arxiv | @article{wandmacher2008methods,
title={Methods to integrate a language model with semantic information for a
word prediction component},
author={Tonio Wandmacher, Jean-Yves Antoine},
journal={arXiv preprint arXiv:0801.4716},
year={2008},
archivePrefix={arXiv},
eprint={0801.4716},
primaryCl... | wandmacher2008methods |
arxiv-2516 | 0801.4746 | Concerning Olga, the Beautiful Little Street Dancer (Adjectives as Higher-Order Polymorphic Functions) | <|reference_start|>Concerning Olga, the Beautiful Little Street Dancer (Adjectives as Higher-Order Polymorphic Functions): In this paper we suggest a typed compositional seman-tics for nominal compounds of the form [Adj Noun] that models adjectives as higher-order polymorphic functions, and where types are assumed to r... | arxiv | @article{saba2008concerning,
title={Concerning Olga, the Beautiful Little Street Dancer (Adjectives as
Higher-Order Polymorphic Functions)},
author={Walid S. Saba},
journal={arXiv preprint arXiv:0801.4746},
year={2008},
archivePrefix={arXiv},
eprint={0801.4746},
primaryClass={cs.CL cs.LO}
... | saba2008concerning |
arxiv-2517 | 0801.4750 | Graceful Degradation of Air Traffic Operations | <|reference_start|>Graceful Degradation of Air Traffic Operations: The introduction of new technologies and concepts of operation in the air transportation system is not possible, unless they can be proven not to adversely affect the system operation under not only nominal, but also degraded conditions. In extreme scen... | arxiv | @article{gariel2008graceful,
title={Graceful Degradation of Air Traffic Operations},
author={Maxime Gariel, Eric Feron},
journal={arXiv preprint arXiv:0801.4750},
year={2008},
archivePrefix={arXiv},
eprint={0801.4750},
primaryClass={cs.OH}
} | gariel2008graceful |
arxiv-2518 | 0801.4774 | Source Code Protection for Applications Written in Microsoft Excel and Google Spreadsheet | <|reference_start|>Source Code Protection for Applications Written in Microsoft Excel and Google Spreadsheet: Spreadsheets are used to develop application software that is distributed to users. Unfortunately, the users often have the ability to change the programming statements ("source code") of the spreadsheet applic... | arxiv | @article{grossman2008source,
title={Source Code Protection for Applications Written in Microsoft Excel and
Google Spreadsheet},
author={Thomas A. Grossman},
journal={Proc. European Spreadsheet Risks Int. Grp. 2007 81-91 ISBN
978-905617-58-6},
year={2008},
archivePrefix={arXiv},
eprint={0801.... | grossman2008source |
arxiv-2519 | 0801.4775 | Spreadsheet Assurance by "Control Around" is a Viable Alternative to the Traditional Approach | <|reference_start|>Spreadsheet Assurance by "Control Around" is a Viable Alternative to the Traditional Approach: The traditional approach to spreadsheet auditing generally consists of auditing every distinct formula within a spreadsheet. Although tools are developed to support auditors during this process, the approac... | arxiv | @article{ettema2008spreadsheet,
title={Spreadsheet Assurance by "Control Around" is a Viable Alternative to the
Traditional Approach},
author={Harmen Ettema, Paul Janssen, Jacques de Swart},
journal={Proc. European Spreadsheet Risks Int. Grp. 2001 107-116 ISBN:1
86166 179 7},
year={2008},
archiv... | ettema2008spreadsheet |
arxiv-2520 | 0801.4777 | Non-Deterministic Communication Complexity of Regular Languages | <|reference_start|>Non-Deterministic Communication Complexity of Regular Languages: In this thesis, we study the place of regular languages within the communication complexity setting. In particular, we are interested in the non-deterministic communication complexity of regular languages. We show that a regular langu... | arxiv | @article{ada2008non-deterministic,
title={Non-Deterministic Communication Complexity of Regular Languages},
author={Anil Ada},
journal={arXiv preprint arXiv:0801.4777},
year={2008},
archivePrefix={arXiv},
eprint={0801.4777},
primaryClass={cs.CC}
} | ada2008non-deterministic |
arxiv-2521 | 0801.4790 | Information Width | <|reference_start|>Information Width: Kolmogorov argued that the concept of information exists also in problems with no underlying stochastic model (as Shannon's information representation) for instance, the information contained in an algorithm or in the genome. He introduced a combinatorial notion of entropy and info... | arxiv | @article{ratsaby2008information,
title={Information Width},
author={Joel Ratsaby},
journal={arXiv preprint arXiv:0801.4790},
year={2008},
archivePrefix={arXiv},
eprint={0801.4790},
primaryClass={cs.DM cs.IT cs.LG math.IT}
} | ratsaby2008information |
arxiv-2522 | 0801.4794 | On the Complexity of Binary Samples | <|reference_start|>On the Complexity of Binary Samples: Consider a class $\mH$ of binary functions $h: X\to\{-1, +1\}$ on a finite interval $X=[0, B]\subset \Real$. Define the {\em sample width} of $h$ on a finite subset (a sample) $S\subset X$ as $\w_S(h) \equiv \min_{x\in S} |\w_h(x)|$, where $\w_h(x) = h(x) \max\{a\... | arxiv | @article{ratsaby2008on,
title={On the Complexity of Binary Samples},
author={Joel Ratsaby},
journal={arXiv preprint arXiv:0801.4794},
year={2008},
archivePrefix={arXiv},
eprint={0801.4794},
primaryClass={cs.DM cs.AI cs.LG}
} | ratsaby2008on |
arxiv-2523 | 0801.4802 | Investigating the Potential of Test-Driven Development for Spreadsheet Engineering | <|reference_start|>Investigating the Potential of Test-Driven Development for Spreadsheet Engineering: It is widely documented that the absence of a structured approach to spreadsheet engineering is a key factor in the high level of spreadsheet errors. In this paper we propose and investigate the application of Test-Dr... | arxiv | @article{rust2008investigating,
title={Investigating the Potential of Test-Driven Development for Spreadsheet
Engineering},
author={Alan Rust, Brian Bishop, Kevin McDaid},
journal={Proc. European Spreadsheet Risks Int. Grp. 2006 95-105
ISBN:1-905617-08-9},
year={2008},
archivePrefix={arXiv},
... | rust2008investigating |
arxiv-2524 | 0801.4807 | Automatic Text Area Segmentation in Natural Images | <|reference_start|>Automatic Text Area Segmentation in Natural Images: We present a hierarchical method for segmenting text areas in natural images. The method assumes that the text is written with a contrasting color on a more or less uniform background. But no assumption is made regarding the language or character se... | arxiv | @article{jafri2008automatic,
title={Automatic Text Area Segmentation in Natural Images},
author={Syed Ali Raza Jafri, Mireille Boutin, and Edward J. Delp},
journal={arXiv preprint arXiv:0801.4807},
year={2008},
archivePrefix={arXiv},
eprint={0801.4807},
primaryClass={cs.CV}
} | jafri2008automatic |
arxiv-2525 | 0801.4817 | The REESSE2+ Public-key Encryption Scheme | <|reference_start|>The REESSE2+ Public-key Encryption Scheme: This paper gives the definitions of an anomalous super-increasing sequence and an anomalous subset sum separately, proves the two properties of an anomalous super-increasing sequence, and proposes the REESSE2+ public-key encryption scheme which includes the ... | arxiv | @article{su2008the,
title={The REESSE2+ Public-key Encryption Scheme},
author={Shenghui Su and Shuwang Lv},
journal={arXiv preprint arXiv:0801.4817},
year={2008},
archivePrefix={arXiv},
eprint={0801.4817},
primaryClass={cs.CR cs.CC}
} | su2008the |
arxiv-2526 | 0801.4845 | Improved lower bound for deterministic broadcasting in radio networks | <|reference_start|>Improved lower bound for deterministic broadcasting in radio networks: We consider the problem of deterministic broadcasting in radio networks when the nodes have limited knowledge about the topology of the network. We show that for every deterministic broadcasting protocol there exists a network, of... | arxiv | @article{brito2008improved,
title={Improved lower bound for deterministic broadcasting in radio networks},
author={Carlos Brito and Shailesh Vaya},
journal={arXiv preprint arXiv:0801.4845},
year={2008},
archivePrefix={arXiv},
eprint={0801.4845},
primaryClass={cs.DM cs.DC}
} | brito2008improved |
arxiv-2527 | 0801.4851 | Bicretieria Optimization in Routing Games | <|reference_start|>Bicretieria Optimization in Routing Games: Two important metrics for measuring the quality of routing paths are the maximum edge congestion $C$ and maximum path length $D$. Here, we study bicriteria in routing games where each player $i$ selfishly selects a path that simultaneously minimizes its maxi... | arxiv | @article{busch2008bicretieria,
title={Bicretieria Optimization in Routing Games},
author={Costas Busch and Rajgopal Kannan},
journal={arXiv preprint arXiv:0801.4851},
year={2008},
archivePrefix={arXiv},
eprint={0801.4851},
primaryClass={cs.GT cs.DS}
} | busch2008bicretieria |
arxiv-2528 | 0801.4911 | On the Double Coset Membership Problem for Permutation Groups | <|reference_start|>On the Double Coset Membership Problem for Permutation Groups: We show that the Double Coset Membership problem for permutation groups possesses perfect zero-knowledge proofs.<|reference_end|> | arxiv | @article{verbitsky2008on,
title={On the Double Coset Membership Problem for Permutation Groups},
author={Oleg Verbitsky},
journal={Algebraic structures and their applications, pp. 351--363 (2002)},
year={2008},
archivePrefix={arXiv},
eprint={0801.4911},
primaryClass={cs.CC}
} | verbitsky2008on |
arxiv-2529 | 0801.4917 | Zero-Knowledge Proofs of the Conjugacy for Permutation Groups | <|reference_start|>Zero-Knowledge Proofs of the Conjugacy for Permutation Groups: We design a perfect zero-knowledge proof system for recognition if two permutation groups are conjugate.<|reference_end|> | arxiv | @article{verbitsky2008zero-knowledge,
title={Zero-Knowledge Proofs of the Conjugacy for Permutation Groups},
author={Oleg Verbitsky},
journal={Bulletin of the Lviv University, Series in Mechanics and
Mathematics. Vol. 61, pp. 195--205 (2003)},
year={2008},
archivePrefix={arXiv},
eprint={0801.4... | verbitsky2008zero-knowledge |
arxiv-2530 | 0802.0003 | On mobile sets in the binary hypercube | <|reference_start|>On mobile sets in the binary hypercube: If two distance-3 codes have the same neighborhood, then each of them is called a mobile set. In the (4k+3)-dimensional binary hypercube, there exists a mobile set of cardinality 2*6^k that cannot be split into mobile sets of smaller cardinalities or represente... | arxiv | @article{vasil'ev2008on,
title={On mobile sets in the binary hypercube},
author={Yuriy Vasil'ev (Sobolev Institute of Mathematics, Novosibirsk,
Russia), Sergey Avgustinovich (Sobolev Institute of Mathematics, Novosibirsk,
Russia), Denis Krotov (Sobolev Institute of Mathematics, Novosibirsk, Russia)},
jo... | vasil'ev2008on |
arxiv-2531 | 0802.0006 | New Perspectives and some Celebrated Quantum Inequalities | <|reference_start|>New Perspectives and some Celebrated Quantum Inequalities: Some of the important inequalities associated with quantum entropy are immediate algebraic consequences of the Hansen-Pedersen-Jensen inequality. A general argument is given in terms of the matrix perspective of an operator convex function. A... | arxiv | @article{effros2008new,
title={New Perspectives and some Celebrated Quantum Inequalities},
author={Edward G. Effros},
journal={arXiv preprint arXiv:0802.0006},
year={2008},
archivePrefix={arXiv},
eprint={0802.0006},
primaryClass={math-ph cs.IT math.IT math.MP}
} | effros2008new |
arxiv-2532 | 0802.0017 | Improved Deterministic Length Reduction | <|reference_start|>Improved Deterministic Length Reduction: This paper presents a new technique for deterministic length reduction. This technique improves the running time of the algorithm presented in \cite{LR07} for performing fast convolution in sparse data. While the regular fast convolution of vectors $V_1,V_2$ w... | arxiv | @article{amir2008improved,
title={Improved Deterministic Length Reduction},
author={Amihood Amir and Klim Efremenko and Oren Kapah and Ely Porat and Amir
Rothschild},
journal={arXiv preprint arXiv:0802.0017},
year={2008},
archivePrefix={arXiv},
eprint={0802.0017},
primaryClass={cs.DS}
} | amir2008improved |
arxiv-2533 | 0802.0024 | Solving the Maximum Agreement SubTree and the Maximum Compatible Tree problems on many bounded degree trees | <|reference_start|>Solving the Maximum Agreement SubTree and the Maximum Compatible Tree problems on many bounded degree trees: Given a set of leaf-labeled trees with identical leaf sets, the well-known "Maximum Agreement SubTree" problem (MAST) consists of finding a subtree homeomorphically included in all input trees... | arxiv | @article{guillemot2008solving,
title={Solving the Maximum Agreement SubTree and the Maximum Compatible Tree
problems on many bounded degree trees},
author={Sylvain Guillemot and Francois Nicolas},
journal={Proceedings of the 17th Annual Symposium on Combinatorial Pattern
Matching (CPM'06), volume 4009 o... | guillemot2008solving |
arxiv-2534 | 0802.0030 | Mission impossible: Computing the network coding capacity region | <|reference_start|>Mission impossible: Computing the network coding capacity region: One of the main theoretical motivations for the emerging area of network coding is the achievability of the max-flow/min-cut rate for single source multicast. This can exceed the rate achievable with routing alone, and is achievable wi... | arxiv | @article{chan2008mission,
title={Mission impossible: Computing the network coding capacity region},
author={Terence Chan and Alex Grant},
journal={arXiv preprint arXiv:0802.0030},
year={2008},
archivePrefix={arXiv},
eprint={0802.0030},
primaryClass={cs.IT math.IT}
} | chan2008mission |
arxiv-2535 | 0802.0116 | Shallow Models for Non-Iterative Modal Logics | <|reference_start|>Shallow Models for Non-Iterative Modal Logics: The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed in polynomial space whereas semantic approaches directly construct shallow... | arxiv | @article{schröder2008shallow,
title={Shallow Models for Non-Iterative Modal Logics},
author={Lutz Schr"oder and Dirk Patinson},
journal={arXiv preprint arXiv:0802.0116},
year={2008},
number={Imperial College TR Computing 2008/3},
archivePrefix={arXiv},
eprint={0802.0116},
primaryClass={c... | schröder2008shallow |
arxiv-2536 | 0802.0130 | About the true type of smoothers | <|reference_start|>About the true type of smoothers: We employ the variational formulation and the Euler-Lagrange equations to study the steady-state error in linear non-causal estimators (smoothers). We give a complete description of the steady-state error for inputs that are polynomial in time. We show that the stead... | arxiv | @article{ezri2008about,
title={About the true type of smoothers},
author={D. Ezri, B.Z. Bobrovsky, Z. Schuss},
journal={arXiv preprint arXiv:0802.0130},
year={2008},
archivePrefix={arXiv},
eprint={0802.0130},
primaryClass={math.OC cs.IT math.IT}
} | ezri2008about |
arxiv-2537 | 0802.0137 | Fault-Tolerant Partial Replication in Large-Scale Database Systems | <|reference_start|>Fault-Tolerant Partial Replication in Large-Scale Database Systems: We investigate a decentralised approach to committing transactions in a replicated database, under partial replication. Previous protocols either re-execute transactions entirely and/or compute a total order of transactions. In contr... | arxiv | @article{sutra2008fault-tolerant,
title={Fault-Tolerant Partial Replication in Large-Scale Database Systems},
author={Pierre Sutra (INRIA Rocquencourt), Marc Shapiro (INRIA Rocquencourt)},
journal={arXiv preprint arXiv:0802.0137},
year={2008},
number={RR-6440},
archivePrefix={arXiv},
eprint=... | sutra2008fault-tolerant |
arxiv-2538 | 0802.0179 | On the Relation Between the Index Coding and the Network Coding Problems | <|reference_start|>On the Relation Between the Index Coding and the Network Coding Problems: In this paper we show that the Index Coding problem captures several important properties of the more general Network Coding problem. An instance of the Index Coding problem includes a server that holds a set of information mes... | arxiv | @article{rouayheb2008on,
title={On the Relation Between the Index Coding and the Network Coding Problems},
author={Salim El Rouayheb, Alex Sprintson, Costas Georghiades},
journal={arXiv preprint arXiv:0802.0179},
year={2008},
archivePrefix={arXiv},
eprint={0802.0179},
primaryClass={cs.IT mat... | rouayheb2008on |
arxiv-2539 | 0802.0188 | Partitioning the Threads of a Mobile System | <|reference_start|>Partitioning the Threads of a Mobile System: In this paper, we show how thread partitioning helps in proving properties of mobile systems. Thread partitioning consists in gathering the threads of a mobile system into several classes. The partitioning criterion is left as a parameter of both the mobil... | arxiv | @article{feret2008partitioning,
title={Partitioning the Threads of a Mobile System},
author={J'er^ome Feret},
journal={arXiv preprint arXiv:0802.0188},
year={2008},
archivePrefix={arXiv},
eprint={0802.0188},
primaryClass={cs.OH}
} | feret2008partitioning |
arxiv-2540 | 0802.0212 | A topological formal treatment for scenario-based software specification of concurrent real-time systems | <|reference_start|>A topological formal treatment for scenario-based software specification of concurrent real-time systems: Real-time systems are computing systems in which the meeting of their requirements is vital for their correctness. Consequently, if the real-time requirements of these systems are poorly understo... | arxiv | @article{alves2008a,
title={A topological formal treatment for scenario-based software specification
of concurrent real-time systems},
author={Miriam C. B. Alves, Christine C. Dantas, Nanci N. Arai, Rovedy B. da
Silva (Institute of Aeronautics and Space - IAE/CTA, Brazil)},
journal={arXiv preprint arXiv... | alves2008a |
arxiv-2541 | 0802.0249 | Hopf Algebras in General and in Combinatorial Physics: a practical introduction | <|reference_start|>Hopf Algebras in General and in Combinatorial Physics: a practical introduction: This tutorial is intended to give an accessible introduction to Hopf algebras. The mathematical context is that of representation theory, and we also illustrate the structures with examples taken from combinatorics and q... | arxiv | @article{duchamp2008hopf,
title={Hopf Algebras in General and in Combinatorial Physics: a practical
introduction},
author={G. H. E. Duchamp (LIPN), P. Blasiak (IFJ-Pan), A. Horzela (IFJ-Pan),
K. A. Penson (LPTMC), A. I. Solomon},
journal={arXiv preprint arXiv:0802.0249},
year={2008},
archivePref... | duchamp2008hopf |
arxiv-2542 | 0802.0251 | Multi-Layer Perceptrons and Symbolic Data | <|reference_start|>Multi-Layer Perceptrons and Symbolic Data: In some real world situations, linear models are not sufficient to represent accurately complex relations between input variables and output variables of a studied system. Multilayer Perceptrons are one of the most successful non-linear regression tool but t... | arxiv | @article{rossi2008multi-layer,
title={Multi-Layer Perceptrons and Symbolic Data},
author={Fabrice Rossi (INRIA Rocquencourt / INRIA Sophia Antipolis, CEREMADE),
Brieuc Conan-Guez (INRIA Rocquencourt / INRIA Sophia Antipolis, LITA)},
journal={Symbolic Data Analysis and the SODAS Software Wiley (Ed.) (2008)... | rossi2008multi-layer |
arxiv-2543 | 0802.0252 | Acc\'el\'eration des cartes auto-organisatrices sur tableau de dissimilarit\'es par s\'eparation et \'evaluation | <|reference_start|>Acc\'el\'eration des cartes auto-organisatrices sur tableau de dissimilarit\'es par s\'eparation et \'evaluation: In this paper, a new implementation of the adaptation of Kohonen self-organising maps (SOM) to dissimilarity matrices is proposed. This implementation relies on the branch and bound princ... | arxiv | @article{conan-guez2008acc\'el\'eration,
title={Acc\'el\'eration des cartes auto-organisatrices sur tableau de
dissimilarit\'es par s\'eparation et \'evaluation},
author={Brieuc Conan-Guez (LITA), Fabrice Rossi (INRIA Rocquencourt / INRIA
Sophia Antipolis)},
journal={REVUE DES NOUVELLES TECHNOLOGIES DE ... | conan-guez2008acc\'el\'eration |
arxiv-2544 | 0802.0260 | A proposal to a generalised splicing with a self assembly approach | <|reference_start|>A proposal to a generalised splicing with a self assembly approach: Theory of splicing is an abstract model of the recombinant behaviour of DNAs. In a splicing system, two strings to be spliced are taken from the same set and the splicing rule is from another set. Here we propose a generalised splici... | arxiv | @article{jeganathan2008a,
title={A proposal to a generalised splicing with a self assembly approach},
author={L. Jeganathan, R. Rama, Ritabrata Sengupta},
journal={arXiv preprint arXiv:0802.0260},
year={2008},
archivePrefix={arXiv},
eprint={0802.0260},
primaryClass={cs.DM}
} | jeganathan2008a |
arxiv-2545 | 0802.0287 | A data-driven functional projection approach for the selection of feature ranges in spectra with ICA or cluster analysis | <|reference_start|>A data-driven functional projection approach for the selection of feature ranges in spectra with ICA or cluster analysis: Prediction problems from spectra are largely encountered in chemometry. In addition to accurate predictions, it is often needed to extract information about which wavelengths in t... | arxiv | @article{krier2008a,
title={A data-driven functional projection approach for the selection of
feature ranges in spectra with ICA or cluster analysis},
author={Catherine Krier (DICE), Fabrice Rossi (INRIA Rocquencourt / INRIA
Sophia Antipolis), Damien Franc{c}ois (CESAME), Michel Verleysen (DICE -
MLG)},
... | krier2008a |
arxiv-2546 | 0802.0314 | On the complexity of finding gapped motifs | <|reference_start|>On the complexity of finding gapped motifs: This paper has been withdrawn by the corresponding author because the newest version is now published in Journal of Discrete Algorithms.<|reference_end|> | arxiv | @article{michael2008on,
title={On the complexity of finding gapped motifs},
author={Morris Michael and Francois Nicolas and Esko Ukkonen},
journal={arXiv preprint arXiv:0802.0314},
year={2008},
doi={10.1016/j.jda.2009.12.001},
archivePrefix={arXiv},
eprint={0802.0314},
primaryClass={cs.C... | michael2008on |
arxiv-2547 | 0802.0342 | The Case for Structured Random Codes in Network Capacity Theorems | <|reference_start|>The Case for Structured Random Codes in Network Capacity Theorems: Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for proving some network capacity theorems: structured coding ... | arxiv | @article{nazer2008the,
title={The Case for Structured Random Codes in Network Capacity Theorems},
author={Bobak Nazer and Michael Gastpar},
journal={arXiv preprint arXiv:0802.0342},
year={2008},
archivePrefix={arXiv},
eprint={0802.0342},
primaryClass={cs.IT math.IT}
} | nazer2008the |
arxiv-2548 | 0802.0351 | Path Loss Exponent Estimation in a Large Field of Interferers | <|reference_start|>Path Loss Exponent Estimation in a Large Field of Interferers: In wireless channels, the path loss exponent (PLE) has a strong impact on the quality of links, and hence, it needs to be accurately estimated for the efficient design and operation of wireless networks. In this paper, we address the prob... | arxiv | @article{srinivasa2008path,
title={Path Loss Exponent Estimation in a Large Field of Interferers},
author={Sunil Srinivasa and Martin Haenggi},
journal={arXiv preprint arXiv:0802.0351},
year={2008},
archivePrefix={arXiv},
eprint={0802.0351},
primaryClass={cs.IT math.IT}
} | srinivasa2008path |
arxiv-2549 | 0802.0414 | The exit problem in optimal non-causal extimation | <|reference_start|>The exit problem in optimal non-causal extimation: We study the phenomenon of loss of lock in the optimal non-causal phase estimation problem, a benchmark problem in nonlinear estimation. Our method is based on the computation of the asymptotic distribution of the optimal estimation error in case the... | arxiv | @article{ezri2008the,
title={The exit problem in optimal non-causal extimation},
author={Doron Ezri, Ben-Tzion Bobrovsky, Zeev Schuss},
journal={arXiv preprint arXiv:0802.0414},
year={2008},
archivePrefix={arXiv},
eprint={0802.0414},
primaryClass={math.OC cs.IT math.IT}
} | ezri2008the |
arxiv-2550 | 0802.0423 | Approximability Distance in the Space of H-Colourability Problems | <|reference_start|>Approximability Distance in the Space of H-Colourability Problems: A graph homomorphism is a vertex map which carries edges from a source graph to edges in a target graph. We study the approximability properties of the Weighted Maximum H-Colourable Subgraph problem (MAX H-COL). The instances of this ... | arxiv | @article{färnqvist2008approximability,
title={Approximability Distance in the Space of H-Colourability Problems},
author={Tommy F"arnqvist, Peter Jonsson and Johan Thapper},
journal={arXiv preprint arXiv:0802.0423},
year={2008},
archivePrefix={arXiv},
eprint={0802.0423},
primaryClass={cs.CC}... | färnqvist2008approximability |
arxiv-2551 | 0802.0483 | Popularity, Novelty and Attention | <|reference_start|>Popularity, Novelty and Attention: We analyze the role that popularity and novelty play in attracting the attention of users to dynamic websites. We do so by determining the performance of three different strategies that can be utilized to maximize attention. The first one prioritizes novelty while t... | arxiv | @article{wu2008popularity,,
title={Popularity, Novelty and Attention},
author={Fang Wu and Bernardo A. Huberman},
journal={arXiv preprint arXiv:0802.0483},
year={2008},
archivePrefix={arXiv},
eprint={0802.0483},
primaryClass={cs.CY}
} | wu2008popularity, |
arxiv-2552 | 0802.0487 | Algorithmically independent sequences | <|reference_start|>Algorithmically independent sequences: Two objects are independent if they do not affect each other. Independence is well-understood in classical information theory, but less in algorithmic information theory. Working in the framework of algorithmic information theory, the paper proposes two types of... | arxiv | @article{calude2008algorithmically,
title={Algorithmically independent sequences},
author={Cristian Calude, Marius Zimand},
journal={arXiv preprint arXiv:0802.0487},
year={2008},
archivePrefix={arXiv},
eprint={0802.0487},
primaryClass={cs.IT cs.SE math.AG math.IT}
} | calude2008algorithmically |
arxiv-2553 | 0802.0534 | Capacity of Wireless Networks within o(log(SNR)) - the Impact of Relays, Feedback, Cooperation and Full-Duplex Operation | <|reference_start|>Capacity of Wireless Networks within o(log(SNR)) - the Impact of Relays, Feedback, Cooperation and Full-Duplex Operation: Recent work has characterized the sum capacity of time-varying/frequency-selective wireless interference networks and $X$ networks within $o(\log({SNR}))$, i.e., with an accuracy ... | arxiv | @article{cadambe2008capacity,
title={Capacity of Wireless Networks within o(log(SNR)) - the Impact of Relays,
Feedback, Cooperation and Full-Duplex Operation},
author={Viveck R. Cadambe, Syed A. Jafar},
journal={IEEE Transactions on Information Theory, Vol. 55, No. 5, May 2009,
Pages: 2334-2344},
ye... | cadambe2008capacity |
arxiv-2554 | 0802.0543 | Improving Performance of Cluster Based Routing Protocol using Cross-Layer Design | <|reference_start|>Improving Performance of Cluster Based Routing Protocol using Cross-Layer Design: The main goal of routing protocol is to efficiency delivers data from source to destination. All routing protocols are the same in this goal, but the way they adopt to achieve it is different, so routing strategy has an... | arxiv | @article{jahanbakhsh2008improving,
title={Improving Performance of Cluster Based Routing Protocol using
Cross-Layer Design},
author={Kazem Jahanbakhsh, Marzieh Hajhosseini},
journal={arXiv preprint arXiv:0802.0543},
year={2008},
archivePrefix={arXiv},
eprint={0802.0543},
primaryClass={cs.N... | jahanbakhsh2008improving |
arxiv-2555 | 0802.0550 | Energy Aware Self-Organizing Density Management in Wireless Sensor Networks | <|reference_start|>Energy Aware Self-Organizing Density Management in Wireless Sensor Networks: Energy consumption is the most important factor that determines sensor node lifetime. The optimization of wireless sensor network lifetime targets not only the reduction of energy consumption of a single sensor node but also... | arxiv | @article{merrer2008energy,
title={Energy Aware Self-Organizing Density Management in Wireless Sensor
Networks},
author={Erwan Le Merrer (IRISA, FT R&D), Vincent Gramoli (IRISA), Anne-Marie
Kermarrec (IRISA), Aline Viana (IRISA), Marin Bertier (IRISA)},
journal={Dans International Workshop on Decentraliz... | merrer2008energy |
arxiv-2556 | 0802.0552 | Timed Quorum System for Large-Scale and Dynamic Environments | <|reference_start|>Timed Quorum System for Large-Scale and Dynamic Environments: This paper presents Timed Quorum System (TQS), a new quorum system especially suited for large-scale and dynamic systems. TQS requires that two quorums intersect with high probability if they are used in the same small period of time. It p... | arxiv | @article{gramoli2008timed,
title={Timed Quorum System for Large-Scale and Dynamic Environments},
author={Vincent Gramoli (INRIA Futurs), Michel Raynal (IRISA)},
journal={Dans 11th International Conference On Principles Of Distributed
Systems 4878 (2007) 429--442},
year={2008},
archivePrefix={arXiv... | gramoli2008timed |
arxiv-2557 | 0802.0554 | Message-Passing Decoding of Lattices Using Gaussian Mixtures | <|reference_start|>Message-Passing Decoding of Lattices Using Gaussian Mixtures: A lattice decoder which represents messages explicitly as a mixture of Gaussians functions is given. In order to prevent the number of functions in a mixture from growing as the decoder iterations progress, a method for replacing N Gaussia... | arxiv | @article{kurkoski2008message-passing,
title={Message-Passing Decoding of Lattices Using Gaussian Mixtures},
author={Brian M. Kurkoski and Justin Dauwels},
journal={arXiv preprint arXiv:0802.0554},
year={2008},
archivePrefix={arXiv},
eprint={0802.0554},
primaryClass={cs.IT math.IT}
} | kurkoski2008message-passing |
arxiv-2558 | 0802.0580 | Rotated and Scaled Alamouti Coding | <|reference_start|>Rotated and Scaled Alamouti Coding: Repetition-based retransmission is used in Alamouti-modulation [1998] for $2\times 2$ MIMO systems. We propose to use instead of ordinary repetition so-called "scaled repetition" together with rotation. It is shown that the rotated and scaled Alamouti code has a ha... | arxiv | @article{willems2008rotated,
title={Rotated and Scaled Alamouti Coding},
author={Frans M.J. Willems},
journal={arXiv preprint arXiv:0802.0580},
year={2008},
archivePrefix={arXiv},
eprint={0802.0580},
primaryClass={cs.IT math.IT}
} | willems2008rotated |
arxiv-2559 | 0802.0603 | Trusted-HB: a low-cost version of HB+ secure against Man-in-The-Middle attacks | <|reference_start|>Trusted-HB: a low-cost version of HB+ secure against Man-in-The-Middle attacks: Since the introduction at Crypto'05 by Juels and Weis of the protocol HB+, a lightweight protocol secure against active attacks but only in a detection based-model, many works have tried to enhance its security. We propos... | arxiv | @article{bringer2008trusted-hb:,
title={Trusted-HB: a low-cost version of HB+ secure against Man-in-The-Middle
attacks},
author={Julien Bringer and Herve Chabanne},
journal={IEEE Trans. IT. 54:9 (2008) 4339-4342},
year={2008},
doi={10.1109/TIT.2008.928290},
archivePrefix={arXiv},
eprint={0... | bringer2008trusted-hb: |
arxiv-2560 | 0802.0726 | (Generalized) Post Correspondence Problem and semi-Thue systems | <|reference_start|>(Generalized) Post Correspondence Problem and semi-Thue systems: Let PCP(k) denote the Post Correspondence Problem for k input pairs of strings. Let ACCESSIBILITY(k) denote the the word problem for k-rule semi-Thue systems. In 1980, Claus showed that if ACCESSIBILITY(k) is undecidable then PCP(k + 4)... | arxiv | @article{nicolas2008(generalized),
title={(Generalized) Post Correspondence Problem and semi-Thue systems},
author={Francois Nicolas},
journal={arXiv preprint arXiv:0802.0726},
year={2008},
archivePrefix={arXiv},
eprint={0802.0726},
primaryClass={cs.DM}
} | nicolas2008(generalized) |
arxiv-2561 | 0802.0738 | MIMO Networks: the Effects of Interference | <|reference_start|>MIMO Networks: the Effects of Interference: Multiple-input/multiple-output (MIMO) systems promise enormous capacity increase and are being considered as one of the key technologies for future wireless networks. However, the decrease in capacity due to the presence of interferers in MIMO networks is n... | arxiv | @article{chiani2008mimo,
title={MIMO Networks: the Effects of Interference},
author={Marco Chiani, Moe Z. Win, Hyundong Shin},
journal={IEEE Trans. Inform. Theory, vol. 56, no. 1, pp. 336-349, Jan. 2010},
year={2008},
doi={10.1109/TIT.2009.2034810},
archivePrefix={arXiv},
eprint={0802.0738},... | chiani2008mimo |
arxiv-2562 | 0802.0745 | Knowledge management by wikis | <|reference_start|>Knowledge management by wikis: Wikis provide a new way of collaboration and knowledge sharing. Wikis are software that allows users to work collectively on a web-based knowledge base. Wikis are characterised by a sense of anarchism, collaboration, connectivity, organic development and self-healing, a... | arxiv | @article{spek2008knowledge,
title={Knowledge management by wikis},
author={Sander Spek},
journal={arXiv preprint arXiv:0802.0745},
year={2008},
archivePrefix={arXiv},
eprint={0802.0745},
primaryClass={cs.DL}
} | spek2008knowledge |
arxiv-2563 | 0802.0766 | Modelling and Analysis of the Distributed Coordination Function of IEEE 80211 with Multirate Capability | <|reference_start|>Modelling and Analysis of the Distributed Coordination Function of IEEE 80211 with Multirate Capability: The aim of this paper is twofold. On one hand, it presents a multi-dimensional Markovian state transition model characterizing the behavior at the Medium Access Control (MAC) layer by including tr... | arxiv | @article{daneshgaran2008modelling,
title={Modelling and Analysis of the Distributed Coordination Function of IEEE
802.11 with Multirate Capability},
author={F. Daneshgaran, M. Laddomada, F. Mesiti, and M. Mondin},
journal={arXiv preprint arXiv:0802.0766},
year={2008},
doi={10.1109/WCNC.2008.242},
... | daneshgaran2008modelling |
arxiv-2564 | 0802.0776 | Distributed Compression for the Uplink of a Backhaul-Constrained Coordinated Cellular Network | <|reference_start|>Distributed Compression for the Uplink of a Backhaul-Constrained Coordinated Cellular Network: We consider a backhaul-constrained coordinated cellular network. That is, a single-frequency network with $N+1$ multi-antenna base stations (BSs) that cooperate in order to decode the users' data, and that ... | arxiv | @article{del coso2008distributed,
title={Distributed Compression for the Uplink of a Backhaul-Constrained
Coordinated Cellular Network},
author={Aitor del Coso and Sebastien Simoens},
journal={arXiv preprint arXiv:0802.0776},
year={2008},
archivePrefix={arXiv},
eprint={0802.0776},
primaryC... | del coso2008distributed |
arxiv-2565 | 0802.0797 | Central Limit Theorems for Wavelet Packet Decompositions of Stationary Random Processes | <|reference_start|>Central Limit Theorems for Wavelet Packet Decompositions of Stationary Random Processes: This paper provides central limit theorems for the wavelet packet decomposition of stationary band-limited random processes. The asymptotic analysis is performed for the sequences of the wavelet packet coefficien... | arxiv | @article{atto2008central,
title={Central Limit Theorems for Wavelet Packet Decompositions of Stationary
Random Processes},
author={Abdourrahmane Atto (TAMCIC), Dominique Pastor (TAMCIC)},
journal={IEEE Transactions on Signal Processing (2008) 1-12},
year={2008},
doi={10.1109/TSP.2009.2031726},
... | atto2008central |
arxiv-2566 | 0802.0799 | D\'eveloppement et analyse multi outils d'un protocole MAC d\'eterministe pour un r\'eseau de capteurs sans fil | <|reference_start|>D\'eveloppement et analyse multi outils d'un protocole MAC d\'eterministe pour un r\'eseau de capteurs sans fil: In this article, we present a multi-tool method for the development and the analysis of a new medium access method. IEEE 802.15.4 / ZigBee technology has been used as a basis for this new ... | arxiv | @article{val2008d\'eveloppement,
title={D\'eveloppement et analyse multi outils d'un protocole MAC
d\'eterministe pour un r\'eseau de capteurs sans fil},
author={Thierry Val (LATTIS), Adrien Van Den Bossche (LATTIS)},
journal={Colloque Francophone sur l'Ing\'enierie des Protocoles (CFIP), Les
Arcs : Fra... | val2008d\'eveloppement |
arxiv-2567 | 0802.0802 | On Approximating Frequency Moments of Data Streams with Skewed Projections | <|reference_start|>On Approximating Frequency Moments of Data Streams with Skewed Projections: We propose skewed stable random projections for approximating the pth frequency moments of dynamic data streams (0<p<=2), which has been frequently studied in theoretical computer science and database communities. Our method ... | arxiv | @article{li2008on,
title={On Approximating Frequency Moments of Data Streams with Skewed
Projections},
author={Ping Li},
journal={arXiv preprint arXiv:0802.0802},
year={2008},
archivePrefix={arXiv},
eprint={0802.0802},
primaryClass={cs.DS cs.IT math.IT}
} | li2008on |
arxiv-2568 | 0802.0808 | Turbo Interleaving inside the cdma2000 and W-CDMA Mobile Communication Systems: A Tutorial | <|reference_start|>Turbo Interleaving inside the cdma2000 and W-CDMA Mobile Communication Systems: A Tutorial: In this paper a discussion of the detailed operation of the interleavers used by the turbo codes defined on the telecommunications standards cdma2000 (3GPP2 C.S0024-B V2.0) and W-CDMA (3GPP TS 25.212 V7.4.0) i... | arxiv | @article{guerrero2008turbo,
title={Turbo Interleaving inside the cdma2000 and W-CDMA Mobile Communication
Systems: A Tutorial},
author={Fabio G. Guerrero, Maribell Sacanamboy},
journal={arXiv preprint arXiv:0802.0808},
year={2008},
archivePrefix={arXiv},
eprint={0802.0808},
primaryClass={c... | guerrero2008turbo |
arxiv-2569 | 0802.0820 | Independence and concurrent separation logic | <|reference_start|>Independence and concurrent separation logic: A compositional Petri net-based semantics is given to a simple language allowing pointer manipulation and parallelism. The model is then applied to give a notion of validity to the judgements made by concurrent separation logic that emphasizes the process... | arxiv | @article{hayman2008independence,
title={Independence and concurrent separation logic},
author={Jonathan Hayman and Glynn Winskel},
journal={Logical Methods in Computer Science, Volume 4, Issue 1 (March 19,
2008) lmcs:1100},
year={2008},
doi={10.2168/LMCS-4(1:6)2008},
archivePrefix={arXiv},
... | hayman2008independence |
arxiv-2570 | 0802.0823 | Doubly-Generalized LDPC Codes: Stability Bound over the BEC | <|reference_start|>Doubly-Generalized LDPC Codes: Stability Bound over the BEC: The iterative decoding threshold of low-density parity-check (LDPC) codes over the binary erasure channel (BEC) fulfills an upper bound depending only on the variable and check nodes with minimum distance 2. This bound is a consequence of t... | arxiv | @article{paolini2008doubly-generalized,
title={Doubly-Generalized LDPC Codes: Stability Bound over the BEC},
author={Enrico Paolini, Marc Fossorier, Marco Chiani},
journal={IEEE Trans. Inform. Theory, vol. 55, no. 3, pp. 1027-1046, March
2009},
year={2008},
doi={10.1109/TIT.2008.2011446},
arch... | paolini2008doubly-generalized |
arxiv-2571 | 0802.0832 | Distributed Double Spending Prevention | <|reference_start|>Distributed Double Spending Prevention: We study the problem of preventing double spending in electronic payment schemes in a distributed fashion. This problem occurs, for instance, when the spending of electronic coins needs to be controlled by a large collection of nodes (eg. in a peer-to-peer (P2P... | arxiv | @article{hoepman2008distributed,
title={Distributed Double Spending Prevention},
author={Jaap-Henk Hoepman},
journal={arXiv preprint arXiv:0802.0832},
year={2008},
archivePrefix={arXiv},
eprint={0802.0832},
primaryClass={cs.CR}
} | hoepman2008distributed |
arxiv-2572 | 0802.0834 | The Ephemeral Pairing Problem | <|reference_start|>The Ephemeral Pairing Problem: In wireless ad-hoc broadcast networks the pairing problem consists of establishing a (long-term) connection between two specific physical nodes in the network that do not yet know each other. We focus on the ephemeral version of this problem. Ephemeral pairings occur, f... | arxiv | @article{hoepman2008the,
title={The Ephemeral Pairing Problem},
author={Jaap-Henk Hoepman},
journal={In 8th Int. Conf. Financial Cryptography, LNCS 3110, pages
212-226, Key West, FL, USA, February 9-12 2004. Springer},
year={2008},
archivePrefix={arXiv},
eprint={0802.0834},
primaryClass={c... | hoepman2008the |
arxiv-2573 | 0802.0835 | Bit-Optimal Lempel-Ziv compression | <|reference_start|>Bit-Optimal Lempel-Ziv compression: One of the most famous and investigated lossless data-compression scheme is the one introduced by Lempel and Ziv about 40 years ago. This compression scheme is known as "dictionary-based compression" and consists of squeezing an input string by replacing some of it... | arxiv | @article{ferragina2008bit-optimal,
title={Bit-Optimal Lempel-Ziv compression},
author={Paolo Ferragina, Igor Nitto and Rossano Venturini},
journal={arXiv preprint arXiv:0802.0835},
year={2008},
archivePrefix={arXiv},
eprint={0802.0835},
primaryClass={cs.DS cs.IT math.IT}
} | ferragina2008bit-optimal |
arxiv-2574 | 0802.0861 | Using Bayesian Blocks to Partition Self-Organizing Maps | <|reference_start|>Using Bayesian Blocks to Partition Self-Organizing Maps: Self organizing maps (SOMs) are widely-used for unsupervised classification. For this application, they must be combined with some partitioning scheme that can identify boundaries between distinct regions in the maps they produce. We discuss a ... | arxiv | @article{gazis2008using,
title={Using Bayesian Blocks to Partition Self-Organizing Maps},
author={Paul R. Gazis and Jeffrey D. Scargle},
journal={arXiv preprint arXiv:0802.0861},
year={2008},
archivePrefix={arXiv},
eprint={0802.0861},
primaryClass={cs.NE}
} | gazis2008using |
arxiv-2575 | 0802.0865 | Combining generic judgments with recursive definitions | <|reference_start|>Combining generic judgments with recursive definitions: Many semantical aspects of programming languages, such as their operational semantics and their type assignment calculi, are specified by describing appropriate proof systems. Recent research has identified two proof-theoretic features that allo... | arxiv | @article{gacek2008combining,
title={Combining generic judgments with recursive definitions},
author={Andrew Gacek, Dale Miller, and Gopalan Nadathur},
journal={arXiv preprint arXiv:0802.0865},
year={2008},
archivePrefix={arXiv},
eprint={0802.0865},
primaryClass={cs.LO}
} | gacek2008combining |
arxiv-2576 | 0802.0914 | Shrinkage Effect in Ancestral Maximum Likelihood | <|reference_start|>Shrinkage Effect in Ancestral Maximum Likelihood: Ancestral maximum likelihood (AML) is a method that simultaneously reconstructs a phylogenetic tree and ancestral sequences from extant data (sequences at the leaves). The tree and ancestral sequences maximize the probability of observing the given da... | arxiv | @article{mossel2008shrinkage,
title={Shrinkage Effect in Ancestral Maximum Likelihood},
author={Elchanan Mossel and Sebastien Roch and Mike Steel},
journal={arXiv preprint arXiv:0802.0914},
year={2008},
archivePrefix={arXiv},
eprint={0802.0914},
primaryClass={q-bio.PE cs.CE math.PR math.ST s... | mossel2008shrinkage |
arxiv-2577 | 0802.1002 | New Estimation Procedures for PLS Path Modelling | <|reference_start|>New Estimation Procedures for PLS Path Modelling: Given R groups of numerical variables X1, ... XR, we assume that each group is the result of one underlying latent variable, and that all latent variables are bound together through a linear equation system. Moreover, we assume that some explanatory l... | arxiv | @article{bry2008new,
title={New Estimation Procedures for PLS Path Modelling},
author={Xavier Bry (I3M)},
journal={arXiv preprint arXiv:0802.1002},
year={2008},
archivePrefix={arXiv},
eprint={0802.1002},
primaryClass={cs.LG}
} | bry2008new |
arxiv-2578 | 0802.1015 | Small Is Not Always Beautiful | <|reference_start|>Small Is Not Always Beautiful: Peer-to-peer content distribution systems have been enjoying great popularity, and are now gaining momentum as a means of disseminating video streams over the Internet. In many of these protocols, including the popular BitTorrent, content is split into mostly fixed-size... | arxiv | @article{marciniak2008small,
title={Small Is Not Always Beautiful},
author={Pawel Marciniak, Nikitas Liogkas (UCLA), Arnaud Legout (INRIA Sophia
Antipolis / INRIA Rh^one-Alpes), Eddie Kohler (UCLA)},
journal={Dans IPTPS'2008 (2008)},
year={2008},
archivePrefix={arXiv},
eprint={0802.1015},
... | marciniak2008small |
arxiv-2579 | 0802.1026 | An Empirical Study of Cache-Oblivious Priority Queues and their Application to the Shortest Path Problem | <|reference_start|>An Empirical Study of Cache-Oblivious Priority Queues and their Application to the Shortest Path Problem: In recent years the Cache-Oblivious model of external memory computation has provided an attractive theoretical basis for the analysis of algorithms on massive datasets. Much progress has been ma... | arxiv | @article{sach2008an,
title={An Empirical Study of Cache-Oblivious Priority Queues and their
Application to the Shortest Path Problem},
author={Benjamin Sach and Rapha"el Clifford},
journal={arXiv preprint arXiv:0802.1026},
year={2008},
archivePrefix={arXiv},
eprint={0802.1026},
primaryClas... | sach2008an |
arxiv-2580 | 0802.1059 | Average-Case Analysis of Online Topological Ordering | <|reference_start|>Average-Case Analysis of Online Topological Ordering: Many applications like pointer analysis and incremental compilation require maintaining a topological ordering of the nodes of a directed acyclic graph (DAG) under dynamic updates. All known algorithms for this problem are either only analyzed for... | arxiv | @article{ajwani2008average-case,
title={Average-Case Analysis of Online Topological Ordering},
author={Deepak Ajwani, Tobias Friedrich},
journal={arXiv preprint arXiv:0802.1059},
year={2008},
archivePrefix={arXiv},
eprint={0802.1059},
primaryClass={cs.DS}
} | ajwani2008average-case |
arxiv-2581 | 0802.1076 | New Extensions of Pairing-based Signatures into Universal (Multi) Designated Verifier Signatures | <|reference_start|>New Extensions of Pairing-based Signatures into Universal (Multi) Designated Verifier Signatures: The concept of universal designated verifier signatures was introduced by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt 2003. These signatures can be used as standard publicly verifiable digital signat... | arxiv | @article{vergnaud2008new,
title={New Extensions of Pairing-based Signatures into Universal (Multi)
Designated Verifier Signatures},
author={Damien Vergnaud},
journal={arXiv preprint arXiv:0802.1076},
year={2008},
archivePrefix={arXiv},
eprint={0802.1076},
primaryClass={cs.CR}
} | vergnaud2008new |
arxiv-2582 | 0802.1113 | Multi-Use Unidirectional Proxy Re-Signatures | <|reference_start|>Multi-Use Unidirectional Proxy Re-Signatures: In 1998, Blaze, Bleumer, and Strauss suggested a cryptographic primitive named proxy re-signatures where a proxy turns a signature computed under Alice's secret key into one from Bob on the same message. The semi-trusted proxy does not learn either party'... | arxiv | @article{libert2008multi-use,
title={Multi-Use Unidirectional Proxy Re-Signatures},
author={Beno^it Libert and Damien Vergnaud},
journal={arXiv preprint arXiv:0802.1113},
year={2008},
archivePrefix={arXiv},
eprint={0802.1113},
primaryClass={cs.CR}
} | libert2008multi-use |
arxiv-2583 | 0802.1123 | Snap-Stabilization in Message-Passing Systems | <|reference_start|>Snap-Stabilization in Message-Passing Systems: In this paper, we tackle the open problem of snap-stabilization in message-passing systems. Snap-stabilization is a nice approach to design protocols that withstand transient faults. Compared to the well-known self-stabilizing approach, snap-stabilizatio... | arxiv | @article{delaët2008snap-stabilization,
title={Snap-Stabilization in Message-Passing Systems},
author={Sylvie Dela"et (LRI), St'ephane Devismes (LRI), Mikhail Nesterenko,
S'ebastien Tixeuil (INRIA Futurs, LIP6)},
journal={arXiv preprint arXiv:0802.1123},
year={2008},
archivePrefix={arXiv},
epri... | delaët2008snap-stabilization |
arxiv-2584 | 0802.1162 | Approximate substitutions and the normal ordering problem | <|reference_start|>Approximate substitutions and the normal ordering problem: In this paper, we show that the infinite generalised Stirling matrices associated with boson strings with one annihilation operator are projective limits of approximate substitutions, the latter being characterised by a finite set of algebrai... | arxiv | @article{cheballah2008approximate,
title={Approximate substitutions and the normal ordering problem},
author={H. Cheballah (LIPN), G. H. E. Duchamp (LIPN), K. A. Penson (LPTMC)},
journal={arXiv preprint arXiv:0802.1162},
year={2008},
doi={10.1088/1742-6596/104/1/012031},
archivePrefix={arXiv},
... | cheballah2008approximate |
arxiv-2585 | 0802.1176 | Note sur les temps de service r\'esiduels dans les syst\`emes type M/G/c | <|reference_start|>Note sur les temps de service r\'esiduels dans les syst\`emes type M/G/c: Approximations for the mean performance indices for the M/G/c queue rely on the approximate computation of the probability that an arriving request has to wait for service and of the minimum of residual service times if all ser... | arxiv | @article{begin2008note,
title={Note sur les temps de service r\'esiduels dans les syst\`emes type M/G/c},
author={Thomas Begin (LIP6), Alexandre Brandwajn (UCSC)},
journal={Colloque Francophone sur l'Ing\'enierie des Protocoles (CFIP), Les
Arcs : France (2008)},
year={2008},
archivePrefix={arXiv},... | begin2008note |
arxiv-2586 | 0802.1220 | Complexity of Decoding Positive-Rate Reed-Solomon Codes | <|reference_start|>Complexity of Decoding Positive-Rate Reed-Solomon Codes: The complexity of maximal likelihood decoding of the Reed-Solomon codes $[q-1, k]_q$ is a well known open problem. The only known result in this direction states that it is at least as hard as the discrete logarithm in some cases where the info... | arxiv | @article{cheng2008complexity,
title={Complexity of Decoding Positive-Rate Reed-Solomon Codes},
author={Qi Cheng and Daqing Wan},
journal={arXiv preprint arXiv:0802.1220},
year={2008},
archivePrefix={arXiv},
eprint={0802.1220},
primaryClass={cs.IT math.IT}
} | cheng2008complexity |
arxiv-2587 | 0802.1226 | Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique | <|reference_start|>Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique: In this paper, we first introduce a lower bound technique for the state complexity of transformations of automata. Namely we suggest first considering the class of full automata in lower bound analysis, and later redu... | arxiv | @article{yan2008lower,
title={Lower Bounds for Complementation of omega-Automata Via the Full Automata
Technique},
author={Qiqi Yan},
journal={Logical Methods in Computer Science, Volume 4, Issue 1 (March 19,
2008) lmcs:992},
year={2008},
doi={10.2168/LMCS-4(1:5)2008},
archivePrefix={arXiv},... | yan2008lower |
arxiv-2588 | 0802.1237 | Minimum Entropy Orientations | <|reference_start|>Minimum Entropy Orientations: We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy set cover problem previously studied by Halperin and Karp [Theoret. Comput. Sci., 2005] and b... | arxiv | @article{cardinal2008minimum,
title={Minimum Entropy Orientations},
author={Jean Cardinal, Samuel Fiorini, and Gwena"el Joret},
journal={Operations Research Letters 36 (2008), pp. 680-683},
year={2008},
doi={10.1016/j.orl.2008.06.010},
archivePrefix={arXiv},
eprint={0802.1237},
primaryCl... | cardinal2008minimum |
arxiv-2589 | 0802.1244 | Learning Balanced Mixtures of Discrete Distributions with Small Sample | <|reference_start|>Learning Balanced Mixtures of Discrete Distributions with Small Sample: We study the problem of partitioning a small sample of $n$ individuals from a mixture of $k$ product distributions over a Boolean cube $\{0, 1\}^K$ according to their distributions. Each distribution is described by a vector of a... | arxiv | @article{zhou2008learning,
title={Learning Balanced Mixtures of Discrete Distributions with Small Sample},
author={Shuheng Zhou},
journal={arXiv preprint arXiv:0802.1244},
year={2008},
archivePrefix={arXiv},
eprint={0802.1244},
primaryClass={cs.LG stat.ML}
} | zhou2008learning |
arxiv-2590 | 0802.1258 | Bayesian Nonlinear Principal Component Analysis Using Random Fields | <|reference_start|>Bayesian Nonlinear Principal Component Analysis Using Random Fields: We propose a novel model for nonlinear dimension reduction motivated by the probabilistic formulation of principal component analysis. Nonlinearity is achieved by specifying different transformation matrices at different locations o... | arxiv | @article{lian2008bayesian,
title={Bayesian Nonlinear Principal Component Analysis Using Random Fields},
author={Heng Lian},
journal={arXiv preprint arXiv:0802.1258},
year={2008},
archivePrefix={arXiv},
eprint={0802.1258},
primaryClass={cs.CV cs.LG}
} | lian2008bayesian |
arxiv-2591 | 0802.1274 | The Invar tensor package: Differential invariants of Riemann | <|reference_start|>The Invar tensor package: Differential invariants of Riemann: The long standing problem of the relations among the scalar invariants of the Riemann tensor is computationally solved for all 6x10^23 objects with up to 12 derivatives of the metric. This covers cases ranging from products of up to 6 undi... | arxiv | @article{martin-garcia2008the,
title={The Invar tensor package: Differential invariants of Riemann},
author={Jose M. Martin-Garcia, David Yllanes, Renato Portugal},
journal={Comp.Phys.Commun.179:586-590,2008},
year={2008},
doi={10.1016/j.cpc.2008.04.018},
archivePrefix={arXiv},
eprint={0802.... | martin-garcia2008the |
arxiv-2592 | 0802.1296 | On quantum statistics in data analysis | <|reference_start|>On quantum statistics in data analysis: Originally, quantum probability theory was developed to analyze statistical phenomena in quantum systems, where classical probability theory does not apply, because the lattice of measurable sets is not necessarily distributive. On the other hand, it is well kn... | arxiv | @article{pavlovic2008on,
title={On quantum statistics in data analysis},
author={Dusko Pavlovic},
journal={arXiv preprint arXiv:0802.1296},
year={2008},
archivePrefix={arXiv},
eprint={0802.1296},
primaryClass={cs.IR math.CT quant-ph}
} | pavlovic2008on |
arxiv-2593 | 0802.1303 | On GCD-morphic sequences | <|reference_start|>On GCD-morphic sequences: This note is a response to one of the problems posed by Kwa\'sniewski in [1,2], see also [3] i.e. GCD-morphic Problem III. We show that any GCD-morphic sequence $F$ is at the point product of primary GCD-morphic sequences and any GCD-morphic sequence is encoded by natural nu... | arxiv | @article{dziemiańczuk2008on,
title={On GCD-morphic sequences},
author={M. Dziemia'nczuk, W. Bajguz},
journal={arXiv preprint arXiv:0802.1303},
year={2008},
archivePrefix={arXiv},
eprint={0802.1303},
primaryClass={math.CO cs.DM}
} | dziemiańczuk2008on |
arxiv-2594 | 0802.1306 | Network as a computer: ranking paths to find flows | <|reference_start|>Network as a computer: ranking paths to find flows: We explore a simple mathematical model of network computation, based on Markov chains. Similar models apply to a broad range of computational phenomena, arising in networks of computers, as well as in genetic, and neural nets, in social networks, an... | arxiv | @article{pavlovic2008network,
title={Network as a computer: ranking paths to find flows},
author={Dusko Pavlovic},
journal={arXiv preprint arXiv:0802.1306},
year={2008},
archivePrefix={arXiv},
eprint={0802.1306},
primaryClass={cs.IR cs.AI math.CT}
} | pavlovic2008network |
arxiv-2595 | 0802.1312 | Untangling polygons and graphs | <|reference_start|>Untangling polygons and graphs: Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C_n while keeping at least \Omega(n^{2/3}) vertice... | arxiv | @article{cibulka2008untangling,
title={Untangling polygons and graphs},
author={Josef Cibulka},
journal={Discrete and Computational Geometry 43(2): 402-411 (2010)},
year={2008},
doi={10.1007/s00454-009-9150-x},
archivePrefix={arXiv},
eprint={0802.1312},
primaryClass={cs.CG cs.DM}
} | cibulka2008untangling |
arxiv-2596 | 0802.1327 | Exchange of Limits: Why Iterative Decoding Works | <|reference_start|>Exchange of Limits: Why Iterative Decoding Works: We consider communication over binary-input memoryless output-symmetric channels using low-density parity-check codes and message-passing decoding. The asymptotic (in the length) performance of such a combination for a fixed number of iterations is gi... | arxiv | @article{korada2008exchange,
title={Exchange of Limits: Why Iterative Decoding Works},
author={Satish Babu Korada, Ruediger Urbanke},
journal={arXiv preprint arXiv:0802.1327},
year={2008},
archivePrefix={arXiv},
eprint={0802.1327},
primaryClass={cs.IT math.IT}
} | korada2008exchange |
arxiv-2597 | 0802.1332 | A connection between palindromic and factor complexity using return words | <|reference_start|>A connection between palindromic and factor complexity using return words: In this paper we prove that for any infinite word W whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes are palindromes; (II) P(n) + P(n+1) = C(n+... | arxiv | @article{bucci2008a,
title={A connection between palindromic and factor complexity using return
words},
author={Michelangelo Bucci, Alessandro De Luca, Amy Glen, Luca Q. Zamboni},
journal={Advances In Applied Mathematics 42 (2009) 60--74},
year={2008},
doi={10.1016/j.aam.2008.03.005},
archiveP... | bucci2008a |
arxiv-2598 | 0802.1338 | Some results on (a:b)-choosability | <|reference_start|>Some results on (a:b)-choosability: A solution to a problem of Erd\H{o}s, Rubin and Taylor is obtained by showing that if a graph $G$ is $(a:b)$-choosable, and $c/d > a/b$, then $G$ is not necessarily $(c:d)$-choosable. Applying probabilistic methods, an upper bound for the $k^{th}$ choice number of ... | arxiv | @article{gutner2008some,
title={Some results on (a:b)-choosability},
author={Shai Gutner and Michael Tarsi},
journal={arXiv preprint arXiv:0802.1338},
year={2008},
archivePrefix={arXiv},
eprint={0802.1338},
primaryClass={cs.DM cs.CC cs.DS}
} | gutner2008some |
arxiv-2599 | 0802.1348 | Fourier-Based Spectral Analysis with Adaptive Resolution | <|reference_start|>Fourier-Based Spectral Analysis with Adaptive Resolution: Despite being the most popular methods of data analysis, Fourier-based techniques suffer from the problem of static resolution that is currently believed to be a fundamental limitation of the Fourier Transform. Although alternative solutions o... | arxiv | @article{khilko2008fourier-based,
title={Fourier-Based Spectral Analysis with Adaptive Resolution},
author={Andrey Khilko},
journal={arXiv preprint arXiv:0802.1348},
year={2008},
archivePrefix={arXiv},
eprint={0802.1348},
primaryClass={physics.data-an cs.NA math.GM}
} | khilko2008fourier-based |
arxiv-2600 | 0802.1361 | Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs | <|reference_start|>Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs: We consider the problem of monitoring an art gallery modeled as a polygon, the edges of which are arcs of curves, with edge or mobile guards. Our focus is on piecewise-convex polygons, i.e., polygon... | arxiv | @article{karavelas2008guarding,
title={Guarding curvilinear art galleries with edge or mobile guards via
2-dominance of triangulation graphs},
author={Menelaos I. Karavelas},
journal={Comput. Geom. Theory Appl. 44(1):20-51, 2011},
year={2008},
doi={10.1016/j.comgeo.2010.07.002},
archivePrefix=... | karavelas2008guarding |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.