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-2301 | 0801.0841 | Capacity of the Bosonic Wiretap Channel and the Entropy Photon-Number Inequality | <|reference_start|>Capacity of the Bosonic Wiretap Channel and the Entropy Photon-Number Inequality: Determining the ultimate classical information carrying capacity of electromagnetic waves requires quantum-mechanical analysis to properly account for the bosonic nature of these waves. Recent work has established capac... | arxiv | @article{guha2008capacity,
title={Capacity of the Bosonic Wiretap Channel and the Entropy Photon-Number
Inequality},
author={Saikat Guha, Jeffrey H. Shapiro, Baris I. Erkmen},
journal={arXiv preprint arXiv:0801.0841},
year={2008},
archivePrefix={arXiv},
eprint={0801.0841},
primaryClass={qu... | guha2008capacity |
arxiv-2302 | 0801.0857 | Period-Different $m$-Sequences With At Most A Four-Valued Cross Correlation | <|reference_start|>Period-Different $m$-Sequences With At Most A Four-Valued Cross Correlation: In this paper, we follow the recent work of Helleseth, Kholosha, Johanssen and Ness to study the cross correlation between an $m$-sequence of period $2^m-1$ and the $d$-decimation of an $m$-sequence of shorter period $2^{n}-... | arxiv | @article{hu2008period-different,
title={Period-Different $m$-Sequences With At Most A Four-Valued Cross
Correlation},
author={Lei Hu, Xiangyong Zeng, Nian Li, and Wenfeng Jiang},
journal={arXiv preprint arXiv:0801.0857},
year={2008},
archivePrefix={arXiv},
eprint={0801.0857},
primaryClass=... | hu2008period-different |
arxiv-2303 | 0801.0882 | Call-by-value Termination in the Untyped lambda-calculus | <|reference_start|>Call-by-value Termination in the Untyped lambda-calculus: A fully-automated algorithm is developed able to show that evaluation of a given untyped lambda-expression will terminate under CBV (call-by-value). The ``size-change principle'' from first-order programs is extended to arbitrary untyped lambd... | arxiv | @article{jones2008call-by-value,
title={Call-by-value Termination in the Untyped lambda-calculus},
author={Neil D. Jones and Nina Bohr},
journal={Logical Methods in Computer Science, Volume 4, Issue 1 (March 17,
2008) lmcs:915},
year={2008},
doi={10.2168/LMCS-4(1:3)2008},
archivePrefix={arXiv}... | jones2008call-by-value |
arxiv-2304 | 0801.0931 | The Asymptotic Bit Error Probability of LDPC Codes for the Binary Erasure Channel with Finite Iteration Number | <|reference_start|>The Asymptotic Bit Error Probability of LDPC Codes for the Binary Erasure Channel with Finite Iteration Number: We consider communication over the binary erasure channel (BEC) using low-density parity-check (LDPC) code and belief propagation (BP) decoding. The bit error probability for infinite block... | arxiv | @article{mori2008the,
title={The Asymptotic Bit Error Probability of LDPC Codes for the Binary
Erasure Channel with Finite Iteration Number},
author={Ryuhei Mori, Kenta Kasai, Tomoharu Shibuya, and Kohichi Sakaniwa},
journal={arXiv preprint arXiv:0801.0931},
year={2008},
archivePrefix={arXiv},
... | mori2008the |
arxiv-2305 | 0801.0938 | Cognitive Networks Achieve Throughput Scaling of a Homogeneous Network | <|reference_start|>Cognitive Networks Achieve Throughput Scaling of a Homogeneous Network: We study two distinct, but overlapping, networks that operate at the same time, space, and frequency. The first network consists of $n$ randomly distributed \emph{primary users}, which form either an ad hoc network, or an infrast... | arxiv | @article{jeon2008cognitive,
title={Cognitive Networks Achieve Throughput Scaling of a Homogeneous Network},
author={Sang-Woon Jeon, Natasha Devroye, Mai Vu, Sae-Young Chung, Vahid Tarokh},
journal={IEEE Transactions on Information Theory, vol. 57, no. 8, pp.
5103-5115, Aug. 2011},
year={2008},
doi... | jeon2008cognitive |
arxiv-2306 | 0801.0949 | On the Refinement of Liveness Properties of Distributed Systems | <|reference_start|>On the Refinement of Liveness Properties of Distributed Systems: We present a new approach for reasoning about liveness properties of distributed systems, represented as automata. Our approach is based on simulation relations, and requires reasoning only over finite execution fragments. Current simul... | arxiv | @article{attie2008on,
title={On the Refinement of Liveness Properties of Distributed Systems},
author={Paul C. Attie},
journal={arXiv preprint arXiv:0801.0949},
year={2008},
archivePrefix={arXiv},
eprint={0801.0949},
primaryClass={cs.LO}
} | attie2008on |
arxiv-2307 | 0801.0969 | Pareto and Boltzmann-Gibbs behaviors in a deterministic multi-agent system | <|reference_start|>Pareto and Boltzmann-Gibbs behaviors in a deterministic multi-agent system: A deterministic system of interacting agents is considered as a model for economic dynamics. The dynamics of the system is described by a coupled map lattice with near neighbor interactions. The evolution of each agent result... | arxiv | @article{gonzalez-estevez2008pareto,
title={Pareto and Boltzmann-Gibbs behaviors in a deterministic multi-agent
system},
author={J. Gonzalez-Estevez, M. G. Cosenza, R. Lopez-Ruiz, and J. R. Sanchez},
journal={arXiv preprint arXiv:0801.0969},
year={2008},
doi={10.1016/j.physa.2008.03.013},
arch... | gonzalez-estevez2008pareto |
arxiv-2308 | 0801.1002 | Capacity Bounds for Peak-Constrained Multiantenna Wideband Channels | <|reference_start|>Capacity Bounds for Peak-Constrained Multiantenna Wideband Channels: We derive bounds on the noncoherent capacity of a very general class of multiple-input multiple-output channels that allow for selectivity in time and frequency as well as for spatial correlation. The bounds apply to peak-constraine... | arxiv | @article{schuster2008capacity,
title={Capacity Bounds for Peak-Constrained Multiantenna Wideband Channels},
author={Ulrich G. Schuster and Giuseppe Durisi and Helmut B"olcskei and H.
Vincent Poor},
journal={arXiv preprint arXiv:0801.1002},
year={2008},
archivePrefix={arXiv},
eprint={0801.1002}... | schuster2008capacity |
arxiv-2309 | 0801.1033 | The What, Who, Where, When, Why and How of Context-Awareness | <|reference_start|>The What, Who, Where, When, Why and How of Context-Awareness: The understanding of context and context-awareness is very important for the areas of handheld and ubiquitous computing. Unfortunately, at present, there has not been a satisfactory definition of these two concepts that would lead to a mor... | arxiv | @article{tsibidis2008the,
title={The What, Who, Where, When, Why and How of Context-Awareness},
author={George Tsibidis, Theodoros N. Arvanitis and Chris Baber},
journal={arXiv preprint arXiv:0801.1033},
year={2008},
archivePrefix={arXiv},
eprint={0801.1033},
primaryClass={cs.HC}
} | tsibidis2008the |
arxiv-2310 | 0801.1060 | On the Period of a Periodic-Finite-Type Shift | <|reference_start|>On the Period of a Periodic-Finite-Type Shift: Periodic-finite-type shifts (PFT's) form a class of sofic shifts that strictly contains the class of shifts of finite type (SFT's). In this paper, we investigate how the notion of "period" inherent in the definition of a PFT causes it to differ from an S... | arxiv | @article{manada2008on,
title={On the Period of a Periodic-Finite-Type Shift},
author={Akiko Manada and Navin Kashyap},
journal={arXiv preprint arXiv:0801.1060},
year={2008},
archivePrefix={arXiv},
eprint={0801.1060},
primaryClass={cs.IT math.IT}
} | manada2008on |
arxiv-2311 | 0801.1063 | Modeling Online Reviews with Multi-grain Topic Models | <|reference_start|>Modeling Online Reviews with Multi-grain Topic Models: In this paper we present a novel framework for extracting the ratable aspects of objects from online user reviews. Extracting such aspects is an important challenge in automatically mining product opinions from the web and in generating opinion-b... | arxiv | @article{titov2008modeling,
title={Modeling Online Reviews with Multi-grain Topic Models},
author={Ivan Titov and Ryan McDonald},
journal={arXiv preprint arXiv:0801.1063},
year={2008},
archivePrefix={arXiv},
eprint={0801.1063},
primaryClass={cs.IR cs.DB}
} | titov2008modeling |
arxiv-2312 | 0801.1067 | The lowest-possible BER and FER for any discrete memoryless channel with given capacity | <|reference_start|>The lowest-possible BER and FER for any discrete memoryless channel with given capacity: We investigate properties of a channel coding scheme leading to the minimum-possible frame error ratio when transmitting over a memoryless channel with rate R>C. The results are compared to the well-known propert... | arxiv | @article{huber2008the,
title={The lowest-possible BER and FER for any discrete memoryless channel with
given capacity},
author={Johannes B. Huber and Thorsten Hehn},
journal={arXiv preprint arXiv:0801.1067},
year={2008},
archivePrefix={arXiv},
eprint={0801.1067},
primaryClass={cs.IT math.I... | huber2008the |
arxiv-2313 | 0801.1126 | Concave Programming Upper Bounds on the Capacity of 2-D Constraints | <|reference_start|>Concave Programming Upper Bounds on the Capacity of 2-D Constraints: The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distributions, which is defined by some linear requirements. ... | arxiv | @article{tal2008concave,
title={Concave Programming Upper Bounds on the Capacity of 2-D Constraints},
author={Ido Tal, Ron M. Roth},
journal={arXiv preprint arXiv:0801.1126},
year={2008},
archivePrefix={arXiv},
eprint={0801.1126},
primaryClass={cs.IT math.IT}
} | tal2008concave |
arxiv-2314 | 0801.1136 | A Constrained Channel Coding Approach to Joint Communication and Channel Estimation | <|reference_start|>A Constrained Channel Coding Approach to Joint Communication and Channel Estimation: A joint communication and channel state estimation problem is investigated, in which reliable information transmission over a noisy channel, and high-fidelity estimation of the channel state, are simultaneously sough... | arxiv | @article{zhang2008a,
title={A Constrained Channel Coding Approach to Joint Communication and Channel
Estimation},
author={Wenyi Zhang, Satish Vedantam, and Urbashi Mitra},
journal={arXiv preprint arXiv:0801.1136},
year={2008},
archivePrefix={arXiv},
eprint={0801.1136},
primaryClass={cs.IT ... | zhang2008a |
arxiv-2315 | 0801.1138 | An Addendum to "How Good is PSK for Peak-Limited Fading Channels in the Low-SNR Regime?" | <|reference_start|>An Addendum to "How Good is PSK for Peak-Limited Fading Channels in the Low-SNR Regime?": A proof is provided of the operational achievability of $R_\mathrm{rt}$ by the recursive training scheme in \cite{zhang07:it}, for general wide-sense stationary and ergodic Rayleigh fading processes.<|reference_... | arxiv | @article{zhang2008an,
title={An Addendum to "How Good is PSK for Peak-Limited Fading Channels in the
Low-SNR Regime?"},
author={Wenyi Zhang},
journal={arXiv preprint arXiv:0801.1138},
year={2008},
archivePrefix={arXiv},
eprint={0801.1138},
primaryClass={cs.IT math.IT}
} | zhang2008an |
arxiv-2316 | 0801.1141 | Coding Strategies for Noise-Free Relay Cascades with Half-Duplex Constraint | <|reference_start|>Coding Strategies for Noise-Free Relay Cascades with Half-Duplex Constraint: Two types of noise-free relay cascades are investigated. Networks where a source communicates with a distant receiver via a cascade of half-duplex constrained relays, and networks where not only the source but also a single ... | arxiv | @article{lutz2008coding,
title={Coding Strategies for Noise-Free Relay Cascades with Half-Duplex
Constraint},
author={Tobias Lutz, Christoph Hausl, Ralf K"otter},
journal={arXiv preprint arXiv:0801.1141},
year={2008},
doi={10.1109/ISIT.2008.4595418},
archivePrefix={arXiv},
eprint={0801.114... | lutz2008coding |
arxiv-2317 | 0801.1179 | Corpus sp\'ecialis\'e et ressource de sp\'ecialit\'e | <|reference_start|>Corpus sp\'ecialis\'e et ressource de sp\'ecialit\'e: "Semantic Atlas" is a mathematic and statistic model to visualise word senses according to relations between words. The model, that has been applied to proximity relations from a corpus, has shown its ability to distinguish word senses as the corp... | arxiv | @article{jacquemin2008corpus,
title={Corpus sp{\'e}cialis{\'e} et ressource de sp{\'e}cialit{\'e}},
author={Bernard Jacquemin (ISC, UMR 7044, GERIICO), Sabine Ploux (ISC)},
journal={Appears in Fran\c{c}ois Maniez; Pascaline Dury; Nathalie Arlin;
Claire Rougemont. Corpus et dictionnaires de langues de sp{\... | jacquemin2008corpus |
arxiv-2318 | 0801.1185 | Capacity of the Discrete-Time AWGN Channel Under Output Quantization | <|reference_start|>Capacity of the Discrete-Time AWGN Channel Under Output Quantization: We investigate the limits of communication over the discrete-time Additive White Gaussian Noise (AWGN) channel, when the channel output is quantized using a small number of bits. We first provide a proof of our recent conjecture on... | arxiv | @article{singh2008capacity,
title={Capacity of the Discrete-Time AWGN Channel Under Output Quantization},
author={Jaspreet Singh, Onkar Dabeer and Upamanyu Madhow},
journal={arXiv preprint arXiv:0801.1185},
year={2008},
archivePrefix={arXiv},
eprint={0801.1185},
primaryClass={cs.IT math.IT}
... | singh2008capacity |
arxiv-2319 | 0801.1208 | Hybrid Decoding of Finite Geometry LDPC Codes | <|reference_start|>Hybrid Decoding of Finite Geometry LDPC Codes: For finite geometry low-density parity-check codes, heavy row and column weights in their parity check matrix make the decoding with even Min-Sum (MS) variants computationally expensive. To alleviate it, we present a class of hybrid schemes by concatenat... | arxiv | @article{li2008hybrid,
title={Hybrid Decoding of Finite Geometry LDPC Codes},
author={Guangwen Li, Dashe Li, Yuling Wang, Wenyan Sun},
journal={arXiv preprint arXiv:0801.1208},
year={2008},
archivePrefix={arXiv},
eprint={0801.1208},
primaryClass={cs.IT math.IT}
} | li2008hybrid |
arxiv-2320 | 0801.1210 | Increasing GP Computing Power via Volunteer Computing | <|reference_start|>Increasing GP Computing Power via Volunteer Computing: This paper describes how it is possible to increase GP Computing Power via Volunteer Computing (VC) using the BOINC framework. Two experiments using well-known GP tools -Lil-gp & ECJ- are performed in order to demonstrate the benefit of using VC ... | arxiv | @article{gonzalez2008increasing,
title={Increasing GP Computing Power via Volunteer Computing},
author={Daniel Lombrana Gonzalez, Francisco Fernandez de Vega, L. Trujillo, G.
Olague, F. Chavez de la O, M. Cardenas, L. Araujo, P. Castillo, K. Sharman},
journal={arXiv preprint arXiv:0801.1210},
year={20... | gonzalez2008increasing |
arxiv-2321 | 0801.1219 | DSL development based on target meta-models Using AST transformations for automating semantic analysis in a textual DSL framework | <|reference_start|>DSL development based on target meta-models Using AST transformations for automating semantic analysis in a textual DSL framework: This paper describes an approach to creating textual syntax for Do- main-Specific Languages (DSL). We consider target meta-model to be the main artifact and hence to be d... | arxiv | @article{breslav2008dsl,
title={DSL development based on target meta-models. Using AST transformations
for automating semantic analysis in a textual DSL framework},
author={Andrey Breslav},
journal={arXiv preprint arXiv:0801.1219},
year={2008},
archivePrefix={arXiv},
eprint={0801.1219},
pr... | breslav2008dsl |
arxiv-2322 | 0801.1245 | Matrix Graph Grammars | <|reference_start|>Matrix Graph Grammars: This book objective is to develop an algebraization of graph grammars. Equivalently, we study graph dynamics. From the point of view of a computer scientist, graph grammars are a natural generalization of Chomsky grammars for which a purely algebraic approach does not exist up ... | arxiv | @article{velasco2008matrix,
title={Matrix Graph Grammars},
author={Pedro Pablo Perez Velasco},
journal={arXiv preprint arXiv:0801.1245},
year={2008},
archivePrefix={arXiv},
eprint={0801.1245},
primaryClass={cs.DM}
} | velasco2008matrix |
arxiv-2323 | 0801.1251 | Generative Unbinding of Names | <|reference_start|>Generative Unbinding of Names: This paper is concerned with the form of typed name binding used by the FreshML family of languages. Its characteristic feature is that a name binding is represented by an abstract (name,value)-pair that may only be deconstructed via the generation of fresh bound names.... | arxiv | @article{pitts2008generative,
title={Generative Unbinding of Names},
author={Andrew M. Pitts and Mark R. Shinwell},
journal={Logical Methods in Computer Science, Volume 4, Issue 1 (March 18,
2008) lmcs:916},
year={2008},
doi={10.2168/LMCS-4(1:4)2008},
archivePrefix={arXiv},
eprint={0801.12... | pitts2008generative |
arxiv-2324 | 0801.1253 | Linear Logic by Levels and Bounded Time Complexity | <|reference_start|>Linear Logic by Levels and Bounded Time Complexity: We give a new characterization of elementary and deterministic polynomial time computation in linear logic through the proofs-as-programs correspondence. Girard's seminal results, concerning elementary and light linear logic, achieve this characteri... | arxiv | @article{baillot2008linear,
title={Linear Logic by Levels and Bounded Time Complexity},
author={Patrick Baillot and Damiano Mazza},
journal={Theoretical Computer Science 411 (2010) 470-503},
year={2008},
doi={10.1016/j.tcs.2009.09.015},
archivePrefix={arXiv},
eprint={0801.1253},
primaryC... | baillot2008linear |
arxiv-2325 | 0801.1275 | Le terme et le concept : fondements d'une ontoterminologie | <|reference_start|>Le terme et le concept : fondements d'une ontoterminologie: Most definitions of ontology, viewed as a "specification of a conceptualization", agree on the fact that if an ontology can take different forms, it necessarily includes a vocabulary of terms and some specification of their meaning in relati... | arxiv | @article{roche2008le,
title={Le terme et le concept : fondements d'une ontoterminologie},
author={Christophe Roche (LISTIC)},
journal={Dans TOTh 2007 : Terminologie et Ontologie : Th\'eories et
Applications - TOTh 2007 : Terminologie et Ontologie : Th\'eories et
Applications, Annecy : France (2007)},
... | roche2008le |
arxiv-2326 | 0801.1276 | On the guaranteed error correction capability of LDPC codes | <|reference_start|>On the guaranteed error correction capability of LDPC codes: We investigate the relation between the girth and the guaranteed error correction capability of $\gamma$-left regular LDPC codes when decoded using the bit flipping (serial and parallel) algorithms. A lower bound on the number of variable n... | arxiv | @article{chilappagari2008on,
title={On the guaranteed error correction capability of LDPC codes},
author={Shashi Kiran Chilappagari, Dung Viet Nguyen, Bane Vasic, Michael
Marcellin},
journal={arXiv preprint arXiv:0801.1276},
year={2008},
doi={10.1109/ISIT.2008.4595023},
archivePrefix={arXiv},
... | chilappagari2008on |
arxiv-2327 | 0801.1282 | LDPC Codes Which Can Correct Three Errors Under Iterative Decoding | <|reference_start|>LDPC Codes Which Can Correct Three Errors Under Iterative Decoding: In this paper, we provide necessary and sufficient conditions for a column-weight-three LDPC code to correct three errors when decoded using Gallager A algorithm. We then provide a construction technique which results in a code satis... | arxiv | @article{chilappagari2008ldpc,
title={LDPC Codes Which Can Correct Three Errors Under Iterative Decoding},
author={Shashi Kiran Chilappagari, Anantha Raman Krishnan, Bane Vasic},
journal={arXiv preprint arXiv:0801.1282},
year={2008},
doi={10.1109/ITW.2008.4578696},
archivePrefix={arXiv},
epr... | chilappagari2008ldpc |
arxiv-2328 | 0801.1300 | Almost 2-SAT is Fixed-Parameter Tractable | <|reference_start|>Almost 2-SAT is Fixed-Parameter Tractable: We consider the following problem. Given a 2-CNF formula, is it possible to remove at most $k$ clauses so that the resulting 2-CNF formula is satisfiable? This problem is known to different research communities in Theoretical Computer Science under the names... | arxiv | @article{razgon2008almost,
title={Almost 2-SAT is Fixed-Parameter Tractable},
author={Igor Razgon and Barry O'Sullivan},
journal={arXiv preprint arXiv:0801.1300},
year={2008},
archivePrefix={arXiv},
eprint={0801.1300},
primaryClass={cs.DS cs.CG cs.LO}
} | razgon2008almost |
arxiv-2329 | 0801.1306 | Capacity Bounds for the Gaussian Interference Channel | <|reference_start|>Capacity Bounds for the Gaussian Interference Channel: The capacity region of the two-user Gaussian Interference Channel (IC) is studied. Three classes of channels are considered: weak, one-sided, and mixed Gaussian IC. For the weak Gaussian IC, a new outer bound on the capacity region is obtained th... | arxiv | @article{motahari2008capacity,
title={Capacity Bounds for the Gaussian Interference Channel},
author={Abolfazl S. Motahari, Amir K. Khandani},
journal={arXiv preprint arXiv:0801.1306},
year={2008},
archivePrefix={arXiv},
eprint={0801.1306},
primaryClass={cs.IT math.IT}
} | motahari2008capacity |
arxiv-2330 | 0801.1307 | Alternating Hierarchies for Time-Space Tradeoffs | <|reference_start|>Alternating Hierarchies for Time-Space Tradeoffs: Nepomnjascii's Theorem states that for all 0 <= \epsilon < 1 and k > 0 the class of languages recognized in nondeterministic time n^k and space n^\epsilon, NTISP[n^k, n^\epsilon ], is contained in the linear time hierarchy. By considering restrictions... | arxiv | @article{pollett2008alternating,
title={Alternating Hierarchies for Time-Space Tradeoffs},
author={Chris Pollett and Eric Miles},
journal={arXiv preprint arXiv:0801.1307},
year={2008},
archivePrefix={arXiv},
eprint={0801.1307},
primaryClass={cs.CC cs.LO}
} | pollett2008alternating |
arxiv-2331 | 0801.1336 | Stream Computing | <|reference_start|>Stream Computing: Stream computing is the use of multiple autonomic and parallel modules together with integrative processors at a higher level of abstraction to embody "intelligent" processing. The biological basis of this computing is sketched and the matter of learning is examined.<|reference_end|... | arxiv | @article{kak2008stream,
title={Stream Computing},
author={Subhash Kak},
journal={arXiv preprint arXiv:0801.1336},
year={2008},
archivePrefix={arXiv},
eprint={0801.1336},
primaryClass={cs.AI}
} | kak2008stream |
arxiv-2332 | 0801.1341 | Factorization in categories of systems of linear partial differential equations | <|reference_start|>Factorization in categories of systems of linear partial differential equations: We start with elementary algebraic theory of factorization of linear ordinary differential equations developed in the period 1880-1930. After exposing these classical results we sketch more sophisticated algorithmic appr... | arxiv | @article{tsarev2008factorization,
title={Factorization in categories of systems of linear partial differential
equations},
author={S.P. Tsarev},
journal={arXiv preprint arXiv:0801.1341},
year={2008},
archivePrefix={arXiv},
eprint={0801.1341},
primaryClass={cs.SC}
} | tsarev2008factorization |
arxiv-2333 | 0801.1362 | A new key exchange cryptosystem | <|reference_start|>A new key exchange cryptosystem: In this paper, we will present a new key exchange cryptosystem based on linear algebra, which take less operations but weaker in security than Diffie-Hellman's one.<|reference_end|> | arxiv | @article{li2008a,
title={A new key exchange cryptosystem},
author={An-Ping Li},
journal={arXiv preprint arXiv:0801.1362},
year={2008},
archivePrefix={arXiv},
eprint={0801.1362},
primaryClass={cs.CR}
} | li2008a |
arxiv-2334 | 0801.1364 | An Algorithm to Compute the Nearest Point in the Lattice $A_n^*$ | <|reference_start|>An Algorithm to Compute the Nearest Point in the Lattice $A_n^*$: The lattice $A_n^*$ is an important lattice because of its covering properties in low dimensions. Clarkson \cite{Clarkson1999:Anstar} described an algorithm to compute the nearest lattice point in $A_n^*$ that requires $O(n\log{n})$ ar... | arxiv | @article{mckilliam2008an,
title={An Algorithm to Compute the Nearest Point in the Lattice $A_{n}^*$},
author={Robby G. McKilliam, I. Vaughan L. Clarkson, Barry G. Quinn},
journal={IEEE Transactions on Information Theory, Vol. 54, No. 9, pp
4378-4381, Sept. 2008},
year={2008},
doi={10.1109/TIT.2008... | mckilliam2008an |
arxiv-2335 | 0801.1410 | Two graph isomorphism polytopes | <|reference_start|>Two graph isomorphism polytopes: The convex hull $\psi_{n,n}$ of certain $(n!)^2$ tensors was considered recently in connection with graph isomorphism. We consider the convex hull $\psi_n$ of the $n!$ diagonals among these tensors. We show: 1. The polytope $\psi_n$ is a face of $\psi_{n,n}$. 2. Decid... | arxiv | @article{onn2008two,
title={Two graph isomorphism polytopes},
author={Shmuel Onn},
journal={Discrete Mathematics, 309:2934--2936, 2009},
year={2008},
archivePrefix={arXiv},
eprint={0801.1410},
primaryClass={cs.CC cs.DM math.CO math.OC}
} | onn2008two |
arxiv-2336 | 0801.1415 | The emerging field of language dynamics | <|reference_start|>The emerging field of language dynamics: A simple review by a linguist, citing many articles by physicists: Quantitative methods, agent-based computer simulations, language dynamics, language typology, historical linguistics<|reference_end|> | arxiv | @article{wichmann2008the,
title={The emerging field of language dynamics},
author={S. Wichmann},
journal={arXiv preprint arXiv:0801.1415},
year={2008},
archivePrefix={arXiv},
eprint={0801.1415},
primaryClass={cs.CL physics.soc-ph}
} | wichmann2008the |
arxiv-2337 | 0801.1416 | Fast Integer Multiplication using Modular Arithmetic | <|reference_start|>Fast Integer Multiplication using Modular Arithmetic: We give an $O(N\cdot \log N\cdot 2^{O(\log^*N)})$ algorithm for multiplying two $N$-bit integers that improves the $O(N\cdot \log N\cdot \log\log N)$ algorithm by Sch\"{o}nhage-Strassen. Both these algorithms use modular arithmetic. Recently, F\"{... | arxiv | @article{de2008fast,
title={Fast Integer Multiplication using Modular Arithmetic},
author={Anindya De, Piyush P Kurur, Chandan Saha and Ramprasad Saptharishi},
journal={arXiv preprint arXiv:0801.1416},
year={2008},
archivePrefix={arXiv},
eprint={0801.1416},
primaryClass={cs.SC cs.DS}
} | de2008fast |
arxiv-2338 | 0801.1419 | Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime | <|reference_start|>Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime: Distributed systems are now both very large and highly dynamic. Peer to peer overlay networks have been proved efficient to cope with this new deal that traditional approaches can no longer accommodate. While the challenge of organi... | arxiv | @article{gramoli2008core,
title={Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime},
author={Vincent Gramoli (IRISA), Anne-Marie Kermarrec (IRISA), Achour
Mostefaoui (IRISA), Michel Raynal (IRISA), Bruno Sericola (IRISA)},
journal={Dans Proceedings of the Workshop on Reliability in Decen... | gramoli2008core |
arxiv-2339 | 0801.1500 | Toward the Graphics Turing Scale on a Blue Gene Supercomputer | <|reference_start|>Toward the Graphics Turing Scale on a Blue Gene Supercomputer: We investigate raytracing performance that can be achieved on a class of Blue Gene supercomputers. We measure a 822 times speedup over a Pentium IV on a 6144 processor Blue Gene/L. We measure the computational performance as a function of... | arxiv | @article{mcguigan2008toward,
title={Toward the Graphics Turing Scale on a Blue Gene Supercomputer},
author={Michael McGuigan},
journal={arXiv preprint arXiv:0801.1500},
year={2008},
archivePrefix={arXiv},
eprint={0801.1500},
primaryClass={cs.GR}
} | mcguigan2008toward |
arxiv-2340 | 0801.1514 | Teaching spreadsheet development using peer audit and self-audit methods for reducing error | <|reference_start|>Teaching spreadsheet development using peer audit and self-audit methods for reducing error: Recent research has highlighted the high incidence of errors in spreadsheet models used in industry. In an attempt to reduce the incidence of such errors, a teaching approach has been devised which aids stude... | arxiv | @article{chadwick2008teaching,
title={Teaching spreadsheet development using peer audit and self-audit methods
for reducing error},
author={David Chadwick, Rodney E. Sue},
journal={European Spreadsheet Risks Int. Grp. 2001 95-105 ISBN:1 86166 179
7},
year={2008},
archivePrefix={arXiv},
eprin... | chadwick2008teaching |
arxiv-2341 | 0801.1516 | An Evaluation of a Structured Spreadsheet Development Methodology | <|reference_start|>An Evaluation of a Structured Spreadsheet Development Methodology: This paper presents the results of an empirical evaluation of the quality of a structured methodology for the development of spreadsheet models, proposed in numerous previous papers by Rajalingham K, Knight B and Chadwick D et al. Thi... | arxiv | @article{rajalingham2008an,
title={An Evaluation of a Structured Spreadsheet Development Methodology},
author={Kamalasen Rajalingham, David Chadwick, Brian Knight},
journal={European Spreadsheet Risks Int. Grp. 2001 39-59 ISBN:1 86166 179},
year={2008},
archivePrefix={arXiv},
eprint={0801.1516},... | rajalingham2008an |
arxiv-2342 | 0801.1573 | Taking a shower in Youth Hostels: risks and delights of heterogeneity | <|reference_start|>Taking a shower in Youth Hostels: risks and delights of heterogeneity: Tuning one's shower in some hotels may turn into a challenging coordination game with imperfect information. The temperature sensitivity increases with the number of agents, making the problem possibly unlearnable. Because there i... | arxiv | @article{matzke2008taking,
title={Taking a shower in Youth Hostels: risks and delights of heterogeneity},
author={Christina Matzke and Damien Challet},
journal={arXiv preprint arXiv:0801.1573},
year={2008},
doi={10.1103/PhysRevE.84.016107},
archivePrefix={arXiv},
eprint={0801.1573},
prim... | matzke2008taking |
arxiv-2343 | 0801.1600 | A Most General Edge Elimination Polynomial - Thickening of Edges | <|reference_start|>A Most General Edge Elimination Polynomial - Thickening of Edges: We consider a graph polynomial \xi(G;x,y,z) introduced by Averbouch, Godlin, and Makowsky (2007). This graph polynomial simultaneously generalizes the Tutte polynomial as well as a bivariate chromatic polynomial defined by Dohmen, Poen... | arxiv | @article{hoffmann2008a,
title={A Most General Edge Elimination Polynomial - Thickening of Edges},
author={Christian Hoffmann},
journal={arXiv preprint arXiv:0801.1600},
year={2008},
archivePrefix={arXiv},
eprint={0801.1600},
primaryClass={math.CO cs.CC}
} | hoffmann2008a |
arxiv-2344 | 0801.1630 | Computational Solutions for Today's Navy | <|reference_start|>Computational Solutions for Today's Navy: New methods are being employed to meet the Navy's changing software-development environment.<|reference_end|> | arxiv | @article{bentrem2008computational,
title={Computational Solutions for Today's Navy},
author={Frank W. Bentrem, John T. Sample, and Michael M. Harris (Naval
Research Laboratory)},
journal={Scientific Computing, vol. 25, no. 2, pp. 30-32 (March 2008)},
year={2008},
archivePrefix={arXiv},
eprint=... | bentrem2008computational |
arxiv-2345 | 0801.1655 | Episturmian words: a survey | <|reference_start|>Episturmian words: a survey: In this paper, we survey the rich theory of infinite episturmian words which generalize to any finite alphabet, in a rather resembling way, the well-known family of Sturmian words on two letters. After recalling definitions and basic properties, we consider episturmian mo... | arxiv | @article{glen2008episturmian,
title={Episturmian words: a survey},
author={Amy Glen, Jacques Justin},
journal={RAIRO - Theoretical Informatics and Applications 43 (2009) 402-433},
year={2008},
doi={10.1051/ita/2009003},
archivePrefix={arXiv},
eprint={0801.1655},
primaryClass={math.CO cs.... | glen2008episturmian |
arxiv-2346 | 0801.1656 | Palindromic Richness | <|reference_start|>Palindromic Richness: In this paper, we study combinatorial and structural properties of a new class of finite and infinite words that are 'rich' in palindromes in the utmost sense. A characteristic property of so-called "rich words" is that all complete returns to any palindromic factor are themselv... | arxiv | @article{glen2008palindromic,
title={Palindromic Richness},
author={Amy Glen, Jacques Justin, Steve Widmer, Luca Q. Zamboni},
journal={European Journal of Combinatorics 30 (2009) 510-531},
year={2008},
doi={10.1016/j.ejc.2008.04.006},
archivePrefix={arXiv},
eprint={0801.1656},
primaryCla... | glen2008palindromic |
arxiv-2347 | 0801.1658 | Computational approach to the emergence and evolution of language - evolutionary naming game model | <|reference_start|>Computational approach to the emergence and evolution of language - evolutionary naming game model: Computational modelling with multi-agent systems is becoming an important technique of studying language evolution. We present a brief introduction into this rapidly developing field, as well as our ow... | arxiv | @article{lipowski2008computational,
title={Computational approach to the emergence and evolution of language -
evolutionary naming game model},
author={Adam Lipowski, Dorota Lipowska},
journal={arXiv preprint arXiv:0801.1658},
year={2008},
archivePrefix={arXiv},
eprint={0801.1658},
primary... | lipowski2008computational |
arxiv-2348 | 0801.1676 | Analyzing the Topology Types arising in a Family of Algebraic Curves Depending On Two Parameters | <|reference_start|>Analyzing the Topology Types arising in a Family of Algebraic Curves Depending On Two Parameters: Given the implicit equation $F(x,y,t,s)$ of a family of algebraic plane curves depending on the parameters $t,s$, we provide an algorithm for studying the topology types arising in the family. For this p... | arxiv | @article{alcazar2008analyzing,
title={Analyzing the Topology Types arising in a Family of Algebraic Curves
Depending On Two Parameters},
author={Juan Gerardo Alcazar},
journal={arXiv preprint arXiv:0801.1676},
year={2008},
archivePrefix={arXiv},
eprint={0801.1676},
primaryClass={cs.SC}
} | alcazar2008analyzing |
arxiv-2349 | 0801.1687 | Synthesis of Large Dynamic Concurrent Programs from Dynamic Specifications | <|reference_start|>Synthesis of Large Dynamic Concurrent Programs from Dynamic Specifications: We present a tractable method for synthesizing arbitrarily large concurrent programs, for a shared memory model with common hardware-available primitives such as atomic registers, compare-and-swap, load-linked/store condition... | arxiv | @article{attie2008synthesis,
title={Synthesis of Large Dynamic Concurrent Programs from Dynamic
Specifications},
author={Paul C. Attie},
journal={arXiv preprint arXiv:0801.1687},
year={2008},
archivePrefix={arXiv},
eprint={0801.1687},
primaryClass={cs.LO}
} | attie2008synthesis |
arxiv-2350 | 0801.1703 | The Quadratic Gaussian Rate-Distortion Function for Source Uncorrelated Distortions | <|reference_start|>The Quadratic Gaussian Rate-Distortion Function for Source Uncorrelated Distortions: We characterize the rate-distortion function for zero-mean stationary Gaussian sources under the MSE fidelity criterion and subject to the additional constraint that the distortion is uncorrelated to the input. The s... | arxiv | @article{derpich2008the,
title={The Quadratic Gaussian Rate-Distortion Function for Source Uncorrelated
Distortions},
author={Milan S. Derpich, Jan Ostergaard and Graham C. Goodwin},
journal={arXiv preprint arXiv:0801.1703},
year={2008},
archivePrefix={arXiv},
eprint={0801.1703},
primaryCl... | derpich2008the |
arxiv-2351 | 0801.1715 | On Breaching Enterprise Data Privacy Through Adversarial Information Fusion | <|reference_start|>On Breaching Enterprise Data Privacy Through Adversarial Information Fusion: Data privacy is one of the key challenges faced by enterprises today. Anonymization techniques address this problem by sanitizing sensitive data such that individual privacy is preserved while allowing enterprises to maintai... | arxiv | @article{ganta2008on,
title={On Breaching Enterprise Data Privacy Through Adversarial Information
Fusion},
author={Srivatsava Ranjit Ganta, Raj Acharya},
journal={arXiv preprint arXiv:0801.1715},
year={2008},
archivePrefix={arXiv},
eprint={0801.1715},
primaryClass={cs.DB cs.CR cs.OH}
} | ganta2008on |
arxiv-2352 | 0801.1718 | Achieving the Quadratic Gaussian Rate-Distortion Function for Source Uncorrelated Distortions | <|reference_start|>Achieving the Quadratic Gaussian Rate-Distortion Function for Source Uncorrelated Distortions: We prove achievability of the recently characterized quadratic Gaussian rate-distortion function (RDF) subject to the constraint that the distortion is uncorrelated to the source. This result is based on sh... | arxiv | @article{derpich2008achieving,
title={Achieving the Quadratic Gaussian Rate-Distortion Function for Source
Uncorrelated Distortions},
author={Milan S. Derpich, Jan Ostergaard and Daniel E. Quevedo},
journal={arXiv preprint arXiv:0801.1718},
year={2008},
archivePrefix={arXiv},
eprint={0801.1718... | derpich2008achieving |
arxiv-2353 | 0801.1736 | A Central Limit Theorem for the SNR at the Wiener Filter Output for Large Dimensional Signals | <|reference_start|>A Central Limit Theorem for the SNR at the Wiener Filter Output for Large Dimensional Signals: Consider the quadratic form $\beta = {\bf y}^* ({\bf YY}^* + \rho {\bf I})^{-1} {\bf y}$ where $\rho$ is a positive number, where ${\bf y}$ is a random vector and ${\bf Y}$ is a $N \times K$ random matrix b... | arxiv | @article{kammoun2008a,
title={A Central Limit Theorem for the SNR at the Wiener Filter Output for
Large Dimensional Signals},
author={Abla Kammoun, Malika Kharouf, Walid Hachem, Jamal Najim},
journal={arXiv preprint arXiv:0801.1736},
year={2008},
archivePrefix={arXiv},
eprint={0801.1736},
... | kammoun2008a |
arxiv-2354 | 0801.1737 | Extensions to Network Flow Interdiction on Planar Graphs | <|reference_start|>Extensions to Network Flow Interdiction on Planar Graphs: Network flow interdiction analysis studies by how much the value of a maximum flow in a network can be diminished by removing components of the network constrained to some budget. Although this problem is strongly NP-complete on general networ... | arxiv | @article{zenklusen2008extensions,
title={Extensions to Network Flow Interdiction on Planar Graphs},
author={Rico Zenklusen},
journal={arXiv preprint arXiv:0801.1737},
year={2008},
archivePrefix={arXiv},
eprint={0801.1737},
primaryClass={cs.DM}
} | zenklusen2008extensions |
arxiv-2355 | 0801.1766 | A Family of Counter Examples to an Approach to Graph Isomorphism | <|reference_start|>A Family of Counter Examples to an Approach to Graph Isomorphism: We give a family of counter examples showing that the two sequences of polytopes $\Phi_{n,n}$ and $\Psi_{n,n}$ are different. These polytopes were defined recently by S. Friedland in an attempt at a polynomial time algorithm for graph ... | arxiv | @article{cai2008a,
title={A Family of Counter Examples to an Approach to Graph Isomorphism},
author={Jin-Yi Cai, Pinyan Lu and Mingji Xia},
journal={arXiv preprint arXiv:0801.1766},
year={2008},
archivePrefix={arXiv},
eprint={0801.1766},
primaryClass={cs.CC cs.DM}
} | cai2008a |
arxiv-2356 | 0801.1772 | Bi-criteria Pipeline Mappings for Parallel Image Processing | <|reference_start|>Bi-criteria Pipeline Mappings for Parallel Image Processing: Mapping workflow applications onto parallel platforms is a challenging problem, even for simple application patterns such as pipeline graphs. Several antagonistic criteria should be optimized, such as throughput and latency (or a combinatio... | arxiv | @article{benoit2008bi-criteria,
title={Bi-criteria Pipeline Mappings for Parallel Image Processing},
author={Anne Benoit (INRIA Rh^one-Alpes, LIP), Harald Kosch, Veronika
Rehn-Sonigo (INRIA Rh^one-Alpes, LIP), Yves Robert (INRIA Rh^one-Alpes,
LIP)},
journal={arXiv preprint arXiv:0801.1772},
year={20... | benoit2008bi-criteria |
arxiv-2357 | 0801.1783 | An omega-power of a context-free language which is Borel above Delta^0_omega | <|reference_start|>An omega-power of a context-free language which is Borel above Delta^0_omega: We use erasers-like basic operations on words to construct a set that is both Borel and above Delta^0_omega, built as a set V^\omega where V is a language of finite words accepted by a pushdown automaton. In particular, thi... | arxiv | @article{duparc2008an,
title={An omega-power of a context-free language which is Borel above
Delta^0_omega},
author={Jacques Duparc (UNIL), Olivier Finkel (LIP)},
journal={Dans Proceedings of the International Conference on Foundations of
the Formal Sciences V : Infinite Games - Foundations of the Forma... | duparc2008an |
arxiv-2358 | 0801.1784 | Ideal synchronizer for marked pairs in fork-join network | <|reference_start|>Ideal synchronizer for marked pairs in fork-join network: We introduce a new functional element (synchronizer for marked pairs) meant to join results of parallel processing in two-branch fork-join queueing network. Approximations for distribution of sojourn time at the synchronizer are derived along ... | arxiv | @article{vyshenski2008ideal,
title={Ideal synchronizer for marked pairs in fork-join network},
author={S. V. Vyshenski, P. V. Grigoriev, Yu. Yu. Dubenskaya},
journal={arXiv preprint arXiv:0801.1784},
year={2008},
archivePrefix={arXiv},
eprint={0801.1784},
primaryClass={cs.DM}
} | vyshenski2008ideal |
arxiv-2359 | 0801.1856 | Interpretation as a factor in understanding flawed spreadsheets | <|reference_start|>Interpretation as a factor in understanding flawed spreadsheets: The spreadsheet has been used by the business community for many years and yet still raises a number of significant concerns. As educators our concern is to try to develop the students skills in both the development of spreadsheets and ... | arxiv | @article{banks2008interpretation,
title={Interpretation as a factor in understanding flawed spreadsheets},
author={David A. Banks, Ann Monday},
journal={Proc. European Spreadsheet Risks Int. Grp. 2002 13 21 ISBN 1 86166
182 7},
year={2008},
archivePrefix={arXiv},
eprint={0801.1856},
primar... | banks2008interpretation |
arxiv-2360 | 0801.1883 | D-optimal Bayesian Interrogation for Parameter and Noise Identification of Recurrent Neural Networks | <|reference_start|>D-optimal Bayesian Interrogation for Parameter and Noise Identification of Recurrent Neural Networks: We introduce a novel online Bayesian method for the identification of a family of noisy recurrent neural networks (RNNs). We develop Bayesian active learning technique in order to optimize the interr... | arxiv | @article{poczos2008d-optimal,
title={D-optimal Bayesian Interrogation for Parameter and Noise Identification
of Recurrent Neural Networks},
author={Barnabas Poczos and Andras Lorincz},
journal={arXiv preprint arXiv:0801.1883},
year={2008},
archivePrefix={arXiv},
eprint={0801.1883},
primary... | poczos2008d-optimal |
arxiv-2361 | 0801.1925 | A Framework for Designing Teleconsultation Systems in Africa | <|reference_start|>A Framework for Designing Teleconsultation Systems in Africa: All of the countries within Africa experience a serious shortage of medical professionals, particularly specialists, a problem that is only exacerbated by high emigration of doctors with better prospects overseas. As a result, those that r... | arxiv | @article{luk2008a,
title={A Framework for Designing Teleconsultation Systems in Africa},
author={Rowena Luk, Melissa Ho, Paul M. Aoki},
journal={Proc. Int'l Conf. on Health Informatics in Africa (HELINA),
Bamako, Mali, Jan. 2007, 28(1-5)},
year={2008},
archivePrefix={arXiv},
eprint={0801.1925}... | luk2008a |
arxiv-2362 | 0801.1927 | Asynchronous Remote Medical Consultation for Ghana | <|reference_start|>Asynchronous Remote Medical Consultation for Ghana: Computer-mediated communication systems can be used to bridge the gap between doctors in underserved regions with local shortages of medical expertise and medical specialists worldwide. To this end, we describe the design of a prototype remote consu... | arxiv | @article{luk2008asynchronous,
title={Asynchronous Remote Medical Consultation for Ghana},
author={Rowena Luk, Melissa Ho, Paul M. Aoki},
journal={arXiv preprint arXiv:0801.1927},
year={2008},
doi={10.1145/1357054.1357173},
archivePrefix={arXiv},
eprint={0801.1927},
primaryClass={cs.HC}
} | luk2008asynchronous |
arxiv-2363 | 0801.1979 | Minimum Leaf Out-branching and Related Problems | <|reference_start|>Minimum Leaf Out-branching and Related Problems: Given a digraph $D$, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in $D$ an out-branching with the minimum possible number of leaves, i.e., vertices of out-degree 0. We prove that MinLOB is polynomial-time solvable for acyc... | arxiv | @article{gutin2008minimum,
title={Minimum Leaf Out-branching and Related Problems},
author={G. Gutin, I. Razgon, E.J. Kim},
journal={arXiv preprint arXiv:0801.1979},
year={2008},
archivePrefix={arXiv},
eprint={0801.1979},
primaryClass={cs.DS cs.DM}
} | gutin2008minimum |
arxiv-2364 | 0801.1987 | A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs | <|reference_start|>A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering Linear Programs: We give an approximation algorithm for packing and covering linear programs (linear programs with non-negative coefficients). Given a constraint matrix with n non-zeros, r rows, and c columns, the algorithm comput... | arxiv | @article{koufogiannakis2008a,
title={A Nearly Linear-Time PTAS for Explicit Fractional Packing and Covering
Linear Programs},
author={Christos Koufogiannakis and Neal E. Young},
journal={Algorithmica 70(4):648-674(2014)},
year={2008},
doi={10.1007/s00453-013-9771-6},
archivePrefix={arXiv},
... | koufogiannakis2008a |
arxiv-2365 | 0801.1988 | Online variants of the cross-entropy method | <|reference_start|>Online variants of the cross-entropy method: The cross-entropy method is a simple but efficient method for global optimization. In this paper we provide two online variants of the basic CEM, together with a proof of convergence.<|reference_end|> | arxiv | @article{szita2008online,
title={Online variants of the cross-entropy method},
author={Istvan Szita and Andras Lorincz},
journal={arXiv preprint arXiv:0801.1988},
year={2008},
archivePrefix={arXiv},
eprint={0801.1988},
primaryClass={cs.LG}
} | szita2008online |
arxiv-2366 | 0801.2034 | On the Boundedness of the Support of Optimal Input Measures for Rayleigh Fading Channels | <|reference_start|>On the Boundedness of the Support of Optimal Input Measures for Rayleigh Fading Channels: We consider transmission over a wireless multiple antenna communication system operating in a Rayleigh flat fading environment with no channel state information at the receiver and the transmitter with coherence... | arxiv | @article{sommerfeld2008on,
title={On the Boundedness of the Support of Optimal Input Measures for Rayleigh
Fading Channels},
author={Jochen Sommerfeld, Igor Bjelakovic and Holger Boche},
journal={arXiv preprint arXiv:0801.2034},
year={2008},
archivePrefix={arXiv},
eprint={0801.2034},
prima... | sommerfeld2008on |
arxiv-2367 | 0801.2069 | Factored Value Iteration Converges | <|reference_start|>Factored Value Iteration Converges: In this paper we propose a novel algorithm, factored value iteration (FVI), for the approximate solution of factored Markov decision processes (fMDPs). The traditional approximate value iteration algorithm is modified in two ways. For one, the least-squares project... | arxiv | @article{szita2008factored,
title={Factored Value Iteration Converges},
author={Istvan Szita and Andras Lorincz},
journal={arXiv preprint arXiv:0801.2069},
year={2008},
archivePrefix={arXiv},
eprint={0801.2069},
primaryClass={cs.AI cs.LG}
} | szita2008factored |
arxiv-2368 | 0801.2088 | Persistence of Wandering Intervals in Self-Similar Affine Interval Exchange Transformations | <|reference_start|>Persistence of Wandering Intervals in Self-Similar Affine Interval Exchange Transformations: In this article we prove that given a self-similar interval exchange transformation T, whose associated matrix verifies a quite general algebraic condition, there exists an affine interval exchange transforma... | arxiv | @article{bressaud2008persistence,
title={Persistence of Wandering Intervals in Self-Similar Affine Interval
Exchange Transformations},
author={Xavier Bressaud, Pascal Hubert, Alejandro Maass},
journal={arXiv preprint arXiv:0801.2088},
year={2008},
archivePrefix={arXiv},
eprint={0801.2088},
... | bressaud2008persistence |
arxiv-2369 | 0801.2092 | Model for synchronizer of marked pairs in fork-join network | <|reference_start|>Model for synchronizer of marked pairs in fork-join network: We introduce a model for synchronizer of marked pairs, which is a node for joining results of parallel processing in two-branch fork-join queueing network. A distribution for number of jobs in the synchronizer is obtained. Calculations are ... | arxiv | @article{vyshenski2008model,
title={Model for synchronizer of marked pairs in fork-join network},
author={S. V. Vyshenski, P. V. Grigoriev, Yu. Yu. Dubenskaya},
journal={arXiv preprint arXiv:0801.2092},
year={2008},
archivePrefix={arXiv},
eprint={0801.2092},
primaryClass={cs.DM}
} | vyshenski2008model |
arxiv-2370 | 0801.2144 | Non-Additive Quantum Codes from Goethals and Preparata Codes | <|reference_start|>Non-Additive Quantum Codes from Goethals and Preparata Codes: We extend the stabilizer formalism to a class of non-additive quantum codes which are constructed from non-linear classical codes. As an example, we present infinite families of non-additive codes which are derived from Goethals and Prepar... | arxiv | @article{grassl2008non-additive,
title={Non-Additive Quantum Codes from Goethals and Preparata Codes},
author={Markus Grassl and Martin Roetteler},
journal={Proceedings IEEE Information Theory Workshop 2008 (ITW 2008),
Porto, Portugal, May 2008, pp. 396-400},
year={2008},
doi={10.1109/ITW.2008.457... | grassl2008non-additive |
arxiv-2371 | 0801.2150 | Quantum Goethals-Preparata Codes | <|reference_start|>Quantum Goethals-Preparata Codes: We present a family of non-additive quantum codes based on Goethals and Preparata codes with parameters ((2^m,2^{2^m-5m+1},8)). The dimension of these codes is eight times higher than the dimension of the best known additive quantum codes of equal length and minimum ... | arxiv | @article{grassl2008quantum,
title={Quantum Goethals-Preparata Codes},
author={Markus Grassl and Martin Roetteler},
journal={Proceedings 2008 IEEE International Symposium on Information
Theory (ISIT 2008), Toronto, Canada, July 2008, pp. 300-304},
year={2008},
doi={10.1109/ISIT.2008.4594996},
a... | grassl2008quantum |
arxiv-2372 | 0801.2175 | MathPSfrag 2: Convenient LaTeX Labels in Mathematica | <|reference_start|>MathPSfrag 2: Convenient LaTeX Labels in Mathematica: This article introduces the next version of MathPSfrag. MathPSfrag is a Mathematica package that during export automatically replaces all expressions in a plot by corresponding LaTeX commands. The new version can also produce LaTeX independent ima... | arxiv | @article{große2008mathpsfrag,
title={MathPSfrag 2: Convenient LaTeX Labels in Mathematica},
author={Johannes Gro{ss}e},
journal={arXiv preprint arXiv:0801.2175},
year={2008},
archivePrefix={arXiv},
eprint={0801.2175},
primaryClass={cs.GR}
} | große2008mathpsfrag |
arxiv-2373 | 0801.2185 | New Outer Bounds on the Capacity Region of Gaussian Interference Channels | <|reference_start|>New Outer Bounds on the Capacity Region of Gaussian Interference Channels: Recent outer bounds on the capacity region of Gaussian interference channels are generalized to $m$-user channels with $m>2$ and asymmetric powers and crosstalk coefficients. The bounds are again shown to give the sum-rate cap... | arxiv | @article{shang2008new,
title={New Outer Bounds on the Capacity Region of Gaussian Interference
Channels},
author={Xiaohu Shang, Gerhard Kramer, Biao Chen},
journal={arXiv preprint arXiv:0801.2185},
year={2008},
archivePrefix={arXiv},
eprint={0801.2185},
primaryClass={cs.IT math.IT}
} | shang2008new |
arxiv-2374 | 0801.2187 | A One-Way Function Based On The Extended Euclidean Algorithm | <|reference_start|>A One-Way Function Based On The Extended Euclidean Algorithm: A problem based on the Extended Euclidean Algorithm applied to a class of polynomials with many factors is presented and believed to be hard. If so, it is a one-way function well suited for applications in digital signicatures.<|reference_... | arxiv | @article{feig2008a,
title={A One-Way Function Based On The Extended Euclidean Algorithm},
author={Ephraim Feig, Vivian Feig},
journal={arXiv preprint arXiv:0801.2187},
year={2008},
archivePrefix={arXiv},
eprint={0801.2187},
primaryClass={cs.CR}
} | feig2008a |
arxiv-2375 | 0801.2201 | Policies of System Level Pipeline Modeling | <|reference_start|>Policies of System Level Pipeline Modeling: Pipelining is a well understood and often used implementation technique for increasing the performance of a hardware system. We develop several SystemC/C++ modeling techniques that allow us to quickly model, simulate, and evaluate pipelines. We employ a sma... | arxiv | @article{harcourt2008policies,
title={Policies of System Level Pipeline Modeling},
author={Ed Harcourt},
journal={arXiv preprint arXiv:0801.2201},
year={2008},
archivePrefix={arXiv},
eprint={0801.2201},
primaryClass={cs.AR cs.PL}
} | harcourt2008policies |
arxiv-2376 | 0801.2226 | Programming an interpreter using molecular dynamics | <|reference_start|>Programming an interpreter using molecular dynamics: PGA (ProGram Algebra) is an algebra of programs which concerns programs in their simplest form: sequences of instructions. Molecular dynamics is a simple model of computation developed in the setting of PGA, which bears on the use of dynamic data s... | arxiv | @article{bergstra2008programming,
title={Programming an interpreter using molecular dynamics},
author={J. A. Bergstra, C. A. Middelburg},
journal={Scientific Annals of Computer Science, 17:47--81, 2007.
http://www.infoiasi.ro/bin/download/Annals/XVII/XVII_2.pdf},
year={2008},
number={PRG0801},
... | bergstra2008programming |
arxiv-2377 | 0801.2233 | Analysis of Non-binary Hybrid LDPC Codes | <|reference_start|>Analysis of Non-binary Hybrid LDPC Codes: In this paper, we analyse asymptotically a new class of LDPC codes called Non-binary Hybrid LDPC codes, which has been recently introduced. We use density evolution techniques to derive a stability condition for hybrid LDPC codes, and prove their threshold be... | arxiv | @article{sassatelli2008analysis,
title={Analysis of Non-binary Hybrid LDPC Codes},
author={Lucile Sassatelli and David Declercq},
journal={arXiv preprint arXiv:0801.2233},
year={2008},
archivePrefix={arXiv},
eprint={0801.2233},
primaryClass={cs.IT math.IT}
} | sassatelli2008analysis |
arxiv-2378 | 0801.2242 | Information Spectrum Approach to Second-Order Coding Rate in Channel Coding | <|reference_start|>Information Spectrum Approach to Second-Order Coding Rate in Channel Coding: Second-order coding rate of channel coding is discussed for general sequence of channels. The optimum second-order transmission rate with a constant error constraint $\epsilon$ is obtained by using the information spectrum m... | arxiv | @article{hayashi2008information,
title={Information Spectrum Approach to Second-Order Coding Rate in Channel
Coding},
author={Masahito Hayashi},
journal={IEEE Transactions on Information Theory Volume 55, Issue 11, 4947
- 4966 (2009)},
year={2008},
doi={10.1109/TIT.2009.2030478},
archivePref... | hayashi2008information |
arxiv-2379 | 0801.2284 | Le probleme de l'isomorphisme de graphes est dans P | <|reference_start|>Le probleme de l'isomorphisme de graphes est dans P: This paper has been withdrawn by the author, due to possible counter-examples.<|reference_end|> | arxiv | @article{kettani2008le,
title={Le probleme de l'isomorphisme de graphes est dans P},
author={Omar Kettani},
journal={arXiv preprint arXiv:0801.2284},
year={2008},
archivePrefix={arXiv},
eprint={0801.2284},
primaryClass={cs.DM cs.DS}
} | kettani2008le |
arxiv-2380 | 0801.2323 | Decentralized Two-Hop Opportunistic Relaying With Limited Channel State Information | <|reference_start|>Decentralized Two-Hop Opportunistic Relaying With Limited Channel State Information: A network consisting of $n$ source-destination pairs and $m$ relays is considered. Focusing on the large system limit (large $n$), the throughput scaling laws of two-hop relaying protocols are studied for Rayleigh fa... | arxiv | @article{cui2008decentralized,
title={Decentralized Two-Hop Opportunistic Relaying With Limited Channel State
Information},
author={Shengshan Cui, Alexander M. Haimovich, Oren Somekh, and H. Vincent
Poor},
journal={arXiv preprint arXiv:0801.2323},
year={2008},
archivePrefix={arXiv},
eprint={... | cui2008decentralized |
arxiv-2381 | 0801.2345 | On the relationship between the structural and socioacademic communities of a coauthorship network | <|reference_start|>On the relationship between the structural and socioacademic communities of a coauthorship network: This article presents a study that compares detected structural communities in a coauthorship network to the socioacademic characteristics of the scholars that compose the network. The coauthorship net... | arxiv | @article{rodriguez2008on,
title={On the relationship between the structural and socioacademic communities
of a coauthorship network},
author={Marko A. Rodriguez and Alberto Pepe},
journal={Journal of Informetrics, volume 2, issue 3, pages 195-201, ISSN:
1751-1577, Elsevier, July 2008},
year={2008},
... | rodriguez2008on |
arxiv-2382 | 0801.2347 | On the Minimum Spanning Tree for Directed Graphs with Potential Weights | <|reference_start|>On the Minimum Spanning Tree for Directed Graphs with Potential Weights: In general the problem of finding a miminum spanning tree for a weighted directed graph is difficult but solvable. There are a lot of differences between problems for directed and undirected graphs, therefore the algorithms for ... | arxiv | @article{buslov2008on,
title={On the Minimum Spanning Tree for Directed Graphs with Potential Weights},
author={V. A. Buslov, V. A. Khudobakhshov},
journal={arXiv preprint arXiv:0801.2347},
year={2008},
archivePrefix={arXiv},
eprint={0801.2347},
primaryClass={cs.DM}
} | buslov2008on |
arxiv-2383 | 0801.2378 | String algorithms and data structures | <|reference_start|>String algorithms and data structures: The string-matching field has grown at a such complicated stage that various issues come into play when studying it: data structure and algorithmic design, database principles, compression techniques, architectural features, cache and prefetching policies. The e... | arxiv | @article{ferragina2008string,
title={String algorithms and data structures},
author={Paolo Ferragina},
journal={arXiv preprint arXiv:0801.2378},
year={2008},
archivePrefix={arXiv},
eprint={0801.2378},
primaryClass={cs.DS cs.IR}
} | ferragina2008string |
arxiv-2384 | 0801.2398 | Removing the Stiffness of Elastic Force from the Immersed Boundary Method for the 2D Stokes Equations | <|reference_start|>Removing the Stiffness of Elastic Force from the Immersed Boundary Method for the 2D Stokes Equations: The Immersed Boundary method has evolved into one of the most useful computational methods in studying fluid structure interaction. On the other hand, the Immersed Boundary method is also known to s... | arxiv | @article{hou2008removing,
title={Removing the Stiffness of Elastic Force from the Immersed Boundary
Method for the 2D Stokes Equations},
author={Thomas Y. Hou, Zuoqiang Shi},
journal={arXiv preprint arXiv:0801.2398},
year={2008},
doi={10.1016/j.jcp.2008.03.002},
archivePrefix={arXiv},
epri... | hou2008removing |
arxiv-2385 | 0801.2405 | Multiple Uncertainties in Time-Variant Cosmological Particle Data | <|reference_start|>Multiple Uncertainties in Time-Variant Cosmological Particle Data: Though the mediums for visualization are limited, the potential dimensions of a dataset are not. In many areas of scientific study, understanding the correlations between those dimensions and their uncertainties is pivotal to mining u... | arxiv | @article{haroz2008multiple,
title={Multiple Uncertainties in Time-Variant Cosmological Particle Data},
author={Steve Haroz, Kwan-Liu Ma, Katrin Heitmann},
journal={Haroz, S; Ma, K-L; Heitmann, K, "Multiple Uncertainties in
Time-Variant Cosmological Particle Data" IEEE PacificVIS '08, pp.207-214, 5-7
Mar... | haroz2008multiple |
arxiv-2386 | 0801.2423 | Design and Analysis of LDGM-Based Codes for MSE Quantization | <|reference_start|>Design and Analysis of LDGM-Based Codes for MSE Quantization: Approaching the 1.5329-dB shaping (granular) gain limit in mean-squared error (MSE) quantization of R^n is important in a number of problems, notably dirty-paper coding. For this purpose, we start with a binary low-density generator-matrix... | arxiv | @article{wang2008design,
title={Design and Analysis of LDGM-Based Codes for MSE Quantization},
author={Qingchuan Wang, Chen He},
journal={arXiv preprint arXiv:0801.2423},
year={2008},
archivePrefix={arXiv},
eprint={0801.2423},
primaryClass={cs.IT math.IT}
} | wang2008design |
arxiv-2387 | 0801.2480 | Asynchronous Iterative Waterfilling for Gaussian Frequency-Selective Interference Channels | <|reference_start|>Asynchronous Iterative Waterfilling for Gaussian Frequency-Selective Interference Channels: This paper considers the maximization of information rates for the Gaussian frequency-selective interference channel, subject to power and spectral mask constraints on each link. To derive decentralized soluti... | arxiv | @article{scutari2008asynchronous,
title={Asynchronous Iterative Waterfilling for Gaussian Frequency-Selective
Interference Channels},
author={Gesualdo Scutari, Daniel P. Palomar, and Sergio Barbarossa},
journal={arXiv preprint arXiv:0801.2480},
year={2008},
archivePrefix={arXiv},
eprint={0801.... | scutari2008asynchronous |
arxiv-2388 | 0801.2498 | An Application of the Feferman-Vaught Theorem to Automata and Logics for<br> Words over an Infinite Alphabet | <|reference_start|>An Application of the Feferman-Vaught Theorem to Automata and Logics for<br> Words over an Infinite Alphabet: We show that a special case of the Feferman-Vaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidabilit... | arxiv | @article{bès2008an,
title={An Application of the Feferman-Vaught Theorem to Automata and Logics
for<br> Words over an Infinite Alphabet},
author={Alexis B`es},
journal={Logical Methods in Computer Science, Volume 4, Issue 1 (March 25,
2008) lmcs:1202},
year={2008},
doi={10.2168/LMCS-4(1:8)2008},... | bès2008an |
arxiv-2389 | 0801.2510 | A Comparison of natural (english) and artificial (esperanto) languages A Multifractal method based analysis | <|reference_start|>A Comparison of natural (english) and artificial (esperanto) languages A Multifractal method based analysis: We present a comparison of two english texts, written by Lewis Carroll, one (Alice in wonderland) and the other (Through a looking glass), the former translated into esperanto, in order to obs... | arxiv | @article{gillet2008a,
title={A Comparison of natural (english) and artificial (esperanto) languages.
A Multifractal method based analysis},
author={J. Gillet and M. Ausloos},
journal={arXiv preprint arXiv:0801.2510},
year={2008},
archivePrefix={arXiv},
eprint={0801.2510},
primaryClass={cs.... | gillet2008a |
arxiv-2390 | 0801.2588 | Coding and Decoding for the Dynamic Decode and Forward Relay Protocol | <|reference_start|>Coding and Decoding for the Dynamic Decode and Forward Relay Protocol: We study the Dynamic Decode and Forward (DDF) protocol for a single half-duplex relay, single-antenna channel with quasi-static fading. The DDF protocol is well-known and has been analyzed in terms of the Diversity-Multiplexing Tr... | arxiv | @article{kumar2008coding,
title={Coding and Decoding for the Dynamic Decode and Forward Relay Protocol},
author={K. Raj Kumar and Giuseppe Caire},
journal={arXiv preprint arXiv:0801.2588},
year={2008},
archivePrefix={arXiv},
eprint={0801.2588},
primaryClass={cs.IT math.IT}
} | kumar2008coding |
arxiv-2391 | 0801.2618 | Survey of Technologies for Web Application Development | <|reference_start|>Survey of Technologies for Web Application Development: Web-based application developers face a dizzying array of platforms, languages, frameworks and technical artifacts to choose from. We survey, classify, and compare technologies supporting Web application development. The classification is based ... | arxiv | @article{doyle2008survey,
title={Survey of Technologies for Web Application Development},
author={Barry Doyle (University of California, Irvine) and Cristina Videira
Lopes (University of California, Irvine)},
journal={arXiv preprint arXiv:0801.2618},
year={2008},
archivePrefix={arXiv},
eprint=... | doyle2008survey |
arxiv-2392 | 0801.2666 | MRI/TRUS data fusion for prostate brachytherapy Preliminary results | <|reference_start|>MRI/TRUS data fusion for prostate brachytherapy Preliminary results: Prostate brachytherapy involves implanting radioactive seeds (I125 for instance) permanently in the gland for the treatment of localized prostate cancers, e.g., cT1c-T2a N0 M0 with good prognostic factors. Treatment planning and see... | arxiv | @article{reynier2008mri/trus,
title={MRI/TRUS data fusion for prostate brachytherapy. Preliminary results},
author={Christophe Reynier (TIMC), Jocelyne Troccaz (TIMC), Philippe Fourneret
(TIMC), Andr'e Dusserre, C'ecile Gay-Jeune (CHU-Grenoble radio), Jean-Luc
Descotes, Michel Bolla, Jean-Yves Giraud},
... | reynier2008mri/trus |
arxiv-2393 | 0801.2793 | Algorithms for eps-approximations of Terrains | <|reference_start|>Algorithms for eps-approximations of Terrains: Consider a point set D with a measure function w : D -> R. Let A be the set of subsets of D induced by containment in a shape from some geometric family (e.g. axis-aligned rectangles, half planes, balls, k-oriented polygons). We say a range space (D, A) ... | arxiv | @article{phillips2008algorithms,
title={Algorithms for eps-approximations of Terrains},
author={Jeff M. Phillips},
journal={arXiv preprint arXiv:0801.2793},
year={2008},
archivePrefix={arXiv},
eprint={0801.2793},
primaryClass={cs.CG}
} | phillips2008algorithms |
arxiv-2394 | 0801.2823 | 3D/4D ultrasound registration of bone | <|reference_start|>3D/4D ultrasound registration of bone: This paper presents a method to reduce the invasiveness of Computer Assisted Orthopaedic Surgery (CAOS) using ultrasound. In this goal, we need to develop a method for 3D/4D ultrasound registration. The premilinary results of this study suggest that the developm... | arxiv | @article{schers20083d/4d,
title={3D/4D ultrasound registration of bone},
author={Jonathan Schers (TIMC), Jocelyne Troccaz (TIMC), Vincent Daanen
(TIMC), C'eline Fouard (TIMC), Christopher Plaskos, Pascal Kilian},
journal={Dans IEEE International Ultrasonic Symposium, 2007 - IEEE
International Ultrasonic... | schers20083d/4d |
arxiv-2395 | 0801.2838 | An Algorithm for Road Coloring | <|reference_start|>An Algorithm for Road Coloring: A coloring of edges of a finite directed graph turns the graph into finite-state automaton. The synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A colorin... | arxiv | @article{trahtman2008an,
title={An Algorithm for Road Coloring},
author={A.N. Trahtman},
journal={arXiv preprint arXiv:0801.2838},
year={2008},
archivePrefix={arXiv},
eprint={0801.2838},
primaryClass={cs.DM}
} | trahtman2008an |
arxiv-2396 | 0801.2858 | Theoretical analysis of optimization problems - Some properties of random k-SAT and k-XORSAT | <|reference_start|>Theoretical analysis of optimization problems - Some properties of random k-SAT and k-XORSAT: This thesis is divided in two parts. The first presents an overview of known results in statistical mechanics of disordered systems and its approach to random combinatorial optimization problems. The second ... | arxiv | @article{altarelli2008theoretical,
title={Theoretical analysis of optimization problems - Some properties of
random k-SAT and k-XORSAT},
author={Fabrizio Altarelli},
journal={arXiv preprint arXiv:0801.2858},
year={2008},
archivePrefix={arXiv},
eprint={0801.2858},
primaryClass={cond-mat.sta... | altarelli2008theoretical |
arxiv-2397 | 0801.2890 | Entropy landscape and non-Gibbs solutions in constraint satisfaction problems | <|reference_start|>Entropy landscape and non-Gibbs solutions in constraint satisfaction problems: We study the entropy landscape of solutions for the bicoloring problem in random graphs, a representative difficult constraint satisfaction problem. Our goal is to classify which type of clusters of solutions are addressed... | arxiv | @article{dall'asta2008entropy,
title={Entropy landscape and non-Gibbs solutions in constraint satisfaction
problems},
author={L. Dall'Asta, A. Ramezanpour and R. Zecchina},
journal={Phys. Rev. E 77, 031118 (2008)},
year={2008},
doi={10.1103/PhysRevE.77.031118},
archivePrefix={arXiv},
eprin... | dall'asta2008entropy |
arxiv-2398 | 0801.2931 | A Truthful Mechanism for Offline Ad Slot Scheduling | <|reference_start|>A Truthful Mechanism for Offline Ad Slot Scheduling: We consider the "Offline Ad Slot Scheduling" problem, where advertisers must be scheduled to "sponsored search" slots during a given period of time. Advertisers specify a budget constraint, as well as a maximum cost per click, and may not be assign... | arxiv | @article{feldman2008a,
title={A Truthful Mechanism for Offline Ad Slot Scheduling},
author={Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pal},
journal={arXiv preprint arXiv:0801.2931},
year={2008},
archivePrefix={arXiv},
eprint={0801.2931},
primaryClass={cs.GT cs.DS}
} | feldman2008a |
arxiv-2399 | 0801.3024 | Construction of Z4-linear Reed-Muller codes | <|reference_start|>Construction of Z4-linear Reed-Muller codes: New quaternary Plotkin constructions are given and are used to obtain new families of quaternary codes. The parameters of the obtained codes, such as the length, the dimension and the minimum distance are studied. Using these constructions new families of ... | arxiv | @article{pujol2008construction,
title={Construction of Z4-linear Reed-Muller codes},
author={J. Pujol, J. Rif'a, F. I. Solov'eva},
journal={arXiv preprint arXiv:0801.3024},
year={2008},
archivePrefix={arXiv},
eprint={0801.3024},
primaryClass={cs.IT math.IT}
} | pujol2008construction |
arxiv-2400 | 0801.3042 | Performance Analysis of a Cross-layer Collaborative Beamforming Approach in the Presence of Channel and Phase Errors | <|reference_start|>Performance Analysis of a Cross-layer Collaborative Beamforming Approach in the Presence of Channel and Phase Errors: Collaborative beamforming enables nodes in a wireless network to transmit a common message over long distances in an energy efficient fashion. However, the process of making available... | arxiv | @article{dong2008performance,
title={Performance Analysis of a Cross-layer Collaborative Beamforming Approach
in the Presence of Channel and Phase Errors},
author={Lun Dong, Athina P. Petropulu, H. Vincent Poor},
journal={arXiv preprint arXiv:0801.3042},
year={2008},
archivePrefix={arXiv},
epr... | dong2008performance |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.