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 an exponentially large outcome space. We examine both permutation combinatorics, where outcomes are permutations of objects, and Boolean combinatorics, where outcomes are combinations of binary events. We look at three restrictive languages that limit what traders can bet on. Even with severely limited languages, we find that LMSR pricing is $\SP$-hard, even when the same language admits polynomial-time matching without the market maker. We then propose an approximation technique for pricing permutation markets based on a recent algorithm for online permutation learning. The connections we draw between LMSR pricing and the vast literature on online learning with expert advice may be of independent interest.<|reference_end|> | 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-programming decoder formulation.<|reference_end|> | 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 singular value bases of the rectangular channel matrix $\bH$ are generated independently from uniform distributions over Haar measures and the eigenvalues of $\bH^{\rm T}\bH$ asymptotically follow a certain specific distribution. These assumptions make it possible to characterize the communication performance of the channel utilizing an integral formula with respect to $\bH$, which is analogous to the one introduced by Marinari {\em et. al.} in {\em J. Phys. A} {\bf 27}, 7647 (1994) for large random square (symmetric) matrices. A computationally feasible algorithm for approximately decoding received signals based on the integral formula is also provided.<|reference_end|> | 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},
primaryClass={cs.IT cond-mat.dis-nn math.IT}
} | 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 observations are subject to errors. A simple structure of the myopic policy is established under a certain condition on the false alarm probability of the channel state detector. It is shown that the myopic policy has a semi-universal structure that reduces channel selection to a simple round-robin procedure and obviates the need to know the underlying Markov transition probabilities. The optimality of the myopic policy is proved for the case of two channels and conjectured for the general case based on numerical examples.<|reference_end|> | 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 outer bounds for this region. These bounds are shown to coincide, and hence yield the capacity region, of FS-MACs where the state process is stationary and ergodic and not affected by the inputs, and for indecomposable FS-MAC when feedback is not allowed. Though the capacity region is `multi-letter' in general, our results yield explicit conclusions when applied to specific scenarios of interest.<|reference_end|> | 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 math.IT}
} | 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 defined Finonomial coefficients and derived a recurrence for them (see Historical Note in \cite{2,3}). Here we inform that a join combinatorial interpretation was found \cite{4} for all binomial-type coefficient - Fibonomial coefficients included.<|reference_end|> | 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},
primaryClass={math.CO cs.DM math-ph math.MP}
} | 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 extension so as to encompass the new type combinatorial objects from [2] as leading examples. Recently the present author had introduced also [6] two natural partial orders in there: one $\leq$ in grading-natural subsets of cobweb`s prefabs sets [2] and in the second proposal one endows the set sums of the so called "prefabiants" with such another partial order that one arrives at Bell-like numbers including Fibonacci triad sequences introduced by the present author in [7]. Here we quote the basic observations concerning the new type Stirling like numbers as they appear in [6]. For more on notation, Stirling like numbers of the first kind and for proofs - see [6].<|reference_end|> | 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 natural interpretation of directed information $I(Y^n \to X^n)$ as the amount of information that $Y^n$ \emph{causally} provides about $X^n$. Extensions to stock market portfolio strategies and data compression with causal side information are also discussed.<|reference_end|> | 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 characterized by the fact that two successive random variables cannot take the same value. Using a Markov chain approach, we study the distribution of the maximal ascending run and we develop an algorithm to compute it. This problem comes from the analysis of several self-organizing protocols designed for large-scale wireless sensor networks, and we show how our results apply to this domain.<|reference_end|> | 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.1387},
year={2008},
archivePrefix={arXiv},
eprint={0802.1387},
primaryClass={cs.DM cs.NI math.CO math.PR}
} | 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 probabilistic analysis of this algorithm under some conditions on the probability distributions P(n,k), including stochastic monotonicity and the assumption that roughly a fixed proportion alpha of the players survive in each round. We prove a kind of convergence in distribution for X_n-log_a n, where the basis a=1/alpha; as in many other similar problems there are oscillations and no true limit distribution, but suitable subsequences converge, and there is an absolutely continuous random variable Z such that the distribution of X_n can be approximated by Z+log_a n rounded to the nearest larger integer. Applications of the general result include the leader election algorithm where players are eliminated by independent coin tosses and a variation of the leader election algorithm proposed by W.R. Franklin. We study the latter algorithm further, including numerical results.<|reference_end|> | 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 including an interpreter that learns from the current conversation therefore representing evolving meta-level Agent's knowledge. When the Agent's interpreter is a nondeterministic one, the dialogues may consist of subsequent refinements of specifications in the form of constraint sets. The paper presents a worked out example of dynamic service generation - such as necessary on Grids - by exploiting STROBE Agents equipped with a nondeterministic interpreter. It shows how enabling dynamic specification of a problem. Then it illustrates how these principles could be effective for other applications. Details of the implementation are not provided here, but are available.<|reference_end|> | 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 - RFIA'04, Toulouse : France (2004)},
year={2008},
archivePrefix={arXiv},
eprint={0802.1393},
primaryClass={cs.MA cs.AI}
} | 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 and may produce local minima, extreme learning machine require setting of one parameter and produce a unique solution. ETM+ multispectral data set (England) was used to judge the suitability of extreme learning machine for remote sensing classifications. A back propagation neural network was used to compare its performance in term of classification accuracy and computational cost. Results suggest that the extreme learning machine perform equally well to back propagation neural network in term of classification accuracy with this data set. The computational cost using extreme learning machine is very small in comparison to back propagation neural network.<|reference_end|> | 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 symbols of $P$ and the symbols of substrings of $T$ of length $m$ for all possible offsets. We present an $\epsilon$-approximation algorithm for this problem which runs in time $O(\frac{1}{\epsilon^2}n\cdot \mathrm{polylog}(n,\abs{\Sigma}))$<|reference_end|> | 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 approaches to CF are shown to be special cases. However, unlike existing regularization based CF methods, our approach can be used to also incorporate information such as attributes of the users or the objects -- a limitation of existing regularization based CF methods. We then provide novel representer theorems that we use to develop new estimation methods. We provide learning algorithms based on low-rank decompositions, and test them on a standard CF dataset. The experiments indicate the advantages of generalizing the existing regularization based CF methods to incorporate related information about users and objects. Finally, we show that certain multi-task learning methods can be also seen as special cases of our proposed approach.<|reference_end|> | 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},
archivePrefix={arXiv},
eprint={0802.1430},
primaryClass={cs.LG}
} | 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 recognition, speech synthesis, or information extraction system. We present a generalization of the composition of weighted transducers, 3-way composition, which is dramatically faster in practice than the standard composition algorithm when combining more than two transducers. The worst-case complexity of our algorithm for composing three transducers $T_1$, $T_2$, and $T_3$ resulting in $T$, \ignore{depending on the strategy used, is $O(|T|_Q d(T_1) d(T_3) + |T|_E)$ or $(|T|_Q d(T_2) + |T|_E)$,} is $O(|T|_Q \min(d(T_1) d(T_3), d(T_2)) + |T|_E)$, where $|\cdot|_Q$ denotes the number of states, $|\cdot|_E$ the number of transitions, and $d(\cdot)$ the maximum out-degree. As in regular composition, the use of perfect hashing requires a pre-processing step with linear-time expected complexity in the size of the input transducers. In many cases, this approach significantly improves on the complexity of standard composition. Our algorithm also leads to a dramatically faster composition in practice. Furthermore, standard composition can be obtained as a special case of our algorithm. We report the results of several experiments demonstrating this improvement. These theoretical and empirical improvements significantly enhance performance in the applications already mentioned.<|reference_end|> | 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 of errors. This new model is the common generalization of (static) data structures and locally decodable error-correcting codes. The main issue is the tradeoff between the space used by the data structure and the time (number of probes) needed to answer a query about the encoded object. We prove a number of upper and lower bounds on various natural error-correcting data structure problems. In particular, we show that the optimal length of error-correcting data structures for the Membership problem (where we want to store subsets of size s from a universe of size n) is closely related to the optimal length of locally decodable codes for s-bit strings.<|reference_end|> | 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 algorithm for constructing a committee solution of an inconsistent plane system of linear inequalities is given. A solution of two problems on minimal committee of a plane system is proposed. The obtained solutions to these problems can be found by means of the proposed algorithm.<|reference_end|> | 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},
primaryClass={cs.DM cs.CG}
} | 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 code with a good joint spectrum, so the main task in this paper is to construct linear codes with good joint spectra. First, the code-spectrum approach is developed further to facilitate the calculation of spectra. Second, some general principles for constructing good linear codes are presented. Finally, we propose an explicit construction of linear codes with good joint spectra based on low density parity check (LDPC) codes and low density generator matrix (LDGM) codes.<|reference_end|> | 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.IT}
} | 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. Both lossless and lossy universal complementary delivery coding schemes are investigated. In the lossless case, it is demonstrated that a universal complementary delivery code can be constructed by only combining two Slepian-Wolf codes. Especially, it is shown that a universal lossless complementary delivery code, for which error probability is exponentially tight, can be constructed from two linear Slepian-Wolf codes. In the lossy case, a universal complementary delivery coding scheme based on Wyner-Ziv codes is proposed. While the proposed scheme cannot attain the optimal rate-distortion trade-off in general, the rate-loss is upper bounded by a universal constant under some mild conditions. The proposed schemes allows us to apply any Slepian-Wolf and Wyner-Ziv codes to complementary delivery coding.<|reference_end|> | 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 math.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 instruction sequence fragments can produce a joint behaviour. We also show that, even in the case of this simple mechanism, it is a non-trivial matter to explain by means of a translation into a single instruction sequence what takes place on execution of a collection of instruction sequence fragments.<|reference_end|> | 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},
archivePrefix={arXiv},
eprint={0802.1578},
primaryClass={cs.PL}
} | 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 than the Unified Modelling Language (UML).<|reference_end|> | 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 partial indifference to other agents' identities as in anonymous games, which occur in many natural settings. This is achieved by specifying a graph on the set of actions, so that the payoff of an agent for selecting a strategy depends only on the number of agents playing each of the neighboring strategies in the action graph. We present a Polynomial Time Approximation Scheme for computing mixed Nash equilibria of AGGs with constant treewidth and a constant number of agent types (and an arbitrary number of strategies), together with hardness results for the cases when either the treewidth or the number of agent types is unconstrained. In particular, we show that even if the action graph is a tree, but the number of agent-types is unconstrained, it is NP-complete to decide the existence of a pure-strategy Nash equilibrium and PPAD-complete to compute a mixed Nash equilibrium (even an approximate one); similarly for symmetric AGGs (all agents belong to a single type), if we allow arbitrary treewidth. These hardness results suggest that, in some sense, our PTAS is as strong of a positive result as one can expect.<|reference_end|> | 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={cs.GT cs.MA}
} | 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 of the theory known for polyhedral surfaces. The main difference is that the conformal ratios that appear are no longer real in general. It yields a generalization of the standard Laplacian on weighted graphs.<|reference_end|> | 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 (2008)},
year={2008},
archivePrefix={arXiv},
eprint={0802.1617},
primaryClass={cs.CG cs.GR math.CV}
} | 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 concrete realizations of this general idea, and in particular, we describe several zero-knowledge authentication schemes where forgery (a.k.a. impersonation) is NP-hard. Computationally hard problems that can be employed in these realizations include (Sub)graph Isomorphism, Graph Colorability, Diophantine Problem, and many others.<|reference_end|> | 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},
primaryClass={cs.CR}
} | 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 variants with various restrictions, including the following: the uniform case, when all items have the same weight, the decremental sets, when all items are present at the beginning and only deletion operations are allowed, and dynamic queues, where the dynamic set is ordered and only its prefixes can be deleted (with no restriction on insertions). The dynamic queue case is a generalization of bounded-delay packet scheduling (also referred to as buffer management). We present several upper and lower bounds on the competitive ratio for these variants.<|reference_end|> | 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={0802.1685},
primaryClass={cs.DS}
} | 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 representative for the purpose case of extended umbral calculus. The central importance of such a type formulas is beyond any doubt. Recent publications do confirm this historically established experience. Its links via umbrality to combinatorics are known at least since Rota and Mullin source papers then up to recently extended by many authors to be indicated in the sequel.<|reference_end|> | 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},
primaryClass={math.CO cs.DM}
} | 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 numbers triangular array are then calculated and the explicit formula for them is provided. Next, in the second construction we endow the set sums of prefabiants with such an another partial order that their Bell like numbers include Fibonacci triad sequences introduced recently by the present author in order to extend famous relation between binomial Newton coefficients and Fibonacci numbers onto the infinity of their relatives among whom there are also the Fibonacci triad sequences and binomial like coefficients (incidence coefficients included). The first partial order is F sequence independent while the second partial order is F sequence dependent where F is the so called admissible sequence determining cobweb poset by construction. An F determined cobweb posets Hasse diagram becomes Fibonacci tree sheathed with specific cobweb if the sequence F is chosen to be just the Fibonacci sequence. From the stand-point of linear algebra of formal series these are generating functions which stay for the so called extended coherent states of quantum physics. This information is delivered in the last section.<|reference_end|> | 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},
eprint={0802.1696},
primaryClass={math.CO cs.DM}
} | 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_end|> | 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 as few sets of the family as possible. The variations of covering problems include well known problems like Set Cover, Vertex Cover, Dominating Set and Facility Location to name a few. Recently there has been a lot of study on partial covering problems, a natural generalization of covering problems. Here, the goal is not to cover all the elements but to cover the specified number of elements with the minimum number of sets. In this paper we study partial covering problems in graphs in the realm of parameterized complexity. Classical (non-partial) version of all these problems have been intensively studied in planar graphs and in graphs excluding a fixed graph $H$ as a minor. However, the techniques developed for parameterized version of non-partial covering problems cannot be applied directly to their partial counterparts. The approach we use, to show that various partial covering problems are fixed parameter tractable on planar graphs, graphs of bounded local treewidth and graph excluding some graph as a minor, is quite different from previously known techniques. The main idea behind our approach is the concept of implicit branching. We find implicit branching technique to be interesting on its own and believe that it can be used for some other problems.<|reference_end|> | 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 measurements of text are proposed as a way of representing documents which are akin to physical measurements on quantum states. Consequently, the representation of the text is only known after measurements have been made, and because the process of measuring may destroy parts of the text, the document is characterised through erasure. The mathematical foundations of such a quantum representation of text are provided in this position paper as a starting point for indexing and retrieval within a ``quantum like'' Information Retrieval system.<|reference_end|> | 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},
year={2008},
archivePrefix={arXiv},
eprint={0802.1738},
primaryClass={cs.IR quant-ph}
} | 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 channel with stochastic arrivals and full feedback, but the proposed scheme is potentially applicable to more general lossy networks with link-by-link feedback. The algorithm guarantees that the physical queue size at the sender tracks the backlog in degrees of freedom (also called the virtual queue size). The new notion of a node "seeing" a packet is introduced. In terms of this idea, our algorithm may be viewed as a natural extension of ARQ schemes to coded networks. Our approach, known as the drop-when-seen algorithm, is compared with a baseline queuing approach called drop-when-decoded. It is shown that the expected queue size for our approach is $O(\frac1{1-\rho})$ as opposed to $\Omega(\frac1{(1-\rho)^2})$ for the baseline approach, where $\rho$ is the load factor.<|reference_end|> | 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 math.IT}
} | 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 (MIMO) channels. After that, we compare the performances of proposed algorithm, QR decomposition M-algorithm (QRD-MLD), and its improvement. When the list size is set to achieve the almost same symbol error rate (SER) as the QRD-MLD, the proposed algorithm has smaller average computational complexity.<|reference_end|> | 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},
doi={10.1109/ISIT.2008.4595344},
archivePrefix={arXiv},
eprint={0802.1785},
primaryClass={cs.IT math.IT}
} | 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, and how F is embedded in E. The kernel Ker(P) of a program P that solves (E, F) consists of those strings in the logogram that are used by P. There are relations between Ker(P) and the complexity of P. We develop an application to SAT that relies upon a property of internal independence of SAT. We show that SAT cannot have in its logogram strings serving as collective certificates. As consequence, all programs that solve SAT have same kernel.<|reference_end|> | 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 improving the one in [10]. Moreover, for d>3, we give a lower bound on maximal size of constant-composition codes. In particular, our bound for d=5 gives the best possible size of constant-composition codes up to magnitude.<|reference_end|> | 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 that are met in these problems, starting from basic concepts. We also discuss how statistical mechanics methods can be used to investigate the behavior of local search and decimation based algorithms.<|reference_end|> | 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 "Frontiers in Artificial Intelligence and
Applications"},
year={2008},
archivePrefix={arXiv},
eprint={0802.1829},
primaryClass={cs.CC}
} | 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 logics: Many important subclasses of modal logics can be obtained by restricting the allowed models with first-order Horn formulas. We show that the satisfiability problem for each of these logics is either NP-complete or PSPACE-hard, and exhibit a simple classification criterion. Further, we prove matching PSPACE upper bounds for many of the PSPACE-hard logics.<|reference_end|> | 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 the well-studied two-hop network: K-Parallel-Path (KPP) networks and layered networks. KPP networks can be viewed as the union of K node-disjoint parallel relaying paths, each of length greater than one. KPP networks are then generalized to KPP(I) networks, which permit interference between paths and to KPP(D) networks, which possess a direct link from source to sink. We characterize the DMT of these families of networks completely for K > 3. Layered networks are networks comprising of relaying layers with edges existing only within the same layer or between adjacent layers. We prove that a linear DMT between the maximum diversity d_{max} and the maximum multiplexing gain of 1 is achievable for fully-connected layered networks. This is shown to be equal to the optimal DMT if the number of layers is less than 4. For multi-antenna KPP and layered networks, we provide an achievable DMT region. For arbitrary ss-ss single-antenna directed-acyclic full-duplex networks, we prove that a linear tradeoff between maximum diversity and maximum multiplexing gain is achievable. All protocols in this paper are explicit and use only amplify and forward (AF) relaying. We also construct codes with short block-lengths based on cyclic division algebras that achieve the optimal DMT for all the proposed schemes. Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of networks and that simple AF protocols are often sufficient to attain the optimal DMT.<|reference_end|> | 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},
primaryClass={cs.IT math.IT}
} | 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 characterization of a network is the diversity, whereas a first-order indicator for the ergodic capacity is the degrees of freedom (DOF), which is the pre-log coefficient in the capacity expression. In this paper, we present max-flow min-cut type theorems for computing both the diversity and the degrees of freedom of arbitrary single-source single-sink multi-antenna networks. We also show that an amplify-and-forward protocol is sufficient to achieve this. The degrees of freedom characterization is obtained using a conversion to a deterministic wireless network for which the capacity was recently found. We show that the diversity result easily extends to multi-source multi-sink networks and evaluate the DOF for multi-casting in single-source multi-sink networks.<|reference_end|> | 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 the particular keyword(s) that ad is associated with. Starting with a very natural setting for strategies available to the advertisers, and via a careful look through the algorithmic lens, we first propose solution concepts for the game originating from the strategic behavior of advertisers as they try to optimize their budget allocation across various keywords. Next, we consider two broad match scenarios based on factors such as information asymmetry between advertisers and the auctioneer, and the extent of auctioneer's control on the budget splitting. In the first scenario, the advertisers have the full information about broad match and relevant parameters, and can reapportion their own budgets to utilize the extra information; in particular, the auctioneer has no direct control over budget splitting. We show that, the same broad match may lead to different equilibria, one leading to a revenue improvement, whereas another to a revenue loss. This leaves the auctioneer in a dilemma - whether to broad-match or not. This motivates us to consider another broad match scenario, where the advertisers have information only about the current scenario, and the allocation of the budgets unspent in the current scenario is in the control of the auctioneer. We observe that the auctioneer can always improve his revenue by judiciously using broad match. Thus, information seems to be a double-edged sword for the auctioneer.<|reference_end|> | 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 handle the conflict between objectives and constraints that typically occurs in such problems. In order to overcome this, successful implementations frequently make use of problem specific knowledge. This paper is concerned with the development of a GA for a nurse rostering problem at a major UK hospital. The structure of the constraints is used as the basis for a co-evolutionary strategy using co-operating sub-populations. Problem specific knowledge is also used to define a system of incentives and disincentives, and a complementary mutation operator. Empirical results based on 52 weeks of live data show how these features are able to improve an unsuccessful canonical GA to the point where it is able to provide a practical solution to the problem<|reference_end|> | 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-JOS41>3.0.CO;2-2},
archivePrefix={arXiv},
eprint={0802.2001},
primaryClass={cs.NE cs.CE}
} | 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-end delay of this scheme turns out to be significantly larger than those of multihop schemes. A modification of the scheme is proposed here that achieves a throughput-delay trade-off $D(n)=(\log n)^2 T(n)$ for T(n) between $\Theta(\sqrt{n}/\log n)$ and $\Theta(n/\log n)$, where D(n) and T(n) are respectively the average delay per bit and the aggregate throughput in a network of n nodes. This trade-off complements the previous results of El Gamal et al., which show that the throughput-delay trade-off for multihop schemes is given by D(n)=T(n) where T(n) lies between $\Theta(1)$ and $\Theta(\sqrt{n})$. Meanwhile, the present paper considers the network multiple-access problem, which may be of interest in its own right.<|reference_end|> | 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={0802.2013},
primaryClass={cs.IT math.IT}
} | 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 according to the model. We cast many existing models as HMMs and recover the best known running times in each case. We also describe two new models: the switch distribution, which was recently developed to improve Bayesian/Minimum Description Length model selection, and a new generalisation of the fixed share algorithm based on run-length coding. We give loss bounds for all models and shed new light on their relationships.<|reference_end|> | 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) has been established as a major model of computation. This real realm has turned out to exhibit natural counterparts to many notions and results in classical complexity and recursion theory; although usually with considerably different proofs. The present work investigates similarities and differences between discrete and real Kolmogorov Complexity as introduced by Montana and Pardo (1998).<|reference_end|> | 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 affine space $AG(n,q)$ is the complement of the line at infinity in $PG(n,q)$. Then $AG(n,q)$ can be regarded as the complement of an hyperplane arrangement in $PG(n,q)$! Therefore the study of blocking sets in the affine space $AG(n,q)$ is simply the study of blocking sets in the complement of a finite arrangement in $PG(n,q)$. In this paper the author generalizes this remark starting to study the problem of existence of blocking sets in the complement of a given hyperplane arrangement in $PG(n,q)$. As an example she solves the problem for the case of braid arrangement. Moreover she poses significant questions on this new and interesting problem.<|reference_end|> | 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 relationships to Delaunay and minmax angle triangulations. We present an iterative algorithm that seeks to transform a given triangulation in two or three dimensions into a well-centered one by minimizing a cost function and moving the interior vertices while keeping the mesh connectivity and boundary vertices fixed. The cost function is a direct result of a new characterization of well-centeredness in arbitrary dimensions that we present. Ours is the first optimization-based heuristic for well-centeredness, and the first one that applies in both two and three dimensions. We show the results of applying our algorithm to small and large two-dimensional meshes, some with a complex boundary, and obtain a well-centered tetrahedralization of the cube. We also show numerical evidence that our algorithm preserves gradation and that it improves the maximum and minimum angles of acute triangulations created by the best known previous method.<|reference_end|> | 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},
eprint={0802.2108},
primaryClass={cs.CG cs.NA}
} | 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 user password change, etc. We show that Liaw et al.'s scheme is completely insecure. By intercepting a valid login message in Liaw et al.'s scheme, any unregistered user or adversary can easily login to the remote system and establish a session key.<|reference_end|> | 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 allocation across carriers. In this paper we show that such a separation does not apply to parallel Gaussian interference channels in general. A counter-example is provided in the form of a 3 user interference channel where separate encoding can only achieve a sum capacity of $\log({SNR})+o(\log({SNR}))$ per carrier while the actual capacity, achieved only by joint-encoding across carriers, is $3/2\log({SNR}))+o(\log({SNR}))$ per carrier. As a byproduct of our analysis, we propose a class of multiple-access-outerbounds on the capacity of the 3 user interference channel.<|reference_end|> | 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.2008.ECP.904},
archivePrefix={arXiv},
eprint={0802.2125},
primaryClass={cs.IT math.IT}
} | 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, which I attribute to the use of advanced calculi and the intensified research in implementation techniques. However, nowadays we are witnessing a slowdown in performance progress, which may be considered as a sign that the saturation-based technology is reaching its inherent limits. The position I am trying to put forward in this paper is that such scepticism is premature and a sharp improvement in performance may potentially be reached by adopting new architectural principles for saturation. The top-level algorithms and corresponding designs used in the state-of-the-art saturation-based theorem provers have (at least) two inherent drawbacks: the insufficient flexibility of the used inference selection mechanisms and the lack of means for intelligent prioritising of search directions. In this position paper I analyse these drawbacks and present two ideas on how they could be overcome. In particular, I propose a flexible low-cost high-precision mechanism for inference selection, intended to overcome problems associated with the currently used instances of clause selection-based procedures. I also outline a method for intelligent prioritising of search directions, based on probing the search space by exploring generalised search directions. I discuss some technical issues related to implementation of the proposed architectural principles and outline possible solutions.<|reference_end|> | 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) problem. For $\ell=1$, this is the \textsc{Dominating Set} problem, and for $\ell\geq n-1$, this is the PDS problem; here $n$ denotes the number of nodes in the input graph. In PDS the goal is to find a minimum size set of nodes $S$ that power dominates all the nodes, where a node $v$ is power dominated if (1) $v$ is in $S$ or it has a neighbor in $S$, or (2) $v$ has a neighbor $u$ such that $u$ and all of its neighbors except $v$ are power dominated. Note that rule (1) is the same as for the \textsc{Dominating Set} problem, and that rule (2) is a type of propagation rule that applies iteratively. The $\ell$-round PDS problem has the same set of rules as PDS, except we apply rule (2) in ``parallel'' in at most $\ell-1$ rounds. We prove that $\ell$-round PDS cannot be approximated better than $2^{\log^{1-\epsilon}{n}}$ even for $\ell=4$ in general graphs. We provide a dynamic programming algorithm to solve $\ell$-round PDS optimally in polynomial time on graphs of bounded tree-width. We present a PTAS (polynomial time approximation scheme) for $\ell$-round PDS on planar graphs for $\ell=O(\tfrac{\log{n}}{\log{\log{n}}})$. Finally, we give integer programming formulations for $\ell$-round PDS.<|reference_end|> | 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 transmission radii which minimize the maximum interference while maintaining a connected symmetric communication graph is NP-complete.<|reference_end|> | 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 which multi-class SVMs are compared with maximum likelihood and artificial neural network methods in terms of classification accuracy. Our results show that the SVM achieves a higher level of classification accuracy than either the maximum likelihood or the neural classifier, and that the support vector machine can be used with small training datasets and high-dimensional data.<|reference_end|> | 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 every 2-choosable graph is also $(4:2)$-choosable. Applying probabilistic methods, an upper bound for the $k^{th}$ choice number of a graph is given. We also prove that a directed graph with maximum outdegree $d$ and no odd directed cycle is $(k(d+1):k)$-choosable for every $k \geq 1$. Other results presented in this article are related to the strong choice number of graphs (a generalization of the strong chromatic number). We conclude with complexity analysis of some decision problems related to graph choosability.<|reference_end|> | 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 dimension. Some numeric experiment designs are conceived in this sense as Latin hypercubes or orthogonal arrays, but they consider only the projections onto the axes or the coordinate planes. In this article we introduce a statistic which allows studying the good distribution of points according to all 1-dimensional projections. By angularly scanning the domain, we obtain a radar type representation, allowing the uniformity defects of a design to be identified with respect to its projections onto straight lines. The advantages of this new tool are demonstrated on usual examples of space-filling designs (SFD) and a global statistic independent of the angle of rotation is studied.<|reference_end|> | 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},
eprint={0802.2158},
primaryClass={cs.LG math.ST stat.TH}
} | 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 constructed. This algorithm is applied to study the gains resulting from the cooperation among single antenna transmitters for virtual MIMO formation. The aim is to find an ultimate transmitters coalition structure that allows cooperating users to maximize their utilities while accounting for the cost of coalition formation. Through this novel game theoretical framework, the wireless network transmitters are able to self-organize and form a structured network composed of disjoint stable coalitions. Simulation results show that the proposed algorithm can improve the average individual user utility by 26.4% as well as cope with the mobility of the distributed users.<|reference_end|> | 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},
eprint={0802.2159},
primaryClass={cs.IT cs.GT math.IT}
} | 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 semigroups of genus $g$ satisfies $2F_{g}\leq n_g\leq 1+3\cdot 2^{g-3}$, where $F_g$ denotes the $g$th Fibonacci number.<|reference_end|> | 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 included in one of the S_i. The problem involves maximizing the mean subset size of the partition, where the mean is the generalized mean of parameter p, taken over the elements. For p=-1, the problem is equivalent to the classical minimum set cover problem. For p=0, it is equivalent to the minimum entropy set cover problem, introduced by Halperin and Karp. For p=1, the problem includes the maximum-edge clique partition problem as a special case. We prove that the greedy algorithm simultaneously approximates the problem within a factor of (p+1)^1/p for any p in R^+, and that this is the best possible unless P=NP. These results both generalize and simplify previous results for special cases. We also consider the corresponding graph coloring problem, and prove several tractability and inapproximability results. Finally, we consider a further generalization of the set cover problem in which we aim at minimizing the sum of some concave function of the part sizes. As an application, we derive an approximation ratio for a Rent-or-Buy set cover problem.<|reference_end|> | 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 increasing reading time, resulting in high data losses, especially for older adults or reading impaired subjects. We present a method, based on the symbolic sequence dynamics of the eye movements, that reconstructs the horizontal position of the eyes while the reader blinks. The method makes use of an observed fact that the movements of the eyes before closing or after opening contain information about the eyes movements during blinks. Test results indicate that our reconstruction method is superior to methods that use simpler interpolation approaches. In addition, analyses of the reconstructed data show no significant deviation from the usual behavior observed in readers.<|reference_end|> | 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 such as path- or tree-width. Of particular interest is the question whether these games are monotone, i.e. whether the cops can catch a robber without ever allowing the robber to reach positions that have been cleared before. The monotonicity problem for graph searching games has intensely been studied in the literature, but for two types of games the problem was left unresolved. These are the games on digraphs where the robber is invisible and lazy or visible and fast. In this paper, we solve the problems by giving examples showing that both types of games are non-monotone. Graph searching games on digraphs are closely related to recent proposals for digraph decompositions generalising tree-width to directed graphs. These proposals have partly been motivated by attempts to develop a structure theory for digraphs similar to the graph minor theory developed by Robertson and Seymour for undirected graphs, and partly by the immense number of algorithmic results using tree-width of undirected graphs and the hope that part of this success might be reproducible on digraphs using a directed tree-width. Unfortunately the number of applications for the digraphs measures introduced so far is still small. We therefore explore the limits of the algorithmic applicability of digraph decompositions. In particular, we show that various natural candidates for problems that might benefit from digraphs having small directed tree-width remain NP-complete even on almost acyclic graphs.<|reference_end|> | 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 to the specific behavior of an author. But the question on how to appropriately represent a text is still one of the fundamental tasks, and the problem of which attribute should be used to fingerprint the author's style is still not exactly defined. In this work, we focus on linguistic selection of attributes to fingerprint the style of the authors Parkin, Bassewitz and Leander. We use texts of the genre Fairy Tale as it has a clear style and texts of a shorter size with a straightforward story-line and a simple language.<|reference_end|> | 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 represented in Alloy and checked against our specification in order to know if these are valid under the Discovery notation.<|reference_end|> | 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,
(Mexico, 2005), IEEE, 121-128},
year={2008},
doi={10.1109/ENC.2005.52},
archivePrefix={arXiv},
eprint={0802.2258},
primaryClass={cs.SE cs.SC}
} | 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 predicate $P$ is approximation resistant if there exists a balanced pairwise independent distribution over $[q]^k$ whose support is contained in the set of satisfying assignments to $P$.<|reference_end|> | 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 using a simple counter. Compressed Counting (CC) is proposed for efficiently computing the pth frequency moment of a data stream signal A_t, where 0<p<=2. CC is applicable if the streaming data follow the Turnstile model, with the restriction that at the time t for the evaluation, A_t[i]>= 0, which includes the strict Turnstile model as a special case. For natural data streams encountered in practice, this restriction is minor. The underly technique for CC is what we call skewed stable random projections, which captures the intuition that, when p=1 a simple counter suffices, and when p = 1+/\Delta with small \Delta, the sample complexity of a counter system should be low (continuously as a function of \Delta). We show at small \Delta the sample complexity (number of projections) k = O(1/\epsilon) instead of O(1/\epsilon^2). Compressed Counting can serve a basic building block for other tasks in statistics and computing, for example, estimation entropies of data streams, parameter estimations using the method of moments and maximum likelihood. Finally, another contribution is an algorithm for approximating the logarithmic norm, \sum_{i=1}^D\log A_t[i], and logarithmic distance. The logarithmic distance is useful in machine learning practice with heavy-tailed data.<|reference_end|> | 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-law distribution and the latter an exponential distribution. This effect appears to be independent of application or type relationship. A simple generative model is proposed to explore the proposition that the difference arises because the programmer is aware of the out-degree of a type but not of its in-degree. The model reproduces the two distributions, and compares reasonably well to those observed in 14 different type relationships across 12 different Java applications.<|reference_end|> | 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 photo publication website Flickr, showing the variety of uses producing a rich content and the various procedures devised by Flickr users themselves to select quality. We underlined the interaction between small and heavy users as a specific form of collective production in large social networks communities. We also give the main statistics on the (5M-users, 150M-photos) data basis we worked on for this study, collected from Flickr website using the public API.<|reference_end|> | 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.2317},
primaryClass={cs.CY}
} | 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-static fading channels and demonstrates that non-iterative schemes can also be characterized by a similar threshold based on which their frame error rate can be readily estimated. In particular, we show that this threshold is a function of the probability of successful frame detection in additive white Gaussian noise, normalized by the squared instantaneous signal-to-noise ratio. We apply our approach to uncoded binary phase shift keying, convolutional coding and turbo coding and demonstrate that the approximated frame error rate is within 0.4 dB of the simulation results. Finally, we introduce performance evaluation plots to explore the impact of the frame size on the performance of the schemes under investigation.<|reference_end|> | 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={arXiv},
eprint={0802.2345},
primaryClass={cs.IT math.IT}
} | 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 varieties, including Hermitian hypersurfaces, Grassmannians, flag varieties, ruled surfaces over curves, and Deligne-Lusztig varieties are considered. Connections with the theories of toric codes and order domains are also briefly indicated.<|reference_end|> | 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 new objective captures the problem of how to deploy relays to provide a given level of service to a particular geographic area, where the relay locations become a design parameter that can be optimized. We evaluate the decode and forward (DF) and compress and forward (CF) strategies for the relay channel with respect to the new objective of maximizing coverage. When the objective is maximizing rate, different locations of the destination favor different strategies. When the objective is coverage for a given rate, and the relay is able to decode, DF is uniformly superior in that it provides coverage at any point served by CF. When the channel model is modified to include random fading, we show that the monotone ordering of coverage regions is not always maintained. While the coverage provided by DF is sensitive to changes in the location of the relay and the path loss exponent, CF exhibits a more graceful degradation with respect to such changes. The techniques used to approximate coverage regions are new and may be of independent interest.<|reference_end|> | 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={arXiv},
eprint={0802.2360},
primaryClass={cs.IT math.IT}
} | 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 number of factors that can be extracted from a given tensor. We explain in this short paper how to obtain numerically the generic rank of tensors of arbitrary dimensions, and compare it with the rare algebraic results already known at order three. In particular, we examine the cases of symmetric tensors, tensors with symmetric matrix slices, or tensors with free entries.<|reference_end|> | 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 the simplification of the process of formal deduction. $\Sigma-$composition of terms is defined as replacement between $\Sigma$-equal terms. This composition induces $\Sigma R-$deductively closed sets of identities. In analogy to balanced identities we introduce and investigate $\Sigma-$balanced identities for a given set of identities $\Sigma$.<|reference_end|> | 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 sensing land cover classification. A number of methods have been proposed to implement SVMs to produce multiclass classification. A number of methods to generate multiclass SVMs from binary SVMs have been proposed by researchers and is still a continuing research topic. This paper compares the performance of six multi-class approaches to solve classification problem with remote sensing data in term of classification accuracy and computational cost. One vs. one, one vs. rest, Directed Acyclic Graph (DAG), and Error Corrected Output Coding (ECOC) based multiclass approaches creates many binary classifiers and combines their results to determine the class label of a test pixel. Another catogery of multi class approach modify the binary class objective function and allows simultaneous computation of multiclass classification by solving a single optimisation problem. Results from this study conclude the usefulness of One vs. One multi class approach in term of accuracy and computational cost over other multi class approaches.<|reference_end|> | 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 increasing use of distributed computing to handle large, computationally intensive tasks. In the SUU problem we are given n unit-length jobs and m machines, a directed acyclic graph G of precedence constraints among jobs, and unrelated failure probabilities q_{ij} for each job j when executed on machine i for a single timestep. Our goal is to find a schedule that minimizes the expected makespan, which is the expected time at which all jobs complete. Lin and Rajaraman gave the first approximations for this NP-hard problem for the special cases of independent jobs, precedence constraints forming disjoint chains, and precedence constraints forming trees. In this paper, we present asymptotically better approximation algorithms. In particular, we give an O(loglog min(m,n))-approximation for independent jobs (improving on the previously best O(log n)-approximation). We also give an O(log(n+m) loglog min(m,n))-approximation algorithm for precedence constraints that form disjoint chains (improving on the previously best O(log(n)log(m)log(n+m)/loglog(n+m))-approximation by a (log n/loglog n)^2 factor when n = poly(m). Our algorithm for precedence constraints forming chains can also be used as a component for precedence constraints forming trees, yielding a similar improvement over the previously best algorithms for trees.<|reference_end|> | 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},
eprint={0802.2418},
primaryClass={cs.DC cs.DS}
} | 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 given to the user. The system is able to recognize complex signs that involve both hand gestures and head movements and expressions. Our performance tests yield a 99% recognition rate on signs involving only manual gestures and 85% recognition rate on signs that involve both manual and non manual components, such as head movement and facial expressions.<|reference_end|> | 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:0802.2428},
year={2008},
archivePrefix={arXiv},
eprint={0802.2428},
primaryClass={cs.LG cs.HC}
} | 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 rectangular grid shapes solution according to the selective pressure: we can obtain the same takeover time with the two techniques although the spreading of the best individual is different. We then give experimental results that show to what extent AS promotes the emergence of niches that support low coupling and high cohesion. Finally, using a cGA with anisotropic selection on a Quadratic Assignment Problem we show the existence of an anisotropic optimal value for which the best average performance is observed. Further work will focus on the selective pressure self-adjustment ability provided by this new selection scheme.<|reference_end|> | 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 And Evolutionary Computation Conference,
Seatle : \'Etats-Unis d'Am\'erique (2006)},
year={2008},
doi={10.1145/1143997.1144098},
archivePrefix={arXiv},
eprint={0802.2429},
primaryClass={cs.AI}
} | 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 construction of an aperiodic tile set that is based on Kleene's fixed-point construction instead of geometric arguments. This construction is similar to J. von Neumann self-reproducing automata; similar ideas were also used by P. Gacs in the context of error-correcting computations. The flexibility of this construction allows us to construct a "robust" aperiodic tile set that does not have periodic (or close to periodic) tilings even if we allow some (sparse enough) tiling errors. This property was not known for any of the existing aperiodic tile sets.<|reference_end|> | 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},
archivePrefix={arXiv},
eprint={0802.2432},
primaryClass={cs.CC cs.DM}
} | 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 shown that the capacity--if well-defined--can be determined from the radius of convergence of its generating function, from the smallest positive pole of its generating function, or from the rightmost real singularity of its complex generating function. A generalisation is given for Pringsheim's Theorem and for the Exponential Growth Formula to generating functions of combinatorial structures with non-integer valued symbol weights.<|reference_end|> | 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 math.IT}
} | 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 signal, that is, Ds*W approximately equal to 1, the channel appears to be flat fading. For Ds*W >> 1, the channel appears to be frequency selective, which is usually the case for wideband signals. In the first case, small scale synchronization with a precision much higher than the sampling time T = 1/W is crucial. In this paper, it is shown by analytical means that this is different in the wideband regime. Here synchronization with a precision of T is sufficient and small scale synchronization cannot further increase the captured energy at the receiver. Simulation results show that this effect already occurs for W > 50MHz for the IEEE 802.15.4a channel model.<|reference_end|> | 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},
primaryClass={cs.IT math.IT}
} | 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 specifies a subset S \subseteq V of terminals and the goal is to find a subgraph containing at least k terminals. Closely related to the k-2VC problem, and in fact a special case of it, is the k-2EC problem, in which the goal is to find a minimum-cost 2-edge-connected subgraph containing k vertices. The k-2EC problem was introduced by Lau et al., who also gave a poly-logarithmic approximation for it. No previous approximation algorithm was known for the more general k-2VC problem. We describe an O(\log n \log k) approximation for the k-2VC problem.<|reference_end|> | 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 responsiveness even in such critical situations. Previous solutions fail to meet common performance requirements when the system has to face sudden and unpredictable surges of traffic. Indeed they often rely on a proper setting of key parameters which requires laborious manual tuning, preventing a fast adaptation of the control policies. We contribute an original Self-* Overload Control (SOC) policy. This allows the system to self-configure a dynamic constraint on the rate of admitted sessions in order to respect service level agreements and maximize the resource utilization at the same time. Our policy does not require any prior information on the incoming traffic or manual configuration of key parameters. We ran extensive simulations under a wide range of operating conditions, showing that SOC rapidly adapts to time varying traffic and self-optimizes the resource utilization. It admits as many new sessions as possible in observance of the agreements, even under intense workload variations. We compared our algorithm to previously proposed approaches highlighting a more stable behavior and a better performance.<|reference_end|> | 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={arXiv},
eprint={0802.2543},
primaryClass={cs.NI cs.PF}
} | 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-type) inequalities and Ingleton inequalities. This paper simplifies the characterization of this cone, by obtaining the unique minimal set of Ingleton inequalities. As a result, the effort required for computation of the Ingleton-LP bound can be greatly reduced.<|reference_end|> | 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 wireless ad-hoc and sensor networks (like grids and random geometric graphs), the standard nearest-neighbor gossip converges as slowly as flooding ($O(n^2)$ messages). A recently proposed algorithm called geographic gossip improves gossip efficiency by a $\sqrt{n}$ factor, by exploiting geographic information to enable multi-hop long distance communications. In this paper we prove that a variation of geographic gossip that averages along routed paths, improves efficiency by an additional $\sqrt{n}$ factor and is order optimal ($O(n)$ messages) for grids and random geometric graphs. We develop a general technique (travel agency method) based on Markov chain mixing time inequalities, which can give bounds on the performance of randomized message-passing algorithms operating over various graph topologies.<|reference_end|> | 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 math.PR}
} | 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 cover the interior of the polygon. In this paper we consider the problem of guarding an art gallery which is modeled as a polygon with curvilinear walls. Our main focus is on polygons the edges of which are convex arcs pointing towards the exterior or interior of the polygon (but not both), named piecewise-convex and piecewise-concave polygons. We prove that, in the case of piecewise-convex polygons, if we only allow vertex guards, $\lfloor\frac{4n}{7}\rfloor-1$ guards are sometimes necessary, and $\lfloor\frac{2n}{3}\rfloor$ guards are always sufficient. Moreover, an $O(n\log{}n)$ time and O(n) space algorithm is described that produces a vertex guarding set of size at most $\lfloor\frac{2n}{3}\rfloor$. When we allow point guards the afore-mentioned lower bound drops down to $\lfloor\frac{n}{2}\rfloor$. In the special case of monotone piecewise-convex polygons we can show that $\lfloor\frac{n}{2}\rfloor$ vertex guards are always sufficient and sometimes necessary; these bounds remain valid even if we allow point guards. In the case of piecewise-concave polygons, we show that $2n-4$ point guards are always sufficient and sometimes necessary, whereas it might not be possible to guard such polygons by vertex guards. We conclude with bounds for other types of curvilinear polygons and future work.<|reference_end|> | 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},
eprint={0802.2594},
primaryClass={cs.CG}
} | 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 cs.CC cs.DS math.CO}
} | 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 notion that captures the fact that exploration is only constrained by the number of available rounds (not necessarily known in advance), in contrast to the case when the cumulative regret is considered and when exploitation needs to be performed at the same time. We believe that this performance criterion is suited to situations when the cost of pulling an arm is expressed in terms of resources rather than rewards. We discuss the links between the simple and the cumulative regret. One of the main results in the case of a finite number of arms is a general lower bound on the simple regret of a forecaster in terms of its cumulative regret: the smaller the latter, the larger the former. Keeping this result in mind, we then exhibit upper bounds on the simple regret of some forecasters. The paper ends with a study devoted to continuous-armed bandit problems; we show that the simple regret can be minimized with respect to a family of probability distributions if and only if the cumulative regret can be minimized for it. Based on this equivalence, we are able to prove that the separable metric spaces are exactly the metric spaces on which these regrets can be minimized with respect to the family of all probability distributions with continuous mean-payoff functions.<|reference_end|> | 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},
primaryClass={math.ST cs.LG stat.TH}
} | 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 region, and arbitrary link capacities using LDPC codes. We consider the Slepian-Wolf setting of two sources and one destination, with one of the sources derived from the other source by some correlation model known at the decoder. Distributed encoding and separate decoding is used for the two sources. We also give a distributed source coding scheme when the source correlation has memory to achieve any point in the Slepian-Wolf rate achievable region. In this setting, we perform separate encoding but joint decoding.<|reference_end|> | 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},
eprint={0802.2666},
primaryClass={cs.IT math.IT}
} | 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 given graph is $k$-choosable for some constant $k$. In particular, it is shown that deciding whether a given planar graph is 4-choosable is NP-hard, and so is the problem of deciding whether a given planar triangle-free graph is 3-choosable. We also obtain simple constructions of a planar graph which is not 4-choosable and a planar triangle-free graph which is not 3-choosable.<|reference_end|> | 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 antenna processing techniques at the relays is investigated. The antenna combining techniques are maximum ratio combining (MRC) for reception and transmit beamforming (TB) for transmission. It is shown that these distributed antenna combining techniques can exploit the full spatial diversity of the relay channels regardless of the number of relays and antennas at each relay, and offer significant power gain over distributed space-time coding techniques.<|reference_end|> | 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},
primaryClass={cs.IT math.IT}
} | 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 exists for worms to be opportunistically transmitted between devices as they move around, so human mobility patterns will have an impact on epidemic spread. The scenario we address in this paper is proximity attacks from fleetingly in-contact wireless devices with short-range communication range, such as Bluetooth-enabled smart phones. An individual-based model of mobile devices is introduced and the effect of population characteristics and device behaviour on the outbreak dynamics is investigated. We show through extensive simulations that in the above scenario the resulting mass-action epidemic models remain applicable provided the contact rate is derived consistently from the underlying mobility model. The model gives useful analytical expressions against which more refined simulations of worm spread can be developed and tested.<|reference_end|> | 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={cs.NI cond-mat.stat-mech cs.CR}
} | 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 are discovered and delivered here. The recurrence relation defining arbitrary family of charactristic polynomials of finite cobweb posets is also derived.<|reference_end|> | 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, are investigated for both single message and multiple message authentication scenarios. For each scenario, information theoretic lower and upper bounds on the opponent's success probability are derived. Remarkably, in both scenarios, lower and upper bounds are shown to match, and hence the fundamental limit of message authentication over noisy channels is fully characterized. The opponent's success probability is further shown to be smaller than that derived in the classic authentication model in which the channel is assumed to be noiseless. These results rely on a proposed novel authentication scheme in which key information is used to provide simultaneous protection again both types of attacks.<|reference_end|> | 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 the radio spectrum having multiple bands is first considered. In this scenario, the availability probability of each channel is unknown a priori to the cognitive user. Hence efficient medium access strategies must strike a balance between exploring (learning) the availability probability of the channels and exploiting the knowledge of the availability probability identified thus far. For this scenario, an optimal medium access strategy is derived and its underlying recursive structure is illustrated via examples. To avoid the prohibitive computational complexity of this optimal strategy, a low complexity asymptotically optimal strategy is developed. Next, the multi-cognitive user scenario is considered and low complexity medium access protocols, which strike an optimal balance between exploration and exploitation in such competitive environments, are developed.<|reference_end|> | 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.IT}
} | 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 controllable group code is labeled with Latin squares, a strongly controllable Latin group code, then the shift group is solvable. Moreover the mathematical structure of a Latin square (as a translation net) and the shift group of a strongly controllable Latin group code are closely related. Thus a strongly controllable Latin group code can be viewed as a natural extension of a Latin square to a sequence space. Lastly we construct shift groups. We show that it is sufficient to construct a simpler group, the state group of a shift group. We give an algorithm to find the state group, and from this it is easy to construct a stronlgy controllable Latin group code.<|reference_end|> | 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},
primaryClass={cs.IT math.IT}
} | 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},
archivePrefix={arXiv},
eprint={0802.2736},
primaryClass={cs.CC cs.DM}
} | 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 $\sum_{i=1}^d f(s_i)$ in-trees denoted by $T_{i,1},T_{i,2},..., T_{i,f(s_i)}$ for every $i=1,...,d$ such that $T_{i,1},...,T_{i,f(s_i)}$ are rooted at $s_i$, each $T_{i,j}$ spans vertices from which $s_i$ is reachable and the union of all arc sets of $T_{i,j}$ for $i=1,...,d$ and $j=1,...,f(s_i)$ covers $A$. In this paper, we prove that such set of in-trees covering $A$ can be found by using an algorithm for the weighted matroid intersection problem in time bounded by a polynomial in $\sum_{i=1}^df(s_i)$ and the size of $D$. Furthermore, for the case where $D$ is acyclic, we present another characterization of the existence of in-trees covering $A$, and then we prove that in-trees covering $A$ can be computed more efficiently than the general case by finding maximum matchings in a series of bipartite graphs.<|reference_end|> | 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 the link flexibility by localized 6-d.o.f. virtual springs. In contrast to other works, the method includes a FEA-based link stiffness evaluation and employs a new solution strategy of the kinetostatic equations, which allows computing the stiffness matrix for the overconstrained architectures and for the singular manipulator postures. The advantages of the developed technique are confirmed by application examples, which deal with comparative stiffness analysis of two translational parallel manipulators.<|reference_end|> | 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. Conference on Robotics and Automation, Pasadena : \'Etats-Unis
d'Am\'erique (2008)},
year={2008},
archivePrefix={arXiv},
eprint={0802.2773},
primaryClass={cs.RO physics.class-ph}
} | 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 ordering of computations of automata and on two coverings that can be build by means of this ordering. The complexity of the construction, measured as the number of states of the transducers involved in the decomposition, improves the original one by one exponential. Moreover, this method allows further generalisation that solves the problem of decomposition of rational relations with bounded length-degree, which was left open in Weber's paper.<|reference_end|> | 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={2008},
archivePrefix={arXiv},
eprint={0802.2823},
primaryClass={cs.IT math.IT}
} | 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 paper we improve the upper bound for planar 3-connected graphs to unambiguous logspace, in fact to $UL \cap coUL$. As a consequence of our method we get that the isomorphism problem for oriented graphs is in $NL$. We also show that the problems are hard for $L$.<|reference_end|> | 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)},
year={2008},
archivePrefix={arXiv},
eprint={0802.2825},
primaryClass={cs.DS cs.CC}
} | 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$ is the number of defined transitions, and $\alpha$ is the size of the alphabet. Time consumption does not depend on $\alpha$, because the $\alpha$ term arises from an array that is accessed at random and never initialized. It is not needed, if transitions are in a suitable order in the input. The algorithm uses two instances of an array-based data structure for maintaining a refinable partition. Its operations are all amortized constant time. One instance represents the classical blocks and the other a partition of transitions. Our measurements demonstrate the speed advantage of our algorithm on PT-DFAs over an $O(\alpha n \lg n)$ time, $O(\alpha n)$ memory algorithm.<|reference_end|> | 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},
archivePrefix={arXiv},
eprint={0802.2826},
primaryClass={cs.IT cs.DS math.IT}
} | 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 tool in the design of algorithms. In an iterative process, we can obtain a series of branch and reduce algorithms. A mathematical analysis of an algorithm in the series with measure and conquer results in a quasiconvex programming problem. The solution by computer to this problem not only gives a bound on the running time, but also can give a new reduction rule, thus giving a new, possibly faster algorithm. This makes design by measure and conquer a form of computer aided algorithm design. When we apply the methodology to a Set Cover modelling of the Dominating Set problem, we obtain the currently fastest known exact algorithms for Dominating Set: an algorithm that uses $O(1.5134^n)$ time and polynomial space, and an algorithm that uses $O(1.5063^n)$ time.<|reference_end|> | 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 (2008)},
year={2008},
archivePrefix={arXiv},
eprint={0802.2827},
primaryClass={cs.DS}
} | 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 first one is combinatorial and the other topological. These two approaches have independent merits and, once combined, provide somehow surprising results. The particular case where the set of produced tilings is countable is deeply investigated while we prove that the uncountable case may have a completely different structure. We introduce a pattern preorder and also make use of Cantor-Bendixson rank. Our first main result is that a tile-set that produces only periodic tilings produces only a finite number of them. Our second main result exhibits a tiling with exactly one vector of periodicity in the countable case.<|reference_end|> | 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},
archivePrefix={arXiv},
eprint={0802.2828},
primaryClass={cs.OH}
} | 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 result concerning the linearity of the sum of exponents of all runs follows easily.<|reference_end|> | 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},
archivePrefix={arXiv},
eprint={0802.2829},
primaryClass={cs.DS math.CO}
} | crochemore2008understanding |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.