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-2601 | 0802.1362 | Complexity of Combinatorial Market Makers | <|reference_start|>Complexity of Combinatorial Market Makers: We analyze the computational complexity of market maker pricing algorithms for combinatorial prediction markets. We focus on Hanson's popular logarithmic market scoring rule market maker (LMSR). Our goal is to implicitly maintain correct LMSR prices across a... | arxiv | @article{chen2008complexity,
title={Complexity of Combinatorial Market Makers},
author={Yiling Chen, Lance Fortnow, Nicolas Lambert, David M. Pennock,
Jennifer Wortman},
journal={arXiv preprint arXiv:0802.1362},
year={2008},
archivePrefix={arXiv},
eprint={0802.1362},
primaryClass={cs.GT}
} | chen2008complexity |
arxiv-2602 | 0802.1369 | Interior-Point Algorithms for Linear-Programming Decoding | <|reference_start|>Interior-Point Algorithms for Linear-Programming Decoding: Interior-point algorithms constitute a very interesting class of algorithms for solving linear-programming problems. In this paper we study efficient implementations of such algorithms for solving the linear program that appears in the linear... | arxiv | @article{vontobel2008interior-point,
title={Interior-Point Algorithms for Linear-Programming Decoding},
author={Pascal O. Vontobel},
journal={arXiv preprint arXiv:0802.1369},
year={2008},
archivePrefix={arXiv},
eprint={0802.1369},
primaryClass={cs.IT math.IT}
} | vontobel2008interior-point |
arxiv-2603 | 0802.1372 | An integral formula for large random rectangular matrices and its application to analysis of linear vector channels | <|reference_start|>An integral formula for large random rectangular matrices and its application to analysis of linear vector channels: A statistical mechanical framework for analyzing random linear vector channels is presented in a large system limit. The framework is based on the assumptions that the left and right s... | arxiv | @article{kabashima2008an,
title={An integral formula for large random rectangular matrices and its
application to analysis of linear vector channels},
author={Yoshiyuki Kabashima},
journal={arXiv preprint arXiv:0802.1372},
year={2008},
archivePrefix={arXiv},
eprint={0802.1372},
primaryClas... | kabashima2008an |
arxiv-2604 | 0802.1379 | Structure and Optimality of Myopic Policy in Opportunistic Access with Noisy Observations | <|reference_start|>Structure and Optimality of Myopic Policy in Opportunistic Access with Noisy Observations: A restless multi-armed bandit problem that arises in multichannel opportunistic communications is considered, where channels are modeled as independent and identical Gilbert-Elliot channels and channel state ob... | arxiv | @article{zhao2008structure,
title={Structure and Optimality of Myopic Policy in Opportunistic Access with
Noisy Observations},
author={Qing Zhao, Bhaskar Krishnamachari},
journal={arXiv preprint arXiv:0802.1379},
year={2008},
archivePrefix={arXiv},
eprint={0802.1379},
primaryClass={cs.NI}
... | zhao2008structure |
arxiv-2605 | 0802.1380 | New Bounds for the Capacity Region of the Finite-State Multiple Access Channel | <|reference_start|>New Bounds for the Capacity Region of the Finite-State Multiple Access Channel: The capacity region of the Finite-State Multiple Access Channel (FS-MAC) with feedback that may be an arbitrary time-invariant function of the channel output samples is considered. We provided a sequence of inner and oute... | arxiv | @article{permuter2008new,
title={New Bounds for the Capacity Region of the Finite-State Multiple Access
Channel},
author={Haim H. Permuter, Tsachy Weissman and Jun Chen},
journal={arXiv preprint arXiv:0802.1380},
year={2008},
archivePrefix={arXiv},
eprint={0802.1380},
primaryClass={cs.IT m... | permuter2008new |
arxiv-2606 | 0802.1381 | Comments on combinatorial interpretation of fibonomial coefficients - an email style letter | <|reference_start|>Comments on combinatorial interpretation of fibonomial coefficients - an email style letter: Up to our knowledge -since about 126 years we were lacking of classical type combinatorial interpretation of Fibonomial coefficients as it was Lukas \cite{1} - to our knowledge -who was the first who had defi... | arxiv | @article{kwasniewski2008comments,
title={Comments on combinatorial interpretation of fibonomial coefficients - an
email style letter},
author={A. K. Kwasniewski},
journal={Bulletin of the ICA vol. 42 September (2004) 10-11},
year={2008},
archivePrefix={arXiv},
eprint={0802.1381},
primaryCl... | kwasniewski2008comments |
arxiv-2607 | 0802.1382 | New type Stirling like numbers - an email style letter | <|reference_start|>New type Stirling like numbers - an email style letter: The notion of the Fibonacci cobweb poset from [1] has been naturally extended to any admissible sequence $F$ in [2] where it was also recognized that the celebrated prefab notion of Bender and Goldman [3] - (see also [4,5]) - admits such an exte... | arxiv | @article{kwasniewski2008new,
title={New type Stirling like numbers - an email style letter},
author={A. K. Kwasniewski},
journal={Bulletin of the ICA Vol. 49 (2007), pp. 99-102},
year={2008},
archivePrefix={arXiv},
eprint={0802.1382},
primaryClass={math.CO cs.DM}
} | kwasniewski2008new |
arxiv-2608 | 0802.1383 | On Directed Information and Gambling | <|reference_start|>On Directed Information and Gambling: We study the problem of gambling in horse races with causal side information and show that Massey's directed information characterizes the increment in the maximum achievable capital growth rate due to the availability of side information. This result gives a nat... | arxiv | @article{permuter2008on,
title={On Directed Information and Gambling},
author={Haim H. Permuter, Young-Han Kim and Tsachy Weissman},
journal={arXiv preprint arXiv:0802.1383},
year={2008},
archivePrefix={arXiv},
eprint={0802.1383},
primaryClass={cs.IT math.IT}
} | permuter2008on |
arxiv-2609 | 0802.1387 | Ascending runs in dependent uniformly distributed random variables: Application to wireless networks | <|reference_start|>Ascending runs in dependent uniformly distributed random variables: Application to wireless networks: We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is characterize... | arxiv | @article{mitton2008ascending,
title={Ascending runs in dependent uniformly distributed random variables:
Application to wireless networks},
author={Nathalie Mitton (INRIA Futurs), Katy Paroux (LM-Besanc{c}on), Bruno
Sericola (IRISA), S'ebastien Tixeuil (INRIA Futurs)},
journal={arXiv preprint arXiv:0802... | mitton2008ascending |
arxiv-2610 | 0802.1389 | Convergence of some leader election algorithms | <|reference_start|>Convergence of some leader election algorithms: We start with a set of n players. With some probability P(n,k), we kill n-k players; the other ones stay alive, and we repeat with them. What is the distribution of the number X_n of phases (or rounds) before getting only one player? We present a probab... | arxiv | @article{janson2008convergence,
title={Convergence of some leader election algorithms},
author={Svante Janson, Christian Lavault, Guy Louchard},
journal={arXiv preprint arXiv:0802.1389},
year={2008},
archivePrefix={arXiv},
eprint={0802.1389},
primaryClass={cs.DC math.PR}
} | janson2008convergence |
arxiv-2611 | 0802.1393 | Les Agents comme des interpr\'eteurs Scheme : Sp\'ecification dynamique par la communication | <|reference_start|>Les Agents comme des interpr\'eteurs Scheme : Sp\'ecification dynamique par la communication: We proposed in previous papers an extension and an implementation of the STROBE model, which regards the Agents as Scheme interpreters. These Agents are able to interpret messages in a dedicated environment ... | arxiv | @article{jonquet2008les,
title={Les Agents comme des interpr\'eteurs Scheme : Sp\'ecification dynamique
par la communication},
author={Cl'ement Jonquet (LIRMM), Stefano A. Cerri (LIRMM)},
journal={Dans 14\`eme Congr\`es Francophone AFRIF-AFIA de Reconnaissance
des Formes et Intelligence Artificielle - R... | jonquet2008les |
arxiv-2612 | 0802.1412 | Extreme Learning Machine for land cover classification | <|reference_start|>Extreme Learning Machine for land cover classification: This paper explores the potential of extreme learning machine based supervised classification algorithm for land cover classification. In comparison to a backpropagation neural network, which requires setting of several user-defined parameters a... | arxiv | @article{pal2008extreme,
title={Extreme Learning Machine for land cover classification},
author={Mahesh Pal},
journal={arXiv preprint arXiv:0802.1412},
year={2008},
doi={10.1080/01431160902788636},
archivePrefix={arXiv},
eprint={0802.1412},
primaryClass={cs.NE cs.CV}
} | pal2008extreme |
arxiv-2613 | 0802.1427 | Approximating General Metric Distances Between a Pattern and a Text | <|reference_start|>Approximating General Metric Distances Between a Pattern and a Text: Let $T=t_0 ... t_{n-1}$ be a text and $P = p_0 ... p_{m-1}$ a pattern taken from some finite alphabet set $\Sigma$, and let $\dist$ be a metric on $\Sigma$. We consider the problem of calculating the sum of distances between the sym... | arxiv | @article{efremenko2008approximating,
title={Approximating General Metric Distances Between a Pattern and a Text},
author={Klim Efremenko, Ely Porat},
journal={SODA 2008},
year={2008},
archivePrefix={arXiv},
eprint={0802.1427},
primaryClass={cs.DS}
} | efremenko2008approximating |
arxiv-2614 | 0802.1430 | A New Approach to Collaborative Filtering: Operator Estimation with Spectral Regularization | <|reference_start|>A New Approach to Collaborative Filtering: Operator Estimation with Spectral Regularization: We present a general approach for collaborative filtering (CF) using spectral regularization to learn linear operators from "users" to the "objects" they rate. Recent low-rank type matrix completion approache... | arxiv | @article{abernethy2008a,
title={A New Approach to Collaborative Filtering: Operator Estimation with
Spectral Regularization},
author={Jacob Abernethy, Francis Bach (INRIA Rocquencourt), Theodoros
Evgeniou, Jean-Philippe Vert (CB)},
journal={arXiv preprint arXiv:0802.1430},
year={2008},
archivePr... | abernethy2008a |
arxiv-2615 | 0802.1465 | 3-Way Composition of Weighted Finite-State Transducers | <|reference_start|>3-Way Composition of Weighted Finite-State Transducers: Composition of weighted transducers is a fundamental algorithm used in many applications, including for computing complex edit-distances between automata, or string kernels in machine learning, or to combine different components of a speech reco... | arxiv | @article{allauzen20083-way,
title={3-Way Composition of Weighted Finite-State Transducers},
author={Cyril Allauzen and Mehryar Mohri},
journal={arXiv preprint arXiv:0802.1465},
year={2008},
archivePrefix={arXiv},
eprint={0802.1465},
primaryClass={cs.CC}
} | allauzen20083-way |
arxiv-2616 | 0802.1471 | Error-Correcting Data Structures | <|reference_start|>Error-Correcting Data Structures: We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries about the object, even if the data structure has been corrupted by a constant fraction ... | arxiv | @article{de wolf2008error-correcting,
title={Error-Correcting Data Structures},
author={Ronald de Wolf (CWI Amsterdam)},
journal={arXiv preprint arXiv:0802.1471},
year={2008},
archivePrefix={arXiv},
eprint={0802.1471},
primaryClass={cs.DS}
} | de wolf2008error-correcting |
arxiv-2617 | 0802.1514 | Minimal Committee Problem for Inconsistent Systems of Linear Inequalities on the Plane | <|reference_start|>Minimal Committee Problem for Inconsistent Systems of Linear Inequalities on the Plane: A representation of an arbitrary system of strict linear inequalities in R^n as a system of points is proposed. The representation is obtained by using a so-called polarity. Based on this representation an algorit... | arxiv | @article{kobylkin2008minimal,
title={Minimal Committee Problem for Inconsistent Systems of Linear
Inequalities on the Plane},
author={K.S. Kobylkin},
journal={arXiv preprint arXiv:0802.1514},
year={2008},
doi={10.1134/S1054661806040201},
archivePrefix={arXiv},
eprint={0802.1514},
prima... | kobylkin2008minimal |
arxiv-2618 | 0802.1555 | Constructing Linear Codes with Good Joint Spectra | <|reference_start|>Constructing Linear Codes with Good Joint Spectra: The problem of finding good linear codes for joint source-channel coding (JSCC) is investigated in this paper. By the code-spectrum approach, it has been proved in the authors' previous paper that a good linear code for the authors' JSCC scheme is a ... | arxiv | @article{yang2008constructing,
title={Constructing Linear Codes with Good Joint Spectra},
author={Shengtian Yang, Yan Chen, Thomas Honold, Zhaoyang Zhang, Peiliang Qiu},
journal={arXiv preprint arXiv:0802.1555},
year={2008},
archivePrefix={arXiv},
eprint={0802.1555},
primaryClass={cs.IT math... | yang2008constructing |
arxiv-2619 | 0802.1567 | Universal Coding for Lossless and Lossy Complementary Delivery Problems | <|reference_start|>Universal Coding for Lossless and Lossy Complementary Delivery Problems: This paper deals with a coding problem called complementary delivery, where messages from two correlated sources are jointly encoded and each decoder reproduces one of two messages using the other message as the side information... | arxiv | @article{kuzuoka2008universal,
title={Universal Coding for Lossless and Lossy Complementary Delivery Problems},
author={Shigeaki Kuzuoka, Akisato Kimura, Tomohiko Uyematsu},
journal={arXiv preprint arXiv:0802.1567},
year={2008},
archivePrefix={arXiv},
eprint={0802.1567},
primaryClass={cs.IT ... | kuzuoka2008universal |
arxiv-2620 | 0802.1578 | Thread extraction for polyadic instruction sequences | <|reference_start|>Thread extraction for polyadic instruction sequences: In this paper, we study the phenomenon that instruction sequences are split into fragments which somehow produce a joint behaviour. In order to bring this phenomenon better into the picture, we formalize a simple mechanism by which several instruc... | arxiv | @article{bergstra2008thread,
title={Thread extraction for polyadic instruction sequences},
author={J. A. Bergstra, C. A. Middelburg},
journal={Scientific Annals of Computer Science, 21(2):283--310, 2011.
http://www.infoiasi.ro/bin/download/Annals/XXI2/XXI2_4.pdf},
year={2008},
number={PRG0803},
... | bergstra2008thread |
arxiv-2621 | 0802.1586 | Program Promises | <|reference_start|>Program Promises: The framework of promise theory offers an alternative way of understanding programming models, especially in distributed systems. We show that promise theory can express some familiar constructs and resolve some problems in program interface design, using fewer and simpler concepts ... | arxiv | @article{aredo2008program,
title={Program Promises},
author={Demissies Aredo, Mark Burgess and Simen Hagen},
journal={arXiv preprint arXiv:0802.1586},
year={2008},
archivePrefix={arXiv},
eprint={0802.1586},
primaryClass={cs.SE}
} | aredo2008program |
arxiv-2622 | 0802.1604 | On the Complexity of Nash Equilibria of Action-Graph Games | <|reference_start|>On the Complexity of Nash Equilibria of Action-Graph Games: We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that encapsulates both "local" dependencies as in graphical games, and partia... | arxiv | @article{daskalakis2008on,
title={On the Complexity of Nash Equilibria of Action-Graph Games},
author={Constantinos Daskalakis, Grant Schoenebeck, Gregory Valiant, Paul
Valiant},
journal={arXiv preprint arXiv:0802.1604},
year={2008},
archivePrefix={arXiv},
eprint={0802.1604},
primaryClass=... | daskalakis2008on |
arxiv-2623 | 0802.1617 | Discrete Complex Structure on Surfel Surfaces | <|reference_start|>Discrete Complex Structure on Surfel Surfaces: This paper defines a theory of conformal parametrization of digital surfaces made of surfels equipped with a normal vector. The main idea is to locally project each surfel to the tangent plane, therefore deforming its aspect-ratio. It is a generalization... | arxiv | @article{mercat2008discrete,
title={Discrete Complex Structure on Surfel Surfaces},
author={Christian Mercat (I3M)},
journal={Dans 14th IAPR International Conference on Discrete Geometry for
Computer Imagery - 14th IAPR International Conference on Discrete Geometry
for Computer Imagery, Lyon : France (2... | mercat2008discrete |
arxiv-2624 | 0802.1661 | Zero-knowledge authentication schemes from actions on graphs, groups, or rings | <|reference_start|>Zero-knowledge authentication schemes from actions on graphs, groups, or rings: We propose a general way of constructing zero-knowledge authentication schemes from actions of a semigroup on a set, without exploiting any specific algebraic properties of the set acted upon. Then we give several concret... | arxiv | @article{grigoriev2008zero-knowledge,
title={Zero-knowledge authentication schemes from actions on graphs, groups, or
rings},
author={Dima Grigoriev (IRMAR), Vladimir Shpilrain},
journal={arXiv preprint arXiv:0802.1661},
year={2008},
number={08-09},
archivePrefix={arXiv},
eprint={0802.1661... | grigoriev2008zero-knowledge |
arxiv-2625 | 0802.1685 | Generalized Whac-a-Mole | <|reference_start|>Generalized Whac-a-Mole: We consider online competitive algorithms for the problem of collecting weighted items from a dynamic set S, when items are added to or deleted from S over time. The objective is to maximize the total weight of collected items. We study the general version, as well as variant... | arxiv | @article{bienkowski2008generalized,
title={Generalized Whac-a-Mole},
author={Marcin Bienkowski, Marek Chrobak, Christoph Durr, Mathilde Hurand,
Artur Jez, Lukasz Jez, Jakub Lopuszanski, Grzegorz Stachowiak},
journal={arXiv preprint arXiv:0802.1685},
year={2008},
archivePrefix={arXiv},
eprint={... | bienkowski2008generalized |
arxiv-2626 | 0802.1690 | More on the Bernoulli and Taylor Formula for Extended Umbral Calculus | <|reference_start|>More on the Bernoulli and Taylor Formula for Extended Umbral Calculus: One delivers here the extended Bernoulli and Taylor formula of a new sort with the rest term of the Cauchy type recently derived by the author in the case of the so called $\psi$-difference calculus which constitutes the represent... | arxiv | @article{kwasniewski2008more,
title={More on the Bernoulli and Taylor Formula for Extended Umbral Calculus},
author={A. Krzysztof Kwasniewski},
journal={Advances in Applied Clifford Algebras Volume 16, Number 1,(2006)
29-39},
year={2008},
archivePrefix={arXiv},
eprint={0802.1690},
primaryC... | kwasniewski2008more |
arxiv-2627 | 0802.1696 | First Observations on Prefab Posets Whitney Numbers | <|reference_start|>First Observations on Prefab Posets Whitney Numbers: We introduce a natural partial order in structurally natural finite subsets of the cobweb prefabs sets recently constructed by the present author. Whitney numbers of the second kind of the corresponding subposet which constitute Stirling like numbe... | arxiv | @article{kwaśniewski2008first,
title={First Observations on Prefab Posets Whitney Numbers},
author={A. Krzysztof Kwa'sniewski},
journal={Advances in Applied Clifford Algebras Volume 18, Number 1 /
February, 2008, 57-73},
year={2008},
doi={10.1007/s00006-007-0054-7},
archivePrefix={arXiv},
... | kwaśniewski2008first |
arxiv-2628 | 0802.1699 | Longest paths in Planar DAGs in Unambiguous Logspace | <|reference_start|>Longest paths in Planar DAGs in Unambiguous Logspace: We show via two different algorithms that finding the length of the longest path in planar directed acyclic graph (DAG) is in unambiguous logspace UL, and also in the complement class co-UL. The result extends to toroidal DAGs as well.<|reference_... | arxiv | @article{limaye2008longest,
title={Longest paths in Planar DAGs in Unambiguous Logspace},
author={Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar},
journal={arXiv preprint arXiv:0802.1699},
year={2008},
archivePrefix={arXiv},
eprint={0802.1699},
primaryClass={cs.CC}
} | limaye2008longest |
arxiv-2629 | 0802.1722 | Parameterized Algorithms for Partial Cover Problems | <|reference_start|>Parameterized Algorithms for Partial Cover Problems: Covering problems are fundamental classical problems in optimization, computer science and complexity theory. Typically an input to these problems is a family of sets over a finite universe and the goal is to cover the elements of the universe with... | arxiv | @article{amini2008parameterized,
title={Parameterized Algorithms for Partial Cover Problems},
author={Omid Amini, Fedor V. Fomin and Saket Saurabh},
journal={arXiv preprint arXiv:0802.1722},
year={2008},
archivePrefix={arXiv},
eprint={0802.1722},
primaryClass={cs.DS}
} | amini2008parameterized |
arxiv-2630 | 0802.1738 | Characterising through Erasing: A Theoretical Framework for Representing Documents Inspired by Quantum Theory | <|reference_start|>Characterising through Erasing: A Theoretical Framework for Representing Documents Inspired by Quantum Theory: The problem of representing text documents within an Information Retrieval system is formulated as an analogy to the problem of representing the quantum states of a physical system. Lexical ... | arxiv | @article{huertas-rosero2008characterising,
title={Characterising through Erasing: A Theoretical Framework for Representing
Documents Inspired by Quantum Theory},
author={'Alvaro Francisco Huertas-Rosero, Leif Azzopardi and C. J. van
Rijsbergen},
journal={Proceedings of Quantum Interaction Symposium 2008... | huertas-rosero2008characterising |
arxiv-2631 | 0802.1754 | ARQ for Network Coding | <|reference_start|>ARQ for Network Coding: A new coding and queue management algorithm is proposed for communication networks that employ linear network coding. The algorithm has the feature that the encoding process is truly online, as opposed to a block-by-block approach. The setup assumes a packet erasure broadcast ... | arxiv | @article{sundararajan2008arq,
title={ARQ for Network Coding},
author={Jay Kumar Sundararajan, Devavrat Shah and Muriel M'edard},
journal={arXiv preprint arXiv:0802.1754},
year={2008},
doi={10.1109/ISIT.2008.4595268},
archivePrefix={arXiv},
eprint={0802.1754},
primaryClass={cs.IT cs.NI ma... | sundararajan2008arq |
arxiv-2632 | 0802.1785 | Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels | <|reference_start|>Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels: We propose Dijkstra's algorithm with bounded list size after QR decomposition for decreasing the computational complexity of near maximum-likelihood (ML) detection of signals over multiple-input-multiple-output (M... | arxiv | @article{okawado2008near,
title={Near ML detection using Dijkstra's algorithm with bounded list size over
MIMO channels},
author={Atsushi Okawado, Ryutaroh Matsumoto, Tomohiko Uyematsu},
journal={Proceedings of 2008 IEEE International Symposium on Information
Theory, pp. 2022-2025, 2008},
year={2008... | okawado2008near |
arxiv-2633 | 0802.1790 | SAT Has No Wizards | <|reference_start|>SAT Has No Wizards: An (encoded) decision problem is a pair (E, F) where E=words that encode instances of the problem, F=words to be accepted. We use "strings" in a technical sense. With an NP problem (E, F) we associate the "logogram" of F relative to E, which conveys structural information on E, F,... | arxiv | @article{di zenzo2008sat,
title={SAT Has No Wizards},
author={Silvano Di Zenzo},
journal={arXiv preprint arXiv:0802.1790},
year={2008},
archivePrefix={arXiv},
eprint={0802.1790},
primaryClass={cs.CC}
} | di zenzo2008sat |
arxiv-2634 | 0802.1815 | A Construction for Constant-Composition Codes | <|reference_start|>A Construction for Constant-Composition Codes: By employing the residue polynomials, a construction of constant-composition codes is given. This construction generalizes the one proposed by Xing[16]. It turns out that when d=3 this construction gives a lower bound of constant-composition codes improv... | arxiv | @article{ding2008a,
title={A Construction for Constant-Composition Codes},
author={Yang Ding},
journal={arXiv preprint arXiv:0802.1815},
year={2008},
doi={10.1109/TIT.2008.926380},
archivePrefix={arXiv},
eprint={0802.1815},
primaryClass={cs.IT math.IT}
} | ding2008a |
arxiv-2635 | 0802.1829 | A review of the Statistical Mechanics approach to Random Optimization Problems | <|reference_start|>A review of the Statistical Mechanics approach to Random Optimization Problems: We review the connection between statistical mechanics and the analysis of random optimization problems, with particular emphasis on the random k-SAT problem. We discuss and characterize the different phase transitions th... | arxiv | @article{altarelli2008a,
title={A review of the Statistical Mechanics approach to Random Optimization
Problems},
author={Fabrizio Altarelli, Remi Monasson, Guilhem Semerjian and Francesco
Zamponi},
journal={In "Handbook of Satisfiability", published by IOS press (2009),
Volume 185 of the Series "Front... | altarelli2008a |
arxiv-2636 | 0802.1884 | On the Complexity of Elementary Modal Logics | <|reference_start|>On the Complexity of Elementary Modal Logics: Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case basis. We prove a very general classification for a wide class of relevant l... | arxiv | @article{hemaspaandra2008on,
title={On the Complexity of Elementary Modal Logics},
author={Edith Hemaspaandra and Henning Schnoor},
journal={arXiv preprint arXiv:0802.1884},
year={2008},
archivePrefix={arXiv},
eprint={0802.1884},
primaryClass={cs.CC cs.LO}
} | hemaspaandra2008on |
arxiv-2637 | 0802.1888 | Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design | <|reference_start|>Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design: We consider single-source single-sink (ss-ss) multi-hop networks, with slow-fading links and single-antenna half-duplex relays. We identify two families of networks that are multi-hop generalizations of ... | arxiv | @article{sreeram2008multi-hop,
title={Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff
and Optimal Code Design},
author={K. Sreeram, S. Birenjith and P. Vijay Kumar},
journal={arXiv preprint arXiv:0802.1888},
year={2008},
archivePrefix={arXiv},
eprint={0802.1888},
p... | sreeram2008multi-hop |
arxiv-2638 | 0802.1893 | Diversity and Degrees of Freedom of Cooperative Wireless Networks | <|reference_start|>Diversity and Degrees of Freedom of Cooperative Wireless Networks: Wireless fading networks with multiple antennas are typically studied information-theoretically from two different perspectives - the outage characterization and the ergodic capacity characterization. A key parameter in the outage cha... | arxiv | @article{sreeram2008diversity,
title={Diversity and Degrees of Freedom of Cooperative Wireless Networks},
author={K. Sreeram, S. Birenjith and P. Vijay Kumar},
journal={arXiv preprint arXiv:0802.1893},
year={2008},
archivePrefix={arXiv},
eprint={0802.1893},
primaryClass={cs.IT math.IT}
} | sreeram2008diversity |
arxiv-2639 | 0802.1957 | To Broad-Match or Not to Broad-Match : An Auctioneer's Dilemma ? | <|reference_start|>To Broad-Match or Not to Broad-Match : An Auctioneer's Dilemma ?: We initiate the study of an interesting aspect of sponsored search advertising, namely the consequences of broad match-a feature where an ad of an advertiser can be mapped to a broader range of relevant queries, and not necessarily to ... | arxiv | @article{singh2008to,
title={To Broad-Match or Not to Broad-Match : An Auctioneer's Dilemma ?},
author={Sudhir Kumar Singh, Vwani P. Roychowdhury},
journal={arXiv preprint arXiv:0802.1957},
year={2008},
archivePrefix={arXiv},
eprint={0802.1957},
primaryClass={cs.GT cs.CC cs.DS}
} | singh2008to |
arxiv-2640 | 0802.2001 | Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem | <|reference_start|>Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem: There is considerable interest in the use of genetic algorithms to solve problems arising in the areas of scheduling and timetabling. However, the classical genetic algorithm paradigm is not well equipped to ha... | arxiv | @article{aickelin2008exploiting,
title={Exploiting problem structure in a genetic algorithm approach to a nurse
rostering problem},
author={Uwe Aickelin and Kathryn Dowsland},
journal={Journal of Scheduling, 3(3), pp 139-153, 2000},
year={2008},
doi={10.1002/(SICI)1099-1425(200005/06)3:3<139::AID-... | aickelin2008exploiting |
arxiv-2641 | 0802.2013 | Throughput-Delay Trade-off for Hierarchical Cooperation in Ad Hoc Wireless Networks | <|reference_start|>Throughput-Delay Trade-off for Hierarchical Cooperation in Ad Hoc Wireless Networks: Hierarchical cooperation has recently been shown to achieve better throughput scaling than classical multihop schemes under certain assumptions on the channel model in static wireless networks. However, the end-to-en... | arxiv | @article{ozgur2008throughput-delay,
title={Throughput-Delay Trade-off for Hierarchical Cooperation in Ad Hoc
Wireless Networks},
author={Ayfer Ozgur, Olivier Leveque},
journal={arXiv preprint arXiv:0802.2013},
year={2008},
doi={10.1109/ICTEL.2008.4652688},
archivePrefix={arXiv},
eprint={08... | ozgur2008throughput-delay |
arxiv-2642 | 0802.2015 | Combining Expert Advice Efficiently | <|reference_start|>Combining Expert Advice Efficiently: We show how models for prediction with expert advice can be defined concisely and clearly using hidden Markov models (HMMs); standard HMM algorithms can then be used to efficiently calculate, among other things, how the expert predictions should be weighted accord... | arxiv | @article{koolen2008combining,
title={Combining Expert Advice Efficiently},
author={Wouter Koolen and Steven de Rooij},
journal={arXiv preprint arXiv:0802.2015},
year={2008},
archivePrefix={arXiv},
eprint={0802.2015},
primaryClass={cs.LG cs.DS cs.IT math.IT}
} | koolen2008combining |
arxiv-2643 | 0802.2027 | Kolmogorov Complexity Theory over the Reals | <|reference_start|>Kolmogorov Complexity Theory over the Reals: Kolmogorov Complexity constitutes an integral part of computability theory, information theory, and computational complexity theory -- in the discrete setting of bits and Turing machines. Over real numbers, on the other hand, the BSS-machine (aka real-RAM)... | arxiv | @article{ziegler2008kolmogorov,
title={Kolmogorov Complexity Theory over the Reals},
author={Martin Ziegler and Wouter M. Koolen},
journal={arXiv preprint arXiv:0802.2027},
year={2008},
archivePrefix={arXiv},
eprint={0802.2027},
primaryClass={cs.CC cs.SC}
} | ziegler2008kolmogorov |
arxiv-2644 | 0802.2045 | Blocking Sets in the complement of hyperplane arrangements in projective space | <|reference_start|>Blocking Sets in the complement of hyperplane arrangements in projective space: It is well know that the theory of minimal blocking sets is studied by several author. Another theory which is also studied by a large number of researchers is the theory of hyperplane arrangements. We can remark that the... | arxiv | @article{settepanella2008blocking,
title={Blocking Sets in the complement of hyperplane arrangements in projective
space},
author={Simona Settepanella},
journal={arXiv preprint arXiv:0802.2045},
year={2008},
archivePrefix={arXiv},
eprint={0802.2045},
primaryClass={cs.IT math.IT}
} | settepanella2008blocking |
arxiv-2645 | 0802.2108 | Well-Centered Triangulation | <|reference_start|>Well-Centered Triangulation: Meshes composed of well-centered simplices have nice orthogonal dual meshes (the dual Voronoi diagram). This is useful for certain numerical algorithms that prefer such primal-dual mesh pairs. We prove that well-centered meshes also have optimality properties and relation... | arxiv | @article{vanderzee2008well-centered,
title={Well-Centered Triangulation},
author={Evan VanderZee, Anil N. Hirani, Damrong Guoy, Edgar Ramos},
journal={SIAM J. Sci. Comput. 31, 6 (2010) 4497-4523},
year={2008},
doi={10.1137/090748214},
number={UIUCDCS-R-2008-2936},
archivePrefix={arXiv},
... | vanderzee2008well-centered |
arxiv-2646 | 0802.2112 | On the Security of ``an efficient and complete remote user authentication scheme'' | <|reference_start|>On the Security of ``an efficient and complete remote user authentication scheme'': Recently, Liaw et al. proposed a remote user authentication scheme using smart cards. Their scheme has claimed a number of features e.g. mutual authentication, no clock synchronization, no verifier table, flexible use... | arxiv | @article{das2008on,
title={On the Security of ``an efficient and complete remote user
authentication scheme''},
author={Manik Lal Das},
journal={arXiv preprint arXiv:0802.2112},
year={2008},
archivePrefix={arXiv},
eprint={0802.2112},
primaryClass={cs.CR}
} | das2008on |
arxiv-2647 | 0802.2125 | Multiple Access Outerbounds and the Inseparability of Parallel Interference Channels | <|reference_start|>Multiple Access Outerbounds and the Inseparability of Parallel Interference Channels: It is known that the capacity of parallel (multi-carrier) Gaussian point-to-point, multiple access and broadcast channels can be achieved by separate encoding for each subchannel (carrier) subject to a power allocat... | arxiv | @article{cadambe2008multiple,
title={Multiple Access Outerbounds and the Inseparability of Parallel
Interference Channels},
author={Viveck R. Cadambe, Syed A. Jafar},
journal={IEEE Transactions on Information Theory, Vol. 55, No. 9, Sep.
2009,Pages: 3983-3990},
year={2008},
doi={10.1109/GLOCOM.2... | cadambe2008multiple |
arxiv-2648 | 0802.2127 | New Implementation Framework for Saturation-Based Reasoning | <|reference_start|>New Implementation Framework for Saturation-Based Reasoning: The saturation-based reasoning methods are among the most theoretically developed ones and are used by most of the state-of-the-art first-order logic reasoners. In the last decade there was a sharp increase in performance of such systems, w... | arxiv | @article{riazanov2008new,
title={New Implementation Framework for Saturation-Based Reasoning},
author={Alexandre Riazanov},
journal={arXiv preprint arXiv:0802.2127},
year={2008},
archivePrefix={arXiv},
eprint={0802.2127},
primaryClass={cs.AI cs.LO}
} | riazanov2008new |
arxiv-2649 | 0802.2130 | Domination in graphs with bounded propagation: algorithms, formulations and hardness results | <|reference_start|>Domination in graphs with bounded propagation: algorithms, formulations and hardness results: We introduce a hierarchy of problems between the \textsc{Dominating Set} problem and the \textsc{Power Dominating Set} (PDS) problem called the $\ell$-round power dominating set ($\ell$-round PDS, for short)... | arxiv | @article{aazami2008domination,
title={Domination in graphs with bounded propagation: algorithms, formulations
and hardness results},
author={Ashkan Aazami},
journal={arXiv preprint arXiv:0802.2130},
year={2008},
archivePrefix={arXiv},
eprint={0802.2130},
primaryClass={cs.DS cs.CC}
} | aazami2008domination |
arxiv-2650 | 0802.2134 | Minimizing the Maximum Interference is Hard | <|reference_start|>Minimizing the Maximum Interference is Hard: We consider the following interference model for wireless sensor and ad hoc networks: the receiver interference of a node is the number of transmission ranges it lies in. We model transmission ranges as disks. For this case we show that choosing transmissi... | arxiv | @article{buchin2008minimizing,
title={Minimizing the Maximum Interference is Hard},
author={Kevin Buchin},
journal={arXiv preprint arXiv:0802.2134},
year={2008},
archivePrefix={arXiv},
eprint={0802.2134},
primaryClass={cs.NI cs.CG}
} | buchin2008minimizing |
arxiv-2651 | 0802.2138 | Support Vector classifiers for Land Cover Classification | <|reference_start|>Support Vector classifiers for Land Cover Classification: Support vector machines represent a promising development in machine learning research that is not widely used within the remote sensing community. This paper reports the results of Multispectral(Landsat-7 ETM+) and Hyperspectral DAIS)data in ... | arxiv | @article{pal2008support,
title={Support Vector classifiers for Land Cover Classification},
author={Mahesh Pal and Paul M. Mather},
journal={arXiv preprint arXiv:0802.2138},
year={2008},
doi={10.1080/01431160802007624},
archivePrefix={arXiv},
eprint={0802.2138},
primaryClass={cs.NE cs.CV}... | pal2008support |
arxiv-2652 | 0802.2157 | Choice numbers of graphs | <|reference_start|>Choice numbers of graphs: 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. The simplest case of another problem, stated by the same authors, is settled, proving that ... | arxiv | @article{gutner2008choice,
title={Choice numbers of graphs},
author={Shai Gutner},
journal={arXiv preprint arXiv:0802.2157},
year={2008},
archivePrefix={arXiv},
eprint={0802.2157},
primaryClass={cs.DM cs.CC cs.DS}
} | gutner2008choice |
arxiv-2653 | 0802.2158 | A Radar-Shaped Statistic for Testing and Visualizing Uniformity Properties in Computer Experiments | <|reference_start|>A Radar-Shaped Statistic for Testing and Visualizing Uniformity Properties in Computer Experiments: In the study of computer codes, filling space as uniformly as possible is important to describe the complexity of the investigated phenomenon. However, this property is not conserved by reducing the di... | arxiv | @article{franco2008a,
title={A Radar-Shaped Statistic for Testing and Visualizing Uniformity
Properties in Computer Experiments},
author={Jessica Franco, Laurent Carraro, Olivier Roustant, Astrid Jourdan
(LMA-PAU)},
journal={arXiv preprint arXiv:0802.2158},
year={2008},
archivePrefix={arXiv},
... | franco2008a |
arxiv-2654 | 0802.2159 | A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks | <|reference_start|>A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless Networks: This paper introduces a novel concept from coalitional game theory which allows the dynamic formation of coalitions among wireless nodes. A simple and distributed merge and split algorithm for coalition formation is co... | arxiv | @article{saad2008a,
title={A Distributed Merge and Split Algorithm for Fair Cooperation in Wireless
Networks},
author={Walid Saad, Zhu Han, Merouane Debbah and Are Hj{o}rungnes},
journal={arXiv preprint arXiv:0802.2159},
year={2008},
doi={10.1109/ICCW.2008.65},
archivePrefix={arXiv},
eprin... | saad2008a |
arxiv-2655 | 0802.2175 | Bounds on the Number of Numerical Semigroups of a Given Genus | <|reference_start|>Bounds on the Number of Numerical Semigroups of a Given Genus: Combinatorics on multisets is used to deduce new upper and lower bounds on the number of numerical semigroups of each given genus, significantly improving existing ones. In particular, it is proved that the number $n_g$ of numerical semig... | arxiv | @article{bras-amoros2008bounds,
title={Bounds on the Number of Numerical Semigroups of a Given Genus},
author={Maria Bras-Amoros},
journal={arXiv preprint arXiv:0802.2175},
year={2008},
archivePrefix={arXiv},
eprint={0802.2175},
primaryClass={math.CO cs.DM}
} | bras-amoros2008bounds |
arxiv-2656 | 0802.2184 | Set Covering Problems with General Objective Functions | <|reference_start|>Set Covering Problems with General Objective Functions: We introduce a parameterized version of set cover that generalizes several previously studied problems. Given a ground set V and a collection of subsets S_i of V, a feasible solution is a partition of V such that each subset of the partition is ... | arxiv | @article{cardinal2008set,
title={Set Covering Problems with General Objective Functions},
author={Jean Cardinal, Christophe Dumeunier},
journal={arXiv preprint arXiv:0802.2184},
year={2008},
archivePrefix={arXiv},
eprint={0802.2184},
primaryClass={cs.DS}
} | cardinal2008set |
arxiv-2657 | 0802.2201 | Reconstruction of eye movements during blinks | <|reference_start|>Reconstruction of eye movements during blinks: In eye movement research in reading, the amount of data plays a crucial role for the validation of results. A methodological problem for the analysis of the eye movement in reading are blinks, when readers close their eyes. Blinking rate increases with i... | arxiv | @article{baptista2008reconstruction,
title={Reconstruction of eye movements during blinks},
author={M. S. Baptista, C. Bohn, R. Kliegl, R. Engbert, J. Kurths},
journal={Chaos (2008)},
year={2008},
doi={10.1063/1.2890843},
archivePrefix={arXiv},
eprint={0802.2201},
primaryClass={cs.SC}
} | baptista2008reconstruction |
arxiv-2658 | 0802.2228 | Digraph Decompositions and Monotonicity in Digraph Searching | <|reference_start|>Digraph Decompositions and Monotonicity in Digraph Searching: We consider monotonicity problems for graph searching games. Variants of these games - defined by the type of moves allowed for the players - have been found to be closely connected to graph decompositions and associated width measures suc... | arxiv | @article{kreutzer2008digraph,
title={Digraph Decompositions and Monotonicity in Digraph Searching},
author={Stephan Kreutzer, Sebastian Ordyniak},
journal={arXiv preprint arXiv:0802.2228},
year={2008},
archivePrefix={arXiv},
eprint={0802.2228},
primaryClass={cs.DM cs.DS}
} | kreutzer2008digraph |
arxiv-2659 | 0802.2234 | Textual Fingerprinting with Texts from Parkin, Bassewitz, and Leander | <|reference_start|>Textual Fingerprinting with Texts from Parkin, Bassewitz, and Leander: Current research in author profiling to discover a legal author's fingerprint does not only follow examinations based on statistical parameters only but include more and more dynamic methods that can learn and that react adaptable... | arxiv | @article{schommer2008textual,
title={Textual Fingerprinting with Texts from Parkin, Bassewitz, and Leander},
author={Christoph Schommer, Conny Uhde},
journal={arXiv preprint arXiv:0802.2234},
year={2008},
archivePrefix={arXiv},
eprint={0802.2234},
primaryClass={cs.CL cs.CR}
} | schommer2008textual |
arxiv-2660 | 0802.2258 | Using Alloy to model-check visual design notations | <|reference_start|>Using Alloy to model-check visual design notations: This paper explores the process of validation for the abstract syntax of a graphical notation. We define an unified specification for five of the UML diagrams used by the Discovery Method and, in this document, we illustrate how diagrams can be repr... | arxiv | @article{simons2008using,
title={Using Alloy to model-check visual design notations},
author={Anthony J. H. Simons, Carlos Alberto Fernandez-y-Fernandez},
journal={Simons, A.J.H. and Fernandez-y-Fernandez, C.A., Using Alloy to
model-check visual design notations. In Sixth Mexican Int. Conf. on C S,
(Mex... | simons2008using |
arxiv-2661 | 0802.2300 | Approximation Resistant Predicates From Pairwise Independence | <|reference_start|>Approximation Resistant Predicates From Pairwise Independence: We study the approximability of predicates on $k$ variables from a domain $[q]$, and give a new sufficient condition for such predicates to be approximation resistant under the Unique Games Conjecture. Specifically, we show that a predica... | arxiv | @article{austrin2008approximation,
title={Approximation Resistant Predicates From Pairwise Independence},
author={Per Austrin and Elchanan Mossel},
journal={arXiv preprint arXiv:0802.2300},
year={2008},
archivePrefix={arXiv},
eprint={0802.2300},
primaryClass={cs.CC}
} | austrin2008approximation |
arxiv-2662 | 0802.2305 | Compressed Counting | <|reference_start|>Compressed Counting: Counting is among the most fundamental operations in computing. For example, counting the pth frequency moment has been a very active area of research, in theoretical computer science, databases, and data mining. When p=1, the task (i.e., counting the sum) can be accomplished usi... | arxiv | @article{li2008compressed,
title={Compressed Counting},
author={Ping Li},
journal={arXiv preprint arXiv:0802.2305},
year={2008},
archivePrefix={arXiv},
eprint={0802.2305},
primaryClass={cs.IT cs.CC cs.DM cs.DS cs.LG math.IT}
} | li2008compressed |
arxiv-2663 | 0802.2306 | Software graphs and programmer awareness | <|reference_start|>Software graphs and programmer awareness: Dependencies between types in object-oriented software can be viewed as directed graphs, with types as nodes and dependencies as edges. The in-degree and out-degree distributions of such graphs have quite different forms, with the former resembling a power-la... | arxiv | @article{baxter2008software,
title={Software graphs and programmer awareness},
author={G. J. Baxter, M. R. Frean},
journal={arXiv preprint arXiv:0802.2306},
year={2008},
archivePrefix={arXiv},
eprint={0802.2306},
primaryClass={cs.SE cs.PL}
} | baxter2008software |
arxiv-2664 | 0802.2317 | The Stength of Weak cooperation: A Case Study on Flickr | <|reference_start|>The Stength of Weak cooperation: A Case Study on Flickr: Web 2.0 works with the principle of weak cooperation, where a huge amount of individual contributions build solid and structured sources of data. In this paper, we detail the main properties of this weak cooperation by illustrating them on the ... | arxiv | @article{prieur2008the,
title={The Stength of Weak cooperation: A Case Study on Flickr},
author={Christophe Prieur (LIAFA), Dominique Cardon, Jean-Samuel Beuscart,
Nicolas Pissard, Pascal Pons (LIAFA)},
journal={arXiv preprint arXiv:0802.2317},
year={2008},
archivePrefix={arXiv},
eprint={0802.... | prieur2008the |
arxiv-2665 | 0802.2345 | On the Frame Error Rate of Transmission Schemes on Quasi-Static Fading Channels | <|reference_start|>On the Frame Error Rate of Transmission Schemes on Quasi-Static Fading Channels: It is known that the frame error rate of turbo codes on quasi-static fading channels can be accurately approximated using the convergence threshold of the corresponding iterative decoder. This paper considers quasi-stati... | arxiv | @article{chatzigeorgiou2008on,
title={On the Frame Error Rate of Transmission Schemes on Quasi-Static Fading
Channels},
author={Ioannis Chatzigeorgiou, Ian J. Wassell and Rolando Carrasco},
journal={arXiv preprint arXiv:0802.2345},
year={2008},
doi={10.1109/CISS.2008.4558591},
archivePrefix={a... | chatzigeorgiou2008on |
arxiv-2666 | 0802.2349 | Algebraic geometry codes from higher dimensional varieties | <|reference_start|>Algebraic geometry codes from higher dimensional varieties: This paper is a general survey of literature on Goppa-type codes from higher dimensional algebraic varieties. The construction and several techniques for estimating the minimum distance are described first. Codes from various classes of vari... | arxiv | @article{little2008algebraic,
title={Algebraic geometry codes from higher dimensional varieties},
author={John B. Little},
journal={arXiv preprint arXiv:0802.2349},
year={2008},
archivePrefix={arXiv},
eprint={0802.2349},
primaryClass={cs.IT math.IT}
} | little2008algebraic |
arxiv-2667 | 0802.2360 | On Maximizing Coverage in Gaussian Relay Networks | <|reference_start|>On Maximizing Coverage in Gaussian Relay Networks: Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspective, where the objective is maximizing coverage for a given rate. The n... | arxiv | @article{aggarwal2008on,
title={On Maximizing Coverage in Gaussian Relay Networks},
author={Vaneet Aggarwal, Amir Bennatan and A. Robert Calderbank},
journal={IEEE Trans. Information Theory, vol.55, no.6, pp. 2518-2536 (Jun.
2009)},
year={2008},
doi={10.1109/TIT.2009.2018337},
archivePrefix={a... | aggarwal2008on |
arxiv-2668 | 0802.2371 | Generic and Typical Ranks of Three-Way Arrays | <|reference_start|>Generic and Typical Ranks of Three-Way Arrays: The concept of tensor rank, introduced in the twenties, has been popularized at the beginning of the seventies. This has allowed to carry out Factor Analysis on arrays with more than two indices. The generic rank may be seen as an upper bound to the numb... | arxiv | @article{comon2008generic,
title={Generic and Typical Ranks of Three-Way Arrays},
author={P. Comon and J. ten Berge},
journal={arXiv preprint arXiv:0802.2371},
year={2008},
number={I3S report ISRN I3S/RR-2006-29-FR},
archivePrefix={arXiv},
eprint={0802.2371},
primaryClass={cs.OH cs.MS}
} | comon2008generic |
arxiv-2669 | 0802.2385 | Essential variables and positions in terms | <|reference_start|>Essential variables and positions in terms: The paper deals with $\Sigma-$composition of terms, which allows us to extend the derivation rules in formal deduction of identities. The concept of essential variables and essential positions of terms with respect to a set of identities is a key step in ... | arxiv | @article{shtrakov2008essential,
title={Essential variables and positions in terms},
author={Slavcho Shtrakov},
journal={J. Algebra Universalis, Vol. 61, No 3-4, (2009), pp. 381-397},
year={2008},
archivePrefix={arXiv},
eprint={0802.2385},
primaryClass={math.GM cs.IT math.IT}
} | shtrakov2008essential |
arxiv-2670 | 0802.2411 | Multiclass Approaches for Support Vector Machine Based Land Cover Classification | <|reference_start|>Multiclass Approaches for Support Vector Machine Based Land Cover Classification: SVMs were initially developed to perform binary classification; though, applications of binary classification are very limited. Most of the practical applications involve multiclass classification, especially in remote ... | arxiv | @article{pal2008multiclass,
title={Multiclass Approaches for Support Vector Machine Based Land Cover
Classification},
author={Mahesh Pal},
journal={arXiv preprint arXiv:0802.2411},
year={2008},
archivePrefix={arXiv},
eprint={0802.2411},
primaryClass={cs.NE cs.CV}
} | pal2008multiclass |
arxiv-2671 | 0802.2418 | Improved Approximations for Multiprocessor Scheduling Under Uncertainty | <|reference_start|>Improved Approximations for Multiprocessor Scheduling Under Uncertainty: This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty, or SUU, in which the execution of each job may fail probabilistically. This problem is motivated by the increa... | arxiv | @article{crutchfield2008improved,
title={Improved Approximations for Multiprocessor Scheduling Under Uncertainty},
author={Christopher Crutchfield, Zoran Dzunic, Jeremy T. Fineman, David R.
Karger, and Jacob Scott},
journal={arXiv preprint arXiv:0802.2418},
year={2008},
archivePrefix={arXiv},
... | crutchfield2008improved |
arxiv-2672 | 0802.2428 | Sign Language Tutoring Tool | <|reference_start|>Sign Language Tutoring Tool: In this project, we have developed a sign language tutor that lets users learn isolated signs by watching recorded videos and by trying the same signs. The system records the user's video and analyses it. If the sign is recognized, both verbal and animated feedback is giv... | arxiv | @article{aran2008sign,
title={Sign Language Tutoring Tool},
author={Oya Aran, Ismail Ari, Alexandre Benoit (GIPSA-lab), Ana Huerta
Carrillo, Franc{c}ois-Xavier Fanard (TELE), Pavel Campr, Lale Akarun, Alice
Caplier (GIPSA-lab), Michele Rombaut (GIPSA-lab), Bulent Sankur},
journal={arXiv preprint arXiv:0... | aran2008sign |
arxiv-2673 | 0802.2429 | Anisotropic selection in cellular genetic algorithms | <|reference_start|>Anisotropic selection in cellular genetic algorithms: In this paper we introduce a new selection scheme in cellular genetic algorithms (cGAs). Anisotropic Selection (AS) promotes diversity and allows accurate control of the selective pressure. First we compare this new scheme with the classical recta... | arxiv | @article{simoncini2008anisotropic,
title={Anisotropic selection in cellular genetic algorithms},
author={David Simoncini (I3S), S'ebastien Verel (I3S), Philippe Collard
(I3S), Manuel Clergue (I3S)},
journal={Dans Proceedings of the 8th annual conference on Genetic and
evolutionary computation - Genetic ... | simoncini2008anisotropic |
arxiv-2674 | 0802.2432 | Fixed Point and Aperiodic Tilings | <|reference_start|>Fixed Point and Aperiodic Tilings: An aperiodic tile set was first constructed by R.Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals) We present a new con... | arxiv | @article{durand2008fixed,
title={Fixed Point and Aperiodic Tilings},
author={Bruno Durand (LIF), Andrei Romashchenko (LIP), Alexander Shen (LIF)},
journal={12th International Conference on Developments in Language Theory,
Kyoto : Japan (2008)},
year={2008},
doi={10.1007/978-3-540-85780-8_22},
... | durand2008fixed |
arxiv-2675 | 0802.2451 | Capacity of General Discrete Noiseless Channels | <|reference_start|>Capacity of General Discrete Noiseless Channels: This paper concerns the capacity of the discrete noiseless channel introduced by Shannon. A sufficient condition is given for the capacity to be well-defined. For a general discrete noiseless channel allowing non-integer valued symbol weights, it is sh... | arxiv | @article{bocherer2008capacity,
title={Capacity of General Discrete Noiseless Channels},
author={Georg Bocherer and Valdemar Cardoso da Rocha Junior and Cecilio
Pimentel},
journal={arXiv preprint arXiv:0802.2451},
year={2008},
archivePrefix={arXiv},
eprint={0802.2451},
primaryClass={cs.IT m... | bocherer2008capacity |
arxiv-2676 | 0802.2476 | Theoretical Analysis of the Energy Capture in Strictly Bandlimited Ultra-Wideband Channels | <|reference_start|>Theoretical Analysis of the Energy Capture in Strictly Bandlimited Ultra-Wideband Channels: The frequency selectivity of wireless communication channels can be characterized by the delay spread Ds of the channel impulse response. If the delay spread is small compared to the bandwidth W of the input s... | arxiv | @article{böcherer2008theoretical,
title={Theoretical Analysis of the Energy Capture in Strictly Bandlimited
Ultra-Wideband Channels},
author={Georg B"ocherer and Daniel Bielefeld},
journal={arXiv preprint arXiv:0802.2476},
year={2008},
archivePrefix={arXiv},
eprint={0802.2476},
primaryClas... | böcherer2008theoretical |
arxiv-2677 | 0802.2528 | Min-Cost 2-Connected Subgraphs With k Terminals | <|reference_start|>Min-Cost 2-Connected Subgraphs With k Terminals: In the k-2VC problem, we are given an undirected graph G with edge costs and an integer k; the goal is to find a minimum-cost 2-vertex-connected subgraph of G containing at least k vertices. A slightly more general version is obtained if the input also... | arxiv | @article{chekuri2008min-cost,
title={Min-Cost 2-Connected Subgraphs With k Terminals},
author={Chandra Chekuri, Nitish Korula},
journal={arXiv preprint arXiv:0802.2528},
year={2008},
archivePrefix={arXiv},
eprint={0802.2528},
primaryClass={cs.DS}
} | chekuri2008min-cost |
arxiv-2678 | 0802.2543 | Self-* overload control for distributed web systems | <|reference_start|>Self-* overload control for distributed web systems: Unexpected increases in demand and most of all flash crowds are considered the bane of every web application as they may cause intolerable delays or even service unavailability. Proper quality of service policies must guarantee rapid reactivity and... | arxiv | @article{bartolini2008self-*,
title={Self-* overload control for distributed web systems},
author={Novella Bartolini, Giancarlo Bongiovanni, Simone Silvestri (Department
of Computer Science University of Rome Sapienza, Italy)},
journal={arXiv preprint arXiv:0802.2543},
year={2008},
archivePrefix={... | bartolini2008self-* |
arxiv-2679 | 0802.2574 | The minimal set of Ingleton inequalities | <|reference_start|>The minimal set of Ingleton inequalities: The Ingleton-LP bound is an outer bound for the multicast capacity region, assuming the use of linear network codes. Computation of the bound is performed on a polyhedral cone obtained by taking the intersection of half-spaces induced by the basic (Shannon-ty... | arxiv | @article{guille2008the,
title={The minimal set of Ingleton inequalities},
author={Laurent Guille, Terence Chan and Alex Grant},
journal={arXiv preprint arXiv:0802.2574},
year={2008},
archivePrefix={arXiv},
eprint={0802.2574},
primaryClass={cs.IT math.IT}
} | guille2008the |
arxiv-2680 | 0802.2587 | Order-Optimal Consensus through Randomized Path Averaging | <|reference_start|>Order-Optimal Consensus through Randomized Path Averaging: Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over networks. However for many topologies that are realistic for ... | arxiv | @article{benezit2008order-optimal,
title={Order-Optimal Consensus through Randomized Path Averaging},
author={F. Benezit, A.G. Dimakis, P. Thiran, M. Vetterli},
journal={arXiv preprint arXiv:0802.2587},
year={2008},
archivePrefix={arXiv},
eprint={0802.2587},
primaryClass={cs.IT cs.NI math.IT... | benezit2008order-optimal |
arxiv-2681 | 0802.2594 | Guarding curvilinear art galleries with vertex or point guards | <|reference_start|>Guarding curvilinear art galleries with vertex or point guards: One of the earliest and most well known problems in computational geometry is the so-called art gallery problem. The goal is to compute the minimum possible number guards placed on the vertices of a simple polygon in such a way that they... | arxiv | @article{karavelas2008guarding,
title={Guarding curvilinear art galleries with vertex or point guards},
author={Menelaos I. Karavelas and Elias P. Tsigaridas},
journal={Comput. Geom. Theory Appl. 42(6-7):522-535, 2009},
year={2008},
doi={10.1016/j.comgeo.2008.11.002},
archivePrefix={arXiv},
... | karavelas2008guarding |
arxiv-2682 | 0802.2612 | On Subgraph Isomorphism | <|reference_start|>On Subgraph Isomorphism: Article explicitly expresses Subgraph Isomorphism by a polynomial size asymmetric linear system.<|reference_end|> | arxiv | @article{gubin2008on,
title={On Subgraph Isomorphism},
author={Sergey Gubin},
journal={Polynomial size asymmetric linear model for Subgraph Isomorphism,
Proceedings WCECS 2008, ISBN: 978-988-98671-0-2, pp.241-246},
year={2008},
archivePrefix={arXiv},
eprint={0802.2612},
primaryClass={cs.DM... | gubin2008on |
arxiv-2683 | 0802.2655 | Pure Exploration for Multi-Armed Bandit Problems | <|reference_start|>Pure Exploration for Multi-Armed Bandit Problems: We consider the framework of stochastic multi-armed bandit problems and study the possibilities and limitations of forecasters that perform an on-line exploration of the arms. These forecasters are assessed in terms of their simple regret, a regret no... | arxiv | @article{bubeck2008pure,
title={Pure Exploration for Multi-Armed Bandit Problems},
author={S'ebastien Bubeck (INRIA Futurs), R'emi Munos (INRIA Futurs), Gilles
Stoltz (DMA, GREGH)},
journal={arXiv preprint arXiv:0802.2655},
year={2008},
archivePrefix={arXiv},
eprint={0802.2655},
primaryCla... | bubeck2008pure |
arxiv-2684 | 0802.2666 | Distributed Joint Source-Channel Coding for arbitrary memoryless correlated sources and Source coding for Markov correlated sources using LDPC codes | <|reference_start|>Distributed Joint Source-Channel Coding for arbitrary memoryless correlated sources and Source coding for Markov correlated sources using LDPC codes: In this paper, we give a distributed joint source channel coding scheme for arbitrary correlated sources for arbitrary point in the Slepian-Wolf rate r... | arxiv | @article{aggarwal2008distributed,
title={Distributed Joint Source-Channel Coding for arbitrary memoryless
correlated sources and Source coding for Markov correlated sources using LDPC
codes},
author={Vaneet Aggarwal},
journal={arXiv preprint arXiv:0802.2666},
year={2008},
archivePrefix={arXiv},
... | aggarwal2008distributed |
arxiv-2685 | 0802.2668 | The complexity of planar graph choosability | <|reference_start|>The complexity of planar graph choosability: A graph $G$ is {\em $k$-choosable} if for every assignment of a set $S(v)$ of $k$ colors to every vertex $v$ of $G$, there is a proper coloring of $G$ that assigns to each vertex $v$ a color from $S(v)$. We consider the complexity of deciding whether a giv... | arxiv | @article{gutner2008the,
title={The complexity of planar graph choosability},
author={Shai Gutner},
journal={Discrete Math. 159 (1996), 119-130},
year={2008},
archivePrefix={arXiv},
eprint={0802.2668},
primaryClass={cs.DM cs.CC cs.DS}
} | gutner2008the |
arxiv-2686 | 0802.2684 | A Simple Distributed Antenna Processing Scheme for Cooperative Diversity | <|reference_start|>A Simple Distributed Antenna Processing Scheme for Cooperative Diversity: In this letter the performance of multiple relay channels is analyzed for the situation in which multiple antennas are deployed only at the relays. The simple repetition-coded decodeand- forward protocol with two different ante... | arxiv | @article{fan2008a,
title={A Simple Distributed Antenna Processing Scheme for Cooperative Diversity},
author={Yijia Fan, Abdulkareem Adinoyi, John S Thompson, Halim Yanikomeroglu,
H. Vincent Poor},
journal={arXiv preprint arXiv:0802.2684},
year={2008},
archivePrefix={arXiv},
eprint={0802.2684},... | fan2008a |
arxiv-2687 | 0802.2685 | The Opportunistic Transmission of Wireless Worms between Mobile Devices | <|reference_start|>The Opportunistic Transmission of Wireless Worms between Mobile Devices: The ubiquity of portable wireless-enabled computing and communications devices has stimulated the emergence of malicious codes (wireless worms) that are capable of spreading between spatially proximal devices. The potential exis... | arxiv | @article{rhodes2008the,
title={The Opportunistic Transmission of Wireless Worms between Mobile Devices},
author={C. J. Rhodes and M. Nekovee},
journal={arXiv preprint arXiv:0802.2685},
year={2008},
doi={10.1016/j.physa.2008.09.017},
archivePrefix={arXiv},
eprint={0802.2685},
primaryClass... | rhodes2008the |
arxiv-2688 | 0802.2696 | On Characteristic Polynomials of the Family of Cobweb Posets | <|reference_start|>On Characteristic Polynomials of the Family of Cobweb Posets: This note is a response to one of problems posed by A.K. Kwasniewski in one of his recent papers. Namely for the sequence of finite cobweb subposets, the looked for explicit formulas for corresponding sequence of characteristic polynomials... | arxiv | @article{krot-sieniawska2008on,
title={On Characteristic Polynomials of the Family of Cobweb Posets},
author={Ewa Krot-Sieniawska},
journal={arXiv preprint arXiv:0802.2696},
year={2008},
archivePrefix={arXiv},
eprint={0802.2696},
primaryClass={math.CO cs.DM}
} | krot-sieniawska2008on |
arxiv-2689 | 0802.2701 | Authentication over Noisy Channels | <|reference_start|>Authentication over Noisy Channels: In this work, message authentication over noisy channels is studied. The model developed in this paper is the authentication theory counterpart of Wyner's wiretap channel model. Two types of opponent attacks, namely impersonation attacks and substitution attacks, a... | arxiv | @article{lai2008authentication,
title={Authentication over Noisy Channels},
author={Lifeng Lai, Hesham El Gamal and H. Vincent Poor},
journal={arXiv preprint arXiv:0802.2701},
year={2008},
archivePrefix={arXiv},
eprint={0802.2701},
primaryClass={cs.IT cs.CR math.IT}
} | lai2008authentication |
arxiv-2690 | 0802.2703 | Optimal Medium Access Protocols for Cognitive Radio Networks | <|reference_start|>Optimal Medium Access Protocols for Cognitive Radio Networks: This paper focuses on the design of medium access control protocols for cognitive radio networks. The scenario in which a single cognitive user wishes to opportunistically exploit the availability of empty frequency bands within parts of t... | arxiv | @article{lai2008optimal,
title={Optimal Medium Access Protocols for Cognitive Radio Networks},
author={Lifeng Lai, Hesham El Gamal, Hai Jiang and H. Vincent Poor},
journal={arXiv preprint arXiv:0802.2703},
year={2008},
archivePrefix={arXiv},
eprint={0802.2703},
primaryClass={cs.IT cs.NI math... | lai2008optimal |
arxiv-2691 | 0802.2723 | On strongly controllable group codes and mixing group shifts: solvable groups, translation nets, and algorithms | <|reference_start|>On strongly controllable group codes and mixing group shifts: solvable groups, translation nets, and algorithms: The branch group of a strongly controllable group code is a shift group. We show that a shift group can be characterized in a very simple way. In addition it is shown that if a strongly co... | arxiv | @article{mackenthun2008on,
title={On strongly controllable group codes and mixing group shifts: solvable
groups, translation nets, and algorithms},
author={Kenneth M. Mackenthun Jr},
journal={arXiv preprint arXiv:0802.2723},
year={2008},
archivePrefix={arXiv},
eprint={0802.2723},
primaryCl... | mackenthun2008on |
arxiv-2692 | 0802.2736 | On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems | <|reference_start|>On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems: This paper has been withdrawn by the corresponding author because the newest version is now published in Discrete Applied Mathematics.<|reference_end|> | arxiv | @article{guillemot2008on,
title={On the approximability of the Maximum Agreement SubTree and Maximum
Compatible Tree problems},
author={Sylvain Guillemot, Francois Nicolas, Vincent Berry and Christophe Paul},
journal={arXiv preprint arXiv:0802.2736},
year={2008},
doi={10.1016/j.dam.2008.06.007},
... | guillemot2008on |
arxiv-2693 | 0802.2755 | Covering Directed Graphs by In-trees | <|reference_start|>Covering Directed Graphs by In-trees: Given a directed graph $D=(V,A)$ with a set of $d$ specified vertices $S=\{s_1,...,s_d\}\subseteq V$ and a function $f\colon S \to \mathbb{Z}_+$ where $\mathbb{Z}_+$ denotes the set of non-negative integers, we consider the problem which asks whether there exist ... | arxiv | @article{kamiyama2008covering,
title={Covering Directed Graphs by In-trees},
author={Naoyuki Kamiyama, Naoki Katoh},
journal={arXiv preprint arXiv:0802.2755},
year={2008},
archivePrefix={arXiv},
eprint={0802.2755},
primaryClass={cs.DM}
} | kamiyama2008covering |
arxiv-2694 | 0802.2773 | Stiffness Analysis of 3-dof Overconstrained Translational Parallel Manipulators | <|reference_start|>Stiffness Analysis of 3-dof Overconstrained Translational Parallel Manipulators: The paper presents a new stiffness modelling method for overconstrained parallel manipulators, which is applied to 3-d.o.f. translational mechanisms. It is based on a multidimensional lumped-parameter model that replaces... | arxiv | @article{pashkevich2008stiffness,
title={Stiffness Analysis of 3-d.o.f. Overconstrained Translational Parallel
Manipulators},
author={Anatoly Pashkevich (IRCCyN), Damien Chablat (IRCCyN), Philippe Wenger
(IRCCyN)},
journal={Dans IEEE Int. Conference on Robotics and Automation - ICRA IEEE
Int. Conferen... | pashkevich2008stiffness |
arxiv-2695 | 0802.2823 | On the decomposition of k-valued rational relations | <|reference_start|>On the decomposition of k-valued rational relations: We give a new, and hopefully more easily understandable, structural proof of the decomposition of a $k$-valued transducer into $k$ unambiguous functional ones, a result established by A. Weber in 1996. Our construction is based on a lexicographic o... | arxiv | @article{sakarovitch2008on,
title={On the decomposition of k-valued rational relations},
author={Jacques Sakarovitch (LTCI), Rodrigo De Souza (LTCI)},
journal={Dans Proceedings of the 25th Annual Symposium on the Theoretical
Aspects of Computer Science - STACS 2008, Bordeaux : France (2008)},
year={20... | sakarovitch2008on |
arxiv-2696 | 0802.2825 | The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace | <|reference_start|>The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace: The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithms, it is in the class $AC^1$. In this pa... | arxiv | @article{thierauf2008the,
title={The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous
Logspace},
author={Thomas Thierauf, Fabian Wagner},
journal={Dans Proceedings of the 25th Annual Symposium on the Theoretical
Aspects of Computer Science - STACS 2008, Bordeaux : France (2008)},
... | thierauf2008the |
arxiv-2697 | 0802.2826 | Efficient Minimization of DFAs with Partial Transition Functions | <|reference_start|>Efficient Minimization of DFAs with Partial Transition Functions: Let PT-DFA mean a deterministic finite automaton whose transition relation is a partial function. We present an algorithm for minimizing a PT-DFA in $O(m \lg n)$ time and $O(m+n+\alpha)$ memory, where $n$ is the number of states, $m$ i... | arxiv | @article{valmari2008efficient,
title={Efficient Minimization of DFAs with Partial Transition Functions},
author={Antti Valmari, Petri Lehtinen},
journal={Dans Proceedings of the 25th Annual Symposium on the Theoretical
Aspects of Computer Science - STACS 2008, Bordeaux : France (2008)},
year={2008},
... | valmari2008efficient |
arxiv-2698 | 0802.2827 | Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set | <|reference_start|>Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set: The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we propose to use measure and conquer also as a... | arxiv | @article{van rooij2008design,
title={Design by Measure and Conquer, A Faster Exact Algorithm for Dominating
Set},
author={Johan M. M. Van Rooij, Hans L. Bodlaender},
journal={Dans Proceedings of the 25th Annual Symposium on the Theoretical
Aspects of Computer Science - STACS 2008, Bordeaux : France (200... | van rooij2008design |
arxiv-2699 | 0802.2828 | Structural aspects of tilings | <|reference_start|>Structural aspects of tilings: In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each tiling contains. This set of patterns can be analyzed in two different contexts: the firs... | arxiv | @article{ballier2008structural,
title={Structural aspects of tilings},
author={Alexis Ballier (LIF), Bruno Durand (LIF), Emmanuel Jeandel (LIF)},
journal={Dans Proceedings of the 25th Annual Symposium on the Theoretical
Aspects of Computer Science - STACS 2008, Bordeaux : France (2008)},
year={2008},
... | ballier2008structural |
arxiv-2700 | 0802.2829 | Understanding maximal repetitions in strings | <|reference_start|>Understanding maximal repetitions in strings: The cornerstone of any algorithm computing all repetitions in a string of length n in O(n) time is the fact that the number of runs (or maximal repetitions) is O(n). We give a simple proof of this result. As a consequence of our approach, the stronger res... | arxiv | @article{crochemore2008understanding,
title={Understanding maximal repetitions in strings},
author={Maxime Crochemore (IGM), Lucian Ilie},
journal={Dans Proceedings of the 25th Annual Symposium on the Theoretical
Aspects of Computer Science - STACS 2008, Bordeaux : France (2008)},
year={2008},
arc... | crochemore2008understanding |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.