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-1301 | 0710.0360 | Interpolation in Valiant's theory | <|reference_start|>Interpolation in Valiant's theory: We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit? We argue that this question is certainly difficult. Answering it negatively would in... | arxiv | @article{koiran2007interpolation,
title={Interpolation in Valiant's theory},
author={Pascal Koiran (LIP), Sylvain Perifel (LIP)},
journal={arXiv preprint arXiv:0710.0360},
year={2007},
archivePrefix={arXiv},
eprint={0710.0360},
primaryClass={cs.CC}
} | koiran2007interpolation |
arxiv-1302 | 0710.0386 | Comparing Maintenance Strategies for Overlays | <|reference_start|>Comparing Maintenance Strategies for Overlays: In this paper, we present an analytical tool for understanding the performance of structured overlay networks under churn based on the master-equation approach of physics. We motivate and derive an equation for the average number of hops taken by lookups... | arxiv | @article{krishnamurthy2007comparing,
title={Comparing Maintenance Strategies for Overlays},
author={Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurell and Seif Haridi},
journal={arXiv preprint arXiv:0710.0386},
year={2007},
number={Tech. Report TR-2007-01, Swedish Institute of Computer Science},
... | krishnamurthy2007comparing |
arxiv-1303 | 0710.0410 | The Theory of Unified Relativity for a Biovielectroluminescence Phenomenon via Fly's Visual and Imaging System | <|reference_start|>The Theory of Unified Relativity for a Biovielectroluminescence Phenomenon via Fly's Visual and Imaging System: The elucidation upon fly's neuronal patterns as a link to computer graphics and memory cards I/O's, is investigated for the phenomenon by propounding a unified theory of Einstein's two know... | arxiv | @article{alipour2007the,
title={The Theory of Unified Relativity for a Biovielectroluminescence
Phenomenon via Fly's Visual and Imaging System},
author={Philip B. Alipour},
journal={arXiv preprint arXiv:0710.0410},
year={2007},
archivePrefix={arXiv},
eprint={0710.0410},
primaryClass={cs.CE... | alipour2007the |
arxiv-1304 | 0710.0431 | New Counting Codes for Distributed Video Coding | <|reference_start|>New Counting Codes for Distributed Video Coding: This paper introduces a new counting code. Its design was motivated by distributed video coding where, for decoding, error correction methods are applied to improve predictions. Those error corrections sometimes fail which results in decoded values wor... | arxiv | @article{lakus-becker2007new,
title={New Counting Codes for Distributed Video Coding},
author={Axel Lakus-Becker and Ka-Ming Leung},
journal={arXiv preprint arXiv:0710.0431},
year={2007},
archivePrefix={arXiv},
eprint={0710.0431},
primaryClass={cs.IT math.IT}
} | lakus-becker2007new |
arxiv-1305 | 0710.0485 | Prediction with expert advice for the Brier game | <|reference_start|>Prediction with expert advice for the Brier game: We show that the Brier game of prediction is mixable and find the optimal learning rate and substitution function for it. The resulting prediction algorithm is applied to predict results of football and tennis matches. The theoretical performance guar... | arxiv | @article{vovk2007prediction,
title={Prediction with expert advice for the Brier game},
author={Vladimir Vovk and Fedor Zhdanov},
journal={Journal of Machine Learning Research 10 (2009), 2413 - 2440},
year={2007},
archivePrefix={arXiv},
eprint={0710.0485},
primaryClass={cs.LG}
} | vovk2007prediction |
arxiv-1306 | 0710.0510 | Q-adic Transform revisited | <|reference_start|>Q-adic Transform revisited: We present an algorithm to perform a simultaneous modular reduction of several residues. This algorithm is applied fast modular polynomial multiplication. The idea is to convert the $X$-adic representation of modular polynomials, with $X$ an indeterminate, to a $q$-adic re... | arxiv | @article{dumas2007q-adic,
title={Q-adic Transform revisited},
author={Jean-Guillaume Dumas (LJK)},
journal={arXiv preprint arXiv:0710.0510},
year={2007},
archivePrefix={arXiv},
eprint={0710.0510},
primaryClass={cs.SC}
} | dumas2007q-adic |
arxiv-1307 | 0710.0528 | On the interaction between sharing and linearity | <|reference_start|>On the interaction between sharing and linearity: In the analysis of logic programs, abstract domains for detecting sharing and linearity information are widely used. Devising abstract unification algorithms for such domains has proved to be rather hard. At the moment, the available algorithms are co... | arxiv | @article{amato2007on,
title={On the interaction between sharing and linearity},
author={Gianluca Amato and Francesca Scozzari},
journal={Theory and Practice of Logic Programming, volume 10, issue 01, pp.
49-112, 2010},
year={2007},
doi={10.1017/S1471068409990160},
archivePrefix={arXiv},
ep... | amato2007on |
arxiv-1308 | 0710.0531 | The Problem of Localization in Networks of Randomly Deployed Nodes: Asymptotic and Finite Analysis, and Thresholds | <|reference_start|>The Problem of Localization in Networks of Randomly Deployed Nodes: Asymptotic and Finite Analysis, and Thresholds: We derive the probability that a randomly chosen NL-node over $S$ gets localized as a function of a variety of parameters. Then, we derive the probability that the whole network of NL-n... | arxiv | @article{daneshgaran2007the,
title={The Problem of Localization in Networks of Randomly Deployed Nodes:
Asymptotic and Finite Analysis, and Thresholds},
author={Fred Daneshgaran, Massimiliano Laddomada, Marina Mondin},
journal={arXiv preprint arXiv:0710.0531},
year={2007},
archivePrefix={arXiv},
... | daneshgaran2007the |
arxiv-1309 | 0710.0539 | A Novel Solution to the ATT48 Benchmark Problem | <|reference_start|>A Novel Solution to the ATT48 Benchmark Problem: A solution to the benchmark ATT48 Traveling Salesman Problem (from the TSPLIB95 library) results from isolating the set of vertices into ten open-ended zones with nine lengthwise boundaries. In each zone, a minimum-length Hamiltonian Path (HP) is found... | arxiv | @article{ruffa2007a,
title={A Novel Solution to the ATT48 Benchmark Problem},
author={Anthony A. Ruffa},
journal={arXiv preprint arXiv:0710.0539},
year={2007},
archivePrefix={arXiv},
eprint={0710.0539},
primaryClass={cs.DS cs.CC}
} | ruffa2007a |
arxiv-1310 | 0710.0550 | Community Detection in Complex Networks by Dynamical Simplex Evolution | <|reference_start|>Community Detection in Complex Networks by Dynamical Simplex Evolution: We benchmark the dynamical simplex evolution (DSE) method with several of the currently available algorithms to detect communities in complex networks by comparing the fraction of correctly identified nodes for different levels o... | arxiv | @article{gudkov2007community,
title={Community Detection in Complex Networks by Dynamical Simplex Evolution},
author={V. Gudkov and V. Montealegre},
journal={arXiv preprint arXiv:0710.0550},
year={2007},
doi={10.1103/PhysRevE.78.016113},
archivePrefix={arXiv},
eprint={0710.0550},
primary... | gudkov2007community |
arxiv-1311 | 0710.0556 | A Game Theoretic Approach to Quantum Information | <|reference_start|>A Game Theoretic Approach to Quantum Information: This work is an application of game theory to quantum information. In a state estimate, we are given observations distributed according to an unknown distribution $P_{\theta}$ (associated with award $Q$), which Nature chooses at random from the set $\... | arxiv | @article{dai2007a,
title={A Game Theoretic Approach to Quantum Information},
author={Xianhua Dai and V. P. Belavkin},
journal={arXiv preprint arXiv:0710.0556},
year={2007},
archivePrefix={arXiv},
eprint={0710.0556},
primaryClass={quant-ph cs.GT cs.IT math.IT}
} | dai2007a |
arxiv-1312 | 0710.0564 | TP Decoding | <|reference_start|>TP Decoding: `Tree pruning' (TP) is an algorithm for probabilistic inference on binary Markov random fields. It has been recently derived by Dror Weitz and used to construct the first fully polynomial approximation scheme for counting independent sets up to the `tree uniqueness threshold.' It can be ... | arxiv | @article{lu2007tp,
title={TP Decoding},
author={Yi Lu, Cyril Measson and Andrea Montanari},
journal={See also: 45th Annual Allerton Conference on Communication,
Control, and Computing, Monticello, USA, 2007},
year={2007},
archivePrefix={arXiv},
eprint={0710.0564},
primaryClass={cs.IT math.... | lu2007tp |
arxiv-1313 | 0710.0658 | Detailed Network Measurements Using Sparse Graph Counters: The Theory | <|reference_start|>Detailed Network Measurements Using Sparse Graph Counters: The Theory: Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that many counters be updated at a very high speed; however, t... | arxiv | @article{lu2007detailed,
title={Detailed Network Measurements Using Sparse Graph Counters: The Theory},
author={Yi Lu, Andrea Montanari and Balaji Prabhakar},
journal={arXiv preprint arXiv:0710.0658},
year={2007},
archivePrefix={arXiv},
eprint={0710.0658},
primaryClass={cs.NI cs.IT math.IT}
... | lu2007detailed |
arxiv-1314 | 0710.0672 | Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions | <|reference_start|>Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions: The field of algorithmic self-assembly is concerned with the design and analysis of self-assembly systems from a computational perspective, that is, from the perspective of mathematical problems whos... | arxiv | @article{vieira2007optimization,
title={Optimization of supply diversity for the self-assembly of simple objects
in two and three dimensions},
author={Fabio R. J. Vieira, Valmir C. Barbosa},
journal={Natural Computing 10 (2011), 551-581},
year={2007},
doi={10.1007/s11047-010-9209-x},
archivePr... | vieira2007optimization |
arxiv-1315 | 0710.0736 | Colour image segmentation by the vector-valued Allen-Cahn phase-field model: a multigrid solution | <|reference_start|>Colour image segmentation by the vector-valued Allen-Cahn phase-field model: a multigrid solution: We propose a new method for the numerical solution of a PDE-driven model for colour image segmentation and give numerical examples of the results. The method combines the vector-valued Allen-Cahn phase ... | arxiv | @article{kay2007colour,
title={Colour image segmentation by the vector-valued Allen-Cahn phase-field
model: a multigrid solution},
author={David A Kay (Oxford University Computational Laboratory), Alessandro
Tomasi (University of Sussex)},
journal={IEEE Trans. Im. Proc. 18.10 (2009)},
year={2007},
... | kay2007colour |
arxiv-1316 | 0710.0748 | A Fast Heuristic Algorithm Based on Verification and Elimination Methods for Maximum Clique Problem | <|reference_start|>A Fast Heuristic Algorithm Based on Verification and Elimination Methods for Maximum Clique Problem: A clique in an undirected graph G= (V, E) is a subset V' V of vertices, each pair of which is connected by an edge in E. The clique problem is an optimization problem of finding a clique of maximum si... | arxiv | @article{p2007a,
title={A Fast Heuristic Algorithm Based on Verification and Elimination Methods
for Maximum Clique Problem},
author={Murali Krishna P, Sabu .M Thampi},
journal={arXiv preprint arXiv:0710.0748},
year={2007},
archivePrefix={arXiv},
eprint={0710.0748},
primaryClass={cs.DM cs.... | p2007a |
arxiv-1317 | 0710.0789 | Wireless Local Area Networks with Multiple-Packet Reception Capability | <|reference_start|>Wireless Local Area Networks with Multiple-Packet Reception Capability: Thanks to its simplicity and cost efficiency, wireless local area network (WLAN) enjoys unique advantages in providing high-speed and low-cost wireless services in hot spots and indoor environments. Traditional WLAN medium-access... | arxiv | @article{zhang2007wireless,
title={Wireless Local Area Networks with Multiple-Packet Reception Capability},
author={Ying Jun Zhang, Peng Xuan Zheng, Soung Chang Liew},
journal={arXiv preprint arXiv:0710.0789},
year={2007},
archivePrefix={arXiv},
eprint={0710.0789},
primaryClass={cs.PF cs.NI}... | zhang2007wireless |
arxiv-1318 | 0710.0805 | On the Satisfiability Threshold and Clustering of Solutions of Random 3-SAT Formulas | <|reference_start|>On the Satisfiability Threshold and Clustering of Solutions of Random 3-SAT Formulas: We study the structure of satisfying assignments of a random 3-SAT formula. In particular, we show that a random formula of density 4.453 or higher almost surely has no non-trivial "core" assignments. Core assignmen... | arxiv | @article{maneva2007on,
title={On the Satisfiability Threshold and Clustering of Solutions of Random
3-SAT Formulas},
author={Elitza Maneva and Alistair Sinclair},
journal={arXiv preprint arXiv:0710.0805},
year={2007},
archivePrefix={arXiv},
eprint={0710.0805},
primaryClass={cs.CC}
} | maneva2007on |
arxiv-1319 | 0710.0811 | Band Unfoldings and Prismatoids: A Counterexample | <|reference_start|>Band Unfoldings and Prismatoids: A Counterexample: This note shows that the hope expressed in [ADL+07]--that the new algorithm for edge-unfolding any polyhedral band without overlap might lead to an algorithm for unfolding any prismatoid without overlap--cannot be realized. A prismatoid is constructe... | arxiv | @article{o'rourke2007band,
title={Band Unfoldings and Prismatoids: A Counterexample},
author={Joseph O'Rourke},
journal={arXiv preprint arXiv:0710.0811},
year={2007},
number={Smith Computer Science 086},
archivePrefix={arXiv},
eprint={0710.0811},
primaryClass={cs.CG}
} | o'rourke2007band |
arxiv-1320 | 0710.0824 | Two algorithms in search of a type system | <|reference_start|>Two algorithms in search of a type system: The authors' ATR programming formalism is a version of call-by-value PCF under a complexity-theoretically motivated type system. ATR programs run in type-2 polynomial-time and all standard type-2 basic feasible functionals are ATR-definable (ATR types are co... | arxiv | @article{danner2007two,
title={Two algorithms in search of a type system},
author={Norman Danner and James S. Royer},
journal={arXiv preprint arXiv:0710.0824},
year={2007},
archivePrefix={arXiv},
eprint={0710.0824},
primaryClass={cs.LO cs.PL}
} | danner2007two |
arxiv-1321 | 0710.0842 | Syst\`emes interactifs sensibles aux \'emotions : architecture logicielle | <|reference_start|>Syst\`emes interactifs sensibles aux \'emotions : architecture logicielle: We propose a software architecture for interactive systems which allows integrating the user's emotion. Emotion can be involved in interaction at several levels. In our application case - ballet dance - emotions is explicitely... | arxiv | @article{clay2007syst\`emes,
title={Syst\`emes interactifs sensibles aux \'emotions : architecture
logicielle},
author={Alexis Clay (LIPSI)},
journal={arXiv preprint arXiv:0710.0842},
year={2007},
archivePrefix={arXiv},
eprint={0710.0842},
primaryClass={cs.HC}
} | clay2007syst\`emes |
arxiv-1322 | 0710.0847 | Emotion capture based on body postures and movements | <|reference_start|>Emotion capture based on body postures and movements: In this paper we present a preliminary study for designing interactive systems that are sensible to human emotions based on the body movements. To do so, we first review the literature on the various approaches for defining and characterizing huma... | arxiv | @article{clay2007emotion,
title={Emotion capture based on body postures and movements},
author={Alexis Clay (LIPSI), Nadine Couture (LIPSI), Laurence Nigay (CLIPS -
IMAG)},
journal={Proceedings of the International Conference on Computing and
e-systems 2007 (TIGERA'07), Hammamet : Tunisie (2007)},
y... | clay2007emotion |
arxiv-1323 | 0710.0859 | Assistance orale \`a la recherche visuelle - \'etude exp\'erimentale de l'apport d'indications spatiales \`a la d\'etection de cibles | <|reference_start|>Assistance orale \`a la recherche visuelle - \'etude exp\'erimentale de l'apport d'indications spatiales \`a la d\'etection de cibles: This paper describes an experimental study that aims at assessing the actual contribution of voice system messages to visual search efficiency and comfort. Messages w... | arxiv | @article{kieffer2007assistance,
title={Assistance orale \`a la recherche visuelle - \'etude exp\'erimentale de
l'apport d'indications spatiales \`a la d\'etection de cibles},
author={Suzanne Kieffer (INRIA Rocquencourt / INRIA Lorraine - LORIA),
No"elle Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA... | kieffer2007assistance |
arxiv-1324 | 0710.0865 | Secrecy Capacity of the Wiretap Channel with Noisy Feedback | <|reference_start|>Secrecy Capacity of the Wiretap Channel with Noisy Feedback: In this work, the role of noisy feedback in enhancing the secrecy capacity of the wiretap channel is investigated. A model is considered in which the feed-forward and feedback signals share the same noisy channel. More specifically, a discr... | arxiv | @article{lai2007secrecy,
title={Secrecy Capacity of the Wiretap Channel with Noisy Feedback},
author={Lifeng Lai, Hesham El Gamal and H. Vincent Poor},
journal={arXiv preprint arXiv:0710.0865},
year={2007},
archivePrefix={arXiv},
eprint={0710.0865},
primaryClass={cs.IT cs.CR math.IT}
} | lai2007secrecy |
arxiv-1325 | 0710.0871 | Spreadsheets in Clinical Medicine | <|reference_start|>Spreadsheets in Clinical Medicine: There is overwhelming evidence that the continued and widespread use of untested spreadsheets in business gives rise to regular, significant and unexpected financial losses. Whilst this is worrying, it is perhaps a relatively minor concern compared with the risks ar... | arxiv | @article{croll2007spreadsheets,
title={Spreadsheets in Clinical Medicine},
author={Grenville J. Croll, Raymond J. Butler},
journal={Proc. European Spreadsheet Risks Int. Grp. 2006 7-16},
year={2007},
archivePrefix={arXiv},
eprint={0710.0871},
primaryClass={cs.CY}
} | croll2007spreadsheets |
arxiv-1326 | 0710.0900 | A New Achievability Scheme for the Relay Channel | <|reference_start|>A New Achievability Scheme for the Relay Channel: In this paper, we propose a new coding scheme for the general relay channel. This coding scheme is in the form of a block Markov code. The transmitter uses a superposition Markov code. The relay compresses the received signal and maps the compressed v... | arxiv | @article{kang2007a,
title={A New Achievability Scheme for the Relay Channel},
author={Wei Kang and Sennur Ulukus},
journal={arXiv preprint arXiv:0710.0900},
year={2007},
archivePrefix={arXiv},
eprint={0710.0900},
primaryClass={cs.IT math.IT}
} | kang2007a |
arxiv-1327 | 0710.0903 | Control and Monitoring System for Modular Wireless Robot | <|reference_start|>Control and Monitoring System for Modular Wireless Robot: We introduce our concept on the modular wireless robot consisting of three main modules : main unit, data acquisition and data processing modules. We have developed a generic prototype with an integrated control and monitoring system to enhanc... | arxiv | @article{firmansyah2007control,
title={Control and Monitoring System for Modular Wireless Robot},
author={I. Firmansyah, B. Hermanto and L.T. Handoko},
journal={arXiv preprint arXiv:0710.0903},
year={2007},
archivePrefix={arXiv},
eprint={0710.0903},
primaryClass={cs.RO}
} | firmansyah2007control |
arxiv-1328 | 0710.0925 | Degeneracy of Angular Voronoi Diagram | <|reference_start|>Degeneracy of Angular Voronoi Diagram: Angular Voronoi diagram was introduced by Asano et al. as fundamental research for a mesh generation. In an angular Voronoi diagram, the edges are curves of degree three. From view of computational robustness we need to treat the curves carefully, because they m... | arxiv | @article{muta2007degeneracy,
title={Degeneracy of Angular Voronoi Diagram},
author={Hidetoshi Muta and Kimikazu Kato},
journal={arXiv preprint arXiv:0710.0925},
year={2007},
archivePrefix={arXiv},
eprint={0710.0925},
primaryClass={cs.CG}
} | muta2007degeneracy |
arxiv-1329 | 0710.0937 | Multichannel algorithm based on generalized positional numeration system | <|reference_start|>Multichannel algorithm based on generalized positional numeration system: This report is devoted to introduction in multichannel algorithm based on generalized numeration notations (GPN). The internal, external and mixed account are entered. The concept of the GPN and its classification as decomposit... | arxiv | @article{lavrenov2007multichannel,
title={Multichannel algorithm based on generalized positional numeration system},
author={Alexandre Lavrenov},
journal={arXiv preprint arXiv:0710.0937},
year={2007},
archivePrefix={arXiv},
eprint={0710.0937},
primaryClass={cs.IT math.IT}
} | lavrenov2007multichannel |
arxiv-1330 | 0710.1001 | Connectivity of Random 1-Dimensional Networks | <|reference_start|>Connectivity of Random 1-Dimensional Networks: An important problem in wireless sensor networks is to find the minimal number of randomly deployed sensors making a network connected with a given probability. In practice sensors are often deployed one by one along a trajectory of a vehicle, so it is n... | arxiv | @article{kurlin2007connectivity,
title={Connectivity of Random 1-Dimensional Networks},
author={V. Kurlin, L. Mihaylova},
journal={arXiv preprint arXiv:0710.1001},
year={2007},
archivePrefix={arXiv},
eprint={0710.1001},
primaryClass={cs.IT cs.DS math.IT stat.AP}
} | kurlin2007connectivity |
arxiv-1331 | 0710.1007 | Two representation theorems of three-valued structures by means of binary relations | <|reference_start|>Two representation theorems of three-valued structures by means of binary relations: The results here presented are a continuation of the algebraic research line which attempts to find properties of multiple-valued systems based on a poset of two agents. The aim of this paper is to exhibit two rela... | arxiv | @article{iturrioz2007two,
title={Two representation theorems of three-valued structures by means of
binary relations},
author={Luisa Iturrioz},
journal={arXiv preprint arXiv:0710.1007},
year={2007},
archivePrefix={arXiv},
eprint={0710.1007},
primaryClass={cs.DM}
} | iturrioz2007two |
arxiv-1332 | 0710.1149 | Z2Z4-linear codes: generator matrices and duality | <|reference_start|>Z2Z4-linear codes: generator matrices and duality: A code ${\cal C}$ is $\Z_2\Z_4$-additive if the set of coordinates can be partitioned into two subsets $X$ and $Y$ such that the punctured code of ${\cal C}$ by deleting the coordinates outside $X$ (respectively, $Y$) is a binary linear code (respect... | arxiv | @article{borges2007z2z4-linear,
title={Z2Z4-linear codes: generator matrices and duality},
author={J. Borges, C. Fernandez, J. Pujol, J. Rifa, M. Villanueva},
journal={arXiv preprint arXiv:0710.1149},
year={2007},
archivePrefix={arXiv},
eprint={0710.1149},
primaryClass={cs.IT cs.DM math.CO m... | borges2007z2z4-linear |
arxiv-1333 | 0710.1153 | Verification of Ptime Reducibility for system F Terms: Type Inference in<br> Dual Light Affine Logic | <|reference_start|>Verification of Ptime Reducibility for system F Terms: Type Inference in<br> Dual Light Affine Logic: In a previous work Baillot and Terui introduced Dual light affine logic (DLAL) as a variant of Light linear logic suitable for guaranteeing complexity properties on lambda calculus terms: all typable... | arxiv | @article{atassi2007verification,
title={Verification of Ptime Reducibility for system F Terms: Type Inference
in<br> Dual Light Affine Logic},
author={Vincent Atassi, Patrick Baillot, Kazushige Terui},
journal={Logical Methods in Computer Science, Volume 3, Issue 4 (November
15, 2007) lmcs:1234},
ye... | atassi2007verification |
arxiv-1334 | 0710.1182 | Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels | <|reference_start|>Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels: We solve the problem of designing powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rat... | arxiv | @article{boutros2007low-density,
title={Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels},
author={Joseph J. Boutros, Albert Guillen i Fabregas, Ezio Biglieri and Gilles
Zemor},
journal={arXiv preprint arXiv:0710.1182},
year={2007},
doi={10.1109/TIT.2010.2053890},
archivePre... | boutros2007low-density |
arxiv-1335 | 0710.1190 | Power Efficient Scheduling under Delay Constraints over Multi-user Wireless Channels | <|reference_start|>Power Efficient Scheduling under Delay Constraints over Multi-user Wireless Channels: In this paper, we consider the problem of power efficient uplink scheduling in a Time Division Multiple Access (TDMA) system over a fading wireless channel. The objective is to minimize the power expenditure of each... | arxiv | @article{salodkar2007power,
title={Power Efficient Scheduling under Delay Constraints over Multi-user
Wireless Channels},
author={Nitin Salodkar, Abhay Karandikar and Vivek S. Borkar},
journal={arXiv preprint arXiv:0710.1190},
year={2007},
archivePrefix={arXiv},
eprint={0710.1190},
primary... | salodkar2007power |
arxiv-1336 | 0710.1203 | Semantic distillation: a method for clustering objects by their contextual specificity | <|reference_start|>Semantic distillation: a method for clustering objects by their contextual specificity: Techniques for data-mining, latent semantic analysis, contextual search of databases, etc. have long ago been developed by computer scientists working on information retrieval (IR). Experimental scientists, from a... | arxiv | @article{sierocinski2007semantic,
title={Semantic distillation: a method for clustering objects by their
contextual specificity},
author={Thomas Sierocinski (IRMAR), Anthony Le B'echec, Nathalie Th'eret,
Dimitri Petritis (IRMAR)},
journal={arXiv preprint arXiv:0710.1203},
year={2007},
number={20... | sierocinski2007semantic |
arxiv-1337 | 0710.1208 | Diagrammatic Inference | <|reference_start|>Diagrammatic Inference: Diagrammatic logics were introduced in 2002, with emphasis on the notions of specifications and models. In this paper we improve the description of the inference process, which is seen as a Yoneda functor on a bicategory of fractions. A diagrammatic logic is defined from a mor... | arxiv | @article{duval2007diagrammatic,
title={Diagrammatic Inference},
author={Dominique Duval (LJK)},
journal={arXiv preprint arXiv:0710.1208},
year={2007},
archivePrefix={arXiv},
eprint={0710.1208},
primaryClass={cs.LO math.CT}
} | duval2007diagrammatic |
arxiv-1338 | 0710.1254 | A Group Theoretic Model for Information | <|reference_start|>A Group Theoretic Model for Information: In this paper we formalize the notions of information elements and information lattices, first proposed by Shannon. Exploiting this formalization, we identify a comprehensive parallelism between information lattices and subgroup lattices. Qualitatively, we dem... | arxiv | @article{li2007a,
title={A Group Theoretic Model for Information},
author={Hua Li and Edwin K.P. Chong},
journal={arXiv preprint arXiv:0710.1254},
year={2007},
archivePrefix={arXiv},
eprint={0710.1254},
primaryClass={cs.IT math.IT}
} | li2007a |
arxiv-1339 | 0710.1275 | On Convergence Properties of Shannon Entropy | <|reference_start|>On Convergence Properties of Shannon Entropy: Convergence properties of Shannon Entropy are studied. In the differential setting, it is shown that weak convergence of probability measures, or convergence in distribution, is not enough for convergence of the associated differential entropies. A genera... | arxiv | @article{piera2007on,
title={On Convergence Properties of Shannon Entropy},
author={Francisco J. Piera, Patricio Parada},
journal={arXiv preprint arXiv:0710.1275},
year={2007},
doi={10.1134/S003294600902001X},
archivePrefix={arXiv},
eprint={0710.1275},
primaryClass={cs.IT math.IT}
} | piera2007on |
arxiv-1340 | 0710.1280 | On the Relationship between Mutual Information and Minimum Mean-Square Errors in Stochastic Dynamical Systems | <|reference_start|>On the Relationship between Mutual Information and Minimum Mean-Square Errors in Stochastic Dynamical Systems: We consider a general stochastic input-output dynamical system with output evolving in time as the solution to a functional coefficients, It\^{o}'s stochastic differential equation, excited ... | arxiv | @article{piera2007on,
title={On the Relationship between Mutual Information and Minimum Mean-Square
Errors in Stochastic Dynamical Systems},
author={Francisco J. Piera, Patricio Parada},
journal={arXiv preprint arXiv:0710.1280},
year={2007},
archivePrefix={arXiv},
eprint={0710.1280},
prima... | piera2007on |
arxiv-1341 | 0710.1325 | The MIMOME Channel | <|reference_start|>The MIMOME Channel: The MIMOME channel is a Gaussian wiretap channel in which the sender, receiver, and eavesdropper all have multiple antennas. We characterize the secrecy capacity as the saddle-value of a minimax problem. Among other implications, our result establishes that a Gaussian distribution... | arxiv | @article{khisti2007the,
title={The MIMOME Channel},
author={Ashish Khisti and Gregory Wornell},
journal={arXiv preprint arXiv:0710.1325},
year={2007},
archivePrefix={arXiv},
eprint={0710.1325},
primaryClass={cs.IT math.IT}
} | khisti2007the |
arxiv-1342 | 0710.1336 | Multi-User Diversity vs Accurate Channel Feedback for MIMO Broadcast Channels | <|reference_start|>Multi-User Diversity vs Accurate Channel Feedback for MIMO Broadcast Channels: A multiple transmit antenna, single receive antenna (per receiver) downlink channel with limited channel feedback is considered. Given a constraint on the total system-wide channel feedback, the following question is consi... | arxiv | @article{ravindran2007multi-user,
title={Multi-User Diversity vs. Accurate Channel Feedback for MIMO Broadcast
Channels},
author={Niranjay Ravindran, Nihar Jindal},
journal={arXiv preprint arXiv:0710.1336},
year={2007},
archivePrefix={arXiv},
eprint={0710.1336},
primaryClass={cs.IT math.IT... | ravindran2007multi-user |
arxiv-1343 | 0710.1383 | Log-concavity property of the error probability with application to local bounds for wireless communications | <|reference_start|>Log-concavity property of the error probability with application to local bounds for wireless communications: A clear understanding the behavior of the error probability (EP) as a function of signal-to-noise ratio (SNR) and other system parameters is fundamental for assessing the design of digital wi... | arxiv | @article{conti2007log-concavity,
title={Log-concavity property of the error probability with application to
local bounds for wireless communications},
author={Andrea Conti, Dmitry Panchenko, Sergiy Sidenko, Velio Tralli},
journal={IEEE Trans. Inform. Theory, 2009, vol. 55, no. 6, 2766-2775.},
year={20... | conti2007log-concavity |
arxiv-1344 | 0710.1385 | Cognitive Medium Access: Exploration, Exploitation and Competition | <|reference_start|>Cognitive Medium Access: Exploration, Exploitation and Competition: This paper establishes the equivalence between cognitive medium access and the competitive multi-armed bandit problem. First, the scenario in which a single cognitive user wishes to opportunistically exploit the availability of empty... | arxiv | @article{lai2007cognitive,
title={Cognitive Medium Access: Exploration, Exploitation and Competition},
author={Lifeng Lai, Hesham El Gamal, Hai Jiang and H. Vincent Poor},
journal={arXiv preprint arXiv:0710.1385},
year={2007},
archivePrefix={arXiv},
eprint={0710.1385},
primaryClass={cs.IT cs... | lai2007cognitive |
arxiv-1345 | 0710.1404 | Performance Comparison of Persistence Frameworks | <|reference_start|>Performance Comparison of Persistence Frameworks: One of the essential and most complex components in the software development process is the database. The complexity increases when the "orientation" of the interacting components differs. A persistence framework moves the program data in its most nat... | arxiv | @article{thampi2007performance,
title={Performance Comparison of Persistence Frameworks},
author={Sabu M. Thampi, Ashwin a K},
journal={arXiv preprint arXiv:0710.1404},
year={2007},
archivePrefix={arXiv},
eprint={0710.1404},
primaryClass={cs.DB cs.IR}
} | thampi2007performance |
arxiv-1346 | 0710.1418 | Non-Archimedean Ergodic Theory and Pseudorandom Generators | <|reference_start|>Non-Archimedean Ergodic Theory and Pseudorandom Generators: The paper develops techniques in order to construct computer programs, pseudorandom number generators (PRNG), that produce uniformly distributed sequences. The paper exploits an approach that treats standard processor instructions (arithmeti... | arxiv | @article{anashin2007non-archimedean,
title={Non-Archimedean Ergodic Theory and Pseudorandom Generators},
author={Vladimir Anashin},
journal={The Computer Journal, 53(4):370--392, 2010},
year={2007},
doi={10.1093/comjnl/bxm101},
archivePrefix={arXiv},
eprint={0710.1418},
primaryClass={mat... | anashin2007non-archimedean |
arxiv-1347 | 0710.1435 | Faster Least Squares Approximation | <|reference_start|>Faster Least Squares Approximation: Least squares approximation is a technique to find an approximate solution to a system of linear equations that has no exact solution. In a typical setting, one lets $n$ be the number of constraints and $d$ be the number of variables, with $n \gg d$. Then, existing... | arxiv | @article{drineas2007faster,
title={Faster Least Squares Approximation},
author={Petros Drineas, Michael W. Mahoney, S. Muthukrishnan, and Tamas Sarlos},
journal={arXiv preprint arXiv:0710.1435},
year={2007},
archivePrefix={arXiv},
eprint={0710.1435},
primaryClass={cs.DS}
} | drineas2007faster |
arxiv-1348 | 0710.1436 | Polish grid infrastructure for science and research | <|reference_start|>Polish grid infrastructure for science and research: Structure, functionality, parameters and organization of the computing Grid in Poland is described, mainly from the perspective of high-energy particle physics community, currently its largest consumer and developer. It represents distributed Tier-... | arxiv | @article{gokieli2007polish,
title={Polish grid infrastructure for science and research},
author={Ryszard Gokieli, Krzysztof Nawrocki, Adam Padee, Dorota Stojda, Karol
Wawrzyniak, Wojciech Wislicki},
journal={2007, ISBN 1-4244-0813-X},
year={2007},
doi={10.1109/EURCON.2007.4400477},
archivePref... | gokieli2007polish |
arxiv-1349 | 0710.1455 | Superrecursive Features of Interactive Computation | <|reference_start|>Superrecursive Features of Interactive Computation: Functioning and interaction of distributed devices and concurrent algorithms are analyzed in the context of the theory of algorithms. Our main concern here is how and under what conditions algorithmic interactive devices can be more powerful than th... | arxiv | @article{burgin2007superrecursive,
title={Superrecursive Features of Interactive Computation},
author={Mark Burgin},
journal={arXiv preprint arXiv:0710.1455},
year={2007},
archivePrefix={arXiv},
eprint={0710.1455},
primaryClass={cs.DC cs.PF}
} | burgin2007superrecursive |
arxiv-1350 | 0710.1462 | Minimization of entropy functionals | <|reference_start|>Minimization of entropy functionals: Entropy functionals (i.e. convex integral functionals) and extensions of these functionals are minimized on convex sets. This paper is aimed at reducing as much as possible the assumptions on the constraint set. Dual equalities and characterizations of the minimiz... | arxiv | @article{léonard2007minimization,
title={Minimization of entropy functionals},
author={Christian L'eonard (MODAL'x, Cmap)},
journal={arXiv preprint arXiv:0710.1462},
year={2007},
doi={10.1016/j.jmaa.2008.04.048},
archivePrefix={arXiv},
eprint={0710.1462},
primaryClass={math.OC cs.IT math... | léonard2007minimization |
arxiv-1351 | 0710.1467 | Weight Distributions of Hamming Codes | <|reference_start|>Weight Distributions of Hamming Codes: We derive a recursive formula determing the weight distribution of the [n=(q^m-1)/(q-1), n-m, 3] Hamming code H(m,q), when (m, q-1)=1. Here q is a prime power. The proof is based on Moisio's idea of using Pless power moment identity together with exponential sum... | arxiv | @article{kim2007weight,
title={Weight Distributions of Hamming Codes},
author={Dae San Kim},
journal={arXiv preprint arXiv:0710.1467},
year={2007},
archivePrefix={arXiv},
eprint={0710.1467},
primaryClass={cs.IT math.IT math.NT}
} | kim2007weight |
arxiv-1352 | 0710.1469 | Weight Distributions of Hamming Codes (II) | <|reference_start|>Weight Distributions of Hamming Codes (II): In a previous paper, we derived a recursive formula determining the weight distributions of the [n=(q^m-1)/(q-1)] Hamming code H(m,q), when (m,q-1)=1. Here q is a prime power. We note here that the formula actually holds for any positive integer m and any p... | arxiv | @article{kim2007weight,
title={Weight Distributions of Hamming Codes (II)},
author={Dae San Kim},
journal={arXiv preprint arXiv:0710.1469},
year={2007},
archivePrefix={arXiv},
eprint={0710.1469},
primaryClass={cs.IT math.IT math.NT}
} | kim2007weight |
arxiv-1353 | 0710.1481 | What's in a Name? | <|reference_start|>What's in a Name?: This paper describes experiments on identifying the language of a single name in isolation or in a document written in a different language. A new corpus has been compiled and made available, matching names against languages. This corpus is used in a series of experiments measuring... | arxiv | @article{konstantopoulos2007what's,
title={What's in a Name?},
author={Stasinos Konstantopoulos},
journal={arXiv preprint arXiv:0710.1481},
year={2007},
archivePrefix={arXiv},
eprint={0710.1481},
primaryClass={cs.CL cs.AI}
} | konstantopoulos2007what's |
arxiv-1354 | 0710.1482 | Heap Reference Analysis for Functional Programs | <|reference_start|>Heap Reference Analysis for Functional Programs: Current garbage collectors leave a lot of garbage uncollected because they conservatively approximate liveness by reachability from program variables. In this paper, we describe a sequence of static analyses that takes as input a program written in a f... | arxiv | @article{karkare2007heap,
title={Heap Reference Analysis for Functional Programs},
author={Amey Karkare, Amitabha Sanyal, Uday Khedker},
journal={arXiv preprint arXiv:0710.1482},
year={2007},
archivePrefix={arXiv},
eprint={0710.1482},
primaryClass={cs.PL cs.SE}
} | karkare2007heap |
arxiv-1355 | 0710.1484 | The structure and modeling results of the parallel spatial switching system | <|reference_start|>The structure and modeling results of the parallel spatial switching system: Problems of the switching parallel system designing provided spatial switching of packets from random time are discussed. Results of modeling of switching system as systems of mass service are resulted.<|reference_end|> | arxiv | @article{kutuzov2007the,
title={The structure and modeling results of the parallel spatial switching
system},
author={Denis Kutuzov},
journal={IEEE International Siberian Conference on Control and
Communications (SIBCON-2007). Proceedings. Tomsk, April 20-21, 2007. (pp.
86-88). IEEE Catalog Number: 07... | kutuzov2007the |
arxiv-1356 | 0710.1499 | Approximating max-min linear programs with local algorithms | <|reference_start|>Approximating max-min linear programs with local algorithms: A local algorithm is a distributed algorithm where each node must operate solely based on the information that was available at system startup within a constant-size neighbourhood of the node. We study the applicability of local algorithms ... | arxiv | @article{floréen2007approximating,
title={Approximating max-min linear programs with local algorithms},
author={Patrik Flor'een, Petteri Kaski, Topi Musto, Jukka Suomela},
journal={arXiv preprint arXiv:0710.1499},
year={2007},
doi={10.1109/IPDPS.2008.4536235},
archivePrefix={arXiv},
eprint={... | floréen2007approximating |
arxiv-1357 | 0710.1511 | Demographic growth and the distribution of language sizes | <|reference_start|>Demographic growth and the distribution of language sizes: It is argued that the present log-normal distribution of language sizes is, to a large extent, a consequence of demographic dynamics within the population of speakers of each language. A two-parameter stochastic multiplicative process is prop... | arxiv | @article{zanette2007demographic,
title={Demographic growth and the distribution of language sizes},
author={Damian H. Zanette},
journal={arXiv preprint arXiv:0710.1511},
year={2007},
doi={10.1142/S0129183108012042},
archivePrefix={arXiv},
eprint={0710.1511},
primaryClass={physics.data-an... | zanette2007demographic |
arxiv-1358 | 0710.1522 | Distributed spatial multiplexing with 1-bit feedback | <|reference_start|>Distributed spatial multiplexing with 1-bit feedback: We analyze a slow-fading interference network with MN non-cooperating single-antenna sources and M non-cooperating single-antenna destinations. In particular, we assume that the sources are divided into M mutually exclusive groups of N sources eac... | arxiv | @article{thukral2007distributed,
title={Distributed spatial multiplexing with 1-bit feedback},
author={J. Thukral and H. B"olcskei},
journal={arXiv preprint arXiv:0710.1522},
year={2007},
archivePrefix={arXiv},
eprint={0710.1522},
primaryClass={cs.IT math.IT}
} | thukral2007distributed |
arxiv-1359 | 0710.1525 | Efficient Optimally Lazy Algorithms for Minimal-Interval Semantics | <|reference_start|>Efficient Optimally Lazy Algorithms for Minimal-Interval Semantics: Minimal-interval semantics associates with each query over a document a set of intervals, called witnesses, that are incomparable with respect to inclusion (i.e., they form an antichain): witnesses define the minimal regions of the d... | arxiv | @article{vigna2007efficient,
title={Efficient Optimally Lazy Algorithms for Minimal-Interval Semantics},
author={Sebastiano Vigna, Paolo Boldi},
journal={arXiv preprint arXiv:0710.1525},
year={2007},
archivePrefix={arXiv},
eprint={0710.1525},
primaryClass={cs.DS cs.IR}
} | vigna2007efficient |
arxiv-1360 | 0710.1589 | Fast Reliability-based Algorithm of Finding Minimum-weight Codewords for LDPC Codes | <|reference_start|>Fast Reliability-based Algorithm of Finding Minimum-weight Codewords for LDPC Codes: Despite the NP hardness of acquiring minimum distance $d_m$ for linear codes theoretically, in this paper we propose one experimental method of finding minimum-weight codewords, the weight of which is equal to $d_m$ ... | arxiv | @article{li2007fast,
title={Fast Reliability-based Algorithm of Finding Minimum-weight Codewords for
LDPC Codes},
author={Guangwen Li, Guangzeng Feng},
journal={arXiv preprint arXiv:0710.1589},
year={2007},
archivePrefix={arXiv},
eprint={0710.1589},
primaryClass={cs.IT math.IT}
} | li2007fast |
arxiv-1361 | 0710.1595 | Analysis of Fixed Outage Transmission Schemes: A Finer Look at the Full Multiplexing Point | <|reference_start|>Analysis of Fixed Outage Transmission Schemes: A Finer Look at the Full Multiplexing Point: This paper studies the performance of transmission schemes that have rate that increases with average SNR while maintaining a fixed outage probability. This is in contrast to the classical Zheng-Tse diversity-... | arxiv | @article{wu2007analysis,
title={Analysis of Fixed Outage Transmission Schemes: A Finer Look at the Full
Multiplexing Point},
author={Peng Wu and Nihar Jindal},
journal={arXiv preprint arXiv:0710.1595},
year={2007},
archivePrefix={arXiv},
eprint={0710.1595},
primaryClass={cs.IT math.IT}
} | wu2007analysis |
arxiv-1362 | 0710.1624 | Hamiltonian Formulation of Quantum Error Correction and Correlated Noise: The Effects Of Syndrome Extraction in the Long Time Limit | <|reference_start|>Hamiltonian Formulation of Quantum Error Correction and Correlated Noise: The Effects Of Syndrome Extraction in the Long Time Limit: We analyze the long time behavior of a quantum computer running a quantum error correction (QEC) code in the presence of a correlated environment. Starting from a Hamil... | arxiv | @article{novais2007hamiltonian,
title={Hamiltonian Formulation of Quantum Error Correction and Correlated
Noise: The Effects Of Syndrome Extraction in the Long Time Limit},
author={E. Novais, Eduardo R. Mucciolo, Harold U. Baranger},
journal={Phys. Rev. A 78, 012314 (2008)},
year={2007},
doi={10.1... | novais2007hamiltonian |
arxiv-1363 | 0710.1626 | Throughput Scaling in Random Wireless Networks: A Non-Hierarchical Multipath Routing Strategy | <|reference_start|>Throughput Scaling in Random Wireless Networks: A Non-Hierarchical Multipath Routing Strategy: Franceschetti et al. have recently shown that per-node throughput in an extended, ad hoc wireless network with $\Theta(n)$ randomly distributed nodes and multihop routing can be increased from the $\Omega({... | arxiv | @article{josan2007throughput,
title={Throughput Scaling in Random Wireless Networks: A Non-Hierarchical
Multipath Routing Strategy},
author={Awlok Josan, Mingyan Liu, David L. Neuhoff and S. Sandeep Pradhan},
journal={arXiv preprint arXiv:0710.1626},
year={2007},
archivePrefix={arXiv},
eprint=... | josan2007throughput |
arxiv-1364 | 0710.1641 | A polynomial bound for untangling geometric planar graphs | <|reference_start|>A polynomial bound for untangling geometric planar graphs: To untangle a geometric graph means to move some of the vertices so that the resulting geometric graph has no crossings. Pach and Tardos [Discrete Comput. Geom., 2002] asked if every n-vertex geometric planar graph can be untangled while keep... | arxiv | @article{bose2007a,
title={A polynomial bound for untangling geometric planar graphs},
author={Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat
Morin, David R. Wood},
journal={Discrete & Computational Geometry 42(4):570-585, 2009},
year={2007},
doi={10.1007/s00454-008-9125-3},
... | bose2007a |
arxiv-1365 | 0710.1772 | Cross-Participants : fostering design-use mediation in an Open Source Software community | <|reference_start|>Cross-Participants : fostering design-use mediation in an Open Source Software community: Motivation - This research aims at investigating emerging roles and forms of participation fostering design-use mediation during the Open Source Software design process Research approach - We compare online inte... | arxiv | @article{barcellini2007cross-participants,
title={Cross-Participants : fostering design-use mediation in an Open Source
Software community},
author={Flore Barcellini (INRIA Rocquencourt), Franc{c}oise D'etienne (INRIA
Rocquencourt), Jean-Marie Burkhardt (INRIA Rocquencourt, LEI)},
journal={Dans European... | barcellini2007cross-participants |
arxiv-1366 | 0710.1784 | Designing a commutative replicated data type | <|reference_start|>Designing a commutative replicated data type: Commuting operations greatly simplify consistency in distributed systems. This paper focuses on designing for commutativity, a topic neglected previously. We show that the replicas of \emph{any} data type for which concurrent operations commute converges ... | arxiv | @article{shapiro2007designing,
title={Designing a commutative replicated data type},
author={Marc Shapiro (LIP6, INRIA Rocquencourt), Nuno Preguic{c}a (INRIA
Rocquencourt)},
journal={arXiv preprint arXiv:0710.1784},
year={2007},
archivePrefix={arXiv},
eprint={0710.1784},
primaryClass={cs.D... | shapiro2007designing |
arxiv-1367 | 0710.1842 | An explicit universal cycle for the (n-1)-permutations of an n-set | <|reference_start|>An explicit universal cycle for the (n-1)-permutations of an n-set: We show how to construct an explicit Hamilton cycle in the directed Cayley graph Cay({\sigma_n, sigma_{n-1}} : \mathbb{S}_n), where \sigma_k = (1 2 >... k). The existence of such cycles was shown by Jackson (Discrete Mathematics, 149... | arxiv | @article{ruskey2007an,
title={An explicit universal cycle for the (n-1)-permutations of an n-set},
author={Frank Ruskey and Aaron Williams},
journal={arXiv preprint arXiv:0710.1842},
year={2007},
archivePrefix={arXiv},
eprint={0710.1842},
primaryClass={cs.DM cs.DS}
} | ruskey2007an |
arxiv-1368 | 0710.1870 | Lossless Representation of Graphs using Distributions | <|reference_start|>Lossless Representation of Graphs using Distributions: We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely determined, up to isomorphism, by the distribution of their sub-tri... | arxiv | @article{boutin2007lossless,
title={Lossless Representation of Graphs using Distributions},
author={Mireille Boutin and Gregor Kemper},
journal={arXiv preprint arXiv:0710.1870},
year={2007},
archivePrefix={arXiv},
eprint={0710.1870},
primaryClass={math.CO cs.CV}
} | boutin2007lossless |
arxiv-1369 | 0710.1879 | Cyclotomic FFTs with Reduced Additive Complexities Based on a Novel Common Subexpression Elimination Algorithm | <|reference_start|>Cyclotomic FFTs with Reduced Additive Complexities Based on a Novel Common Subexpression Elimination Algorithm: In this paper, we first propose a novel common subexpression elimination (CSE) algorithm for matrix-vector multiplications over characteristic-2 fields. As opposed to previously proposed CS... | arxiv | @article{chen2007cyclotomic,
title={Cyclotomic FFTs with Reduced Additive Complexities Based on a Novel
Common Subexpression Elimination Algorithm},
author={Ning Chen and Zhiyuan Yan},
journal={arXiv preprint arXiv:0710.1879},
year={2007},
archivePrefix={arXiv},
eprint={0710.1879},
primary... | chen2007cyclotomic |
arxiv-1370 | 0710.1916 | Evaluate the Word Error Rate of Binary Block Codes with Square Radius Probability Density Function | <|reference_start|>Evaluate the Word Error Rate of Binary Block Codes with Square Radius Probability Density Function: The word error rate (WER) of soft-decision-decoded binary block codes rarely has closed-form. Bounding techniques are widely used to evaluate the performance of maximum-likelihood decoding algorithm. B... | arxiv | @article{chen2007evaluate,
title={Evaluate the Word Error Rate of Binary Block Codes with Square Radius
Probability Density Function},
author={Xiaogang Chen, Hongwen Yang, Jian Gu, Hongkui Yang},
journal={arXiv preprint arXiv:0710.1916},
year={2007},
archivePrefix={arXiv},
eprint={0710.1916},
... | chen2007evaluate |
arxiv-1371 | 0710.1920 | The Secrecy Capacity of the MIMO Wiretap Channel | <|reference_start|>The Secrecy Capacity of the MIMO Wiretap Channel: We consider the MIMO wiretap channel, that is a MIMO broadcast channel where the transmitter sends some confidential information to one user which is a legitimate receiver, while the other user is an eavesdropper. Perfect secrecy is achieved when the ... | arxiv | @article{oggier2007the,
title={The Secrecy Capacity of the MIMO Wiretap Channel},
author={Fr'ed'erique Oggier and Babak Hassibi},
journal={arXiv preprint arXiv:0710.1920},
year={2007},
archivePrefix={arXiv},
eprint={0710.1920},
primaryClass={cs.IT cs.CR math.IT}
} | oggier2007the |
arxiv-1372 | 0710.1924 | A Heuristic Routing Mechanism Using a New Addressing Scheme | <|reference_start|>A Heuristic Routing Mechanism Using a New Addressing Scheme: Current methods of routing are based on network information in the form of routing tables, in which routing protocols determine how to update the tables according to the network changes. Despite the variability of data in routing tables, no... | arxiv | @article{ravanbakhsh2007a,
title={A Heuristic Routing Mechanism Using a New Addressing Scheme},
author={Mohsen Ravanbakhsh, Yasin Abbasi-Yadkori, Maghsoud Abbaspour, Hamid
Sarbazi-Azad},
journal={Proceedings of First International Conference on Bio Inspired
models of Networks, Information and Computing ... | ravanbakhsh2007a |
arxiv-1373 | 0710.1949 | Distributed Source Coding Using Continuous-Valued Syndromes | <|reference_start|>Distributed Source Coding Using Continuous-Valued Syndromes: This paper addresses the problem of coding a continuous random source correlated with another source which is only available at the decoder. The proposed approach is based on the extension of the channel coding concept of syndrome from the ... | arxiv | @article{cappellari2007distributed,
title={Distributed Source Coding Using Continuous-Valued Syndromes},
author={Lorenzo Cappellari},
journal={arXiv preprint arXiv:0710.1949},
year={2007},
archivePrefix={arXiv},
eprint={0710.1949},
primaryClass={cs.IT math.IT}
} | cappellari2007distributed |
arxiv-1374 | 0710.1962 | Stanford Matrix Considered Harmful | <|reference_start|>Stanford Matrix Considered Harmful: This note argues about the validity of web-graph data used in the literature.<|reference_end|> | arxiv | @article{vigna2007stanford,
title={Stanford Matrix Considered Harmful},
author={Sebastiano Vigna},
journal={arXiv preprint arXiv:0710.1962},
year={2007},
archivePrefix={arXiv},
eprint={0710.1962},
primaryClass={cs.IR}
} | vigna2007stanford |
arxiv-1375 | 0710.1976 | Solving Infinite Kolam in Knot Theory | <|reference_start|>Solving Infinite Kolam in Knot Theory: In south India, there are traditional patterns of line-drawings encircling dots, called ``Kolam'', among which one-line drawings or the ``infinite Kolam'' provide very interesting questions in mathematics. For example, we address the following simple question: h... | arxiv | @article{ishimoto2007solving,
title={Solving Infinite Kolam in Knot Theory},
author={Yukitaka Ishimoto},
journal={Forma 22 (2007) 15-30},
year={2007},
number={OIQP-06-15},
archivePrefix={arXiv},
eprint={0710.1976},
primaryClass={cs.DM cond-mat.stat-mech}
} | ishimoto2007solving |
arxiv-1376 | 0710.2018 | Cognitive Interference Channels with Confidential Messages | <|reference_start|>Cognitive Interference Channels with Confidential Messages: The cognitive interference channel with confidential messages is studied. Similarly to the classical two-user interference channel, the cognitive interference channel consists of two transmitters whose signals interfere at the two receivers.... | arxiv | @article{liang2007cognitive,
title={Cognitive Interference Channels with Confidential Messages},
author={Yingbin Liang, Anelia Somekh-Baruch, H. Vincent Poor, Shlomo Shamai
(Shitz), and Sergio Verdu},
journal={arXiv preprint arXiv:0710.2018},
year={2007},
archivePrefix={arXiv},
eprint={0710.20... | liang2007cognitive |
arxiv-1377 | 0710.2037 | An Affinity Propagation Based method for Vector Quantization Codebook Design | <|reference_start|>An Affinity Propagation Based method for Vector Quantization Codebook Design: In this paper, we firstly modify a parameter in affinity propagation (AP) to improve its convergence ability, and then, we apply it to vector quantization (VQ) codebook design problem. In order to improve the quality of the... | arxiv | @article{jiang2007an,
title={An Affinity Propagation Based method for Vector Quantization Codebook
Design},
author={Wu Jiang, Fei Ding and Qiao-liang Xiang},
journal={arXiv preprint arXiv:0710.2037},
year={2007},
archivePrefix={arXiv},
eprint={0710.2037},
primaryClass={cs.CV}
} | jiang2007an |
arxiv-1378 | 0710.2083 | Association Rules in the Relational Calculus | <|reference_start|>Association Rules in the Relational Calculus: One of the most utilized data mining tasks is the search for association rules. Association rules represent significant relationships between items in transactions. We extend the concept of association rule to represent a much broader class of association... | arxiv | @article{schulte2007association,
title={Association Rules in the Relational Calculus},
author={Oliver Schulte, Flavia Moser, Martin Ester and Zhiyong Lu},
journal={arXiv preprint arXiv:0710.2083},
year={2007},
number={SFU School of Computing Science, TR 2007-23},
archivePrefix={arXiv},
eprin... | schulte2007association |
arxiv-1379 | 0710.2092 | Self-similarity of complex networks and hidden metric spaces | <|reference_start|>Self-similarity of complex networks and hidden metric spaces: We demonstrate that the self-similarity of some scale-free networks with respect to a simple degree-thresholding renormalization scheme finds a natural interpretation in the assumption that network nodes exist in hidden metric spaces. Clus... | arxiv | @article{serrano2007self-similarity,
title={Self-similarity of complex networks and hidden metric spaces},
author={M. Angeles Serrano, Dmitri Krioukov, and Marian Boguna},
journal={Physical Review Letters 100, 078701 (2008)},
year={2007},
doi={10.1103/PhysRevLett.100.078701},
archivePrefix={arXi... | serrano2007self-similarity |
arxiv-1380 | 0710.2134 | Discrete entropies of orthogonal polynomials | <|reference_start|>Discrete entropies of orthogonal polynomials: Let $p_n$ be the $n$-th orthonormal polynomial on the real line, whose zeros are $\lambda_j^{(n)}$, $j=1, ..., n$. Then for each $j=1, ..., n$, $$ \vec \Psi_j^2 = (\Psi_{1j}^2, ..., \Psi_{nj}^2) $$ with $$ \Psi_{ij}^2= p_{i-1}^2 (\lambda_j^{(n)}) (\sum_{k... | arxiv | @article{aptekarev2007discrete,
title={Discrete entropies of orthogonal polynomials},
author={A.I. Aptekarev, J.S. Dehesa, A. Martinez-Finkelshtein, R. Ya~nez},
journal={arXiv preprint arXiv:0710.2134},
year={2007},
archivePrefix={arXiv},
eprint={0710.2134},
primaryClass={math.CA cs.IT math-... | aptekarev2007discrete |
arxiv-1381 | 0710.2139 | Approximation algorithms and hardness for domination with propagation | <|reference_start|>Approximation algorithms and hardness for domination with propagation: The power dominating set (PDS) problem is the following extension of the well-known dominating set problem: find a smallest-size set of nodes $S$ that power dominates all the nodes, where a node $v$ is power dominated if (1) $v$ i... | arxiv | @article{aazami2007approximation,
title={Approximation algorithms and hardness for domination with propagation},
author={Ashkan Aazami, Michael D. Stilp},
journal={arXiv preprint arXiv:0710.2139},
year={2007},
archivePrefix={arXiv},
eprint={0710.2139},
primaryClass={cs.CC cs.DM}
} | aazami2007approximation |
arxiv-1382 | 0710.2156 | Collaborative OLAP with Tag Clouds: Web 20 OLAP Formalism and Experimental Evaluation | <|reference_start|>Collaborative OLAP with Tag Clouds: Web 20 OLAP Formalism and Experimental Evaluation: Increasingly, business projects are ephemeral. New Business Intelligence tools must support ad-lib data sources and quick perusal. Meanwhile, tag clouds are a popular community-driven visualization technique. Hence... | arxiv | @article{aouiche2007collaborative,
title={Collaborative OLAP with Tag Clouds: Web 2.0 OLAP Formalism and
Experimental Evaluation},
author={Kamel Aouiche, Daniel Lemire and Robert Godin},
journal={arXiv preprint arXiv:0710.2156},
year={2007},
archivePrefix={arXiv},
eprint={0710.2156},
prima... | aouiche2007collaborative |
arxiv-1383 | 0710.2227 | A System for Predicting Subcellular Localization of Yeast Genome Using Neural Network | <|reference_start|>A System for Predicting Subcellular Localization of Yeast Genome Using Neural Network: The subcellular location of a protein can provide valuable information about its function. With the rapid increase of sequenced genomic data, the need for an automated and accurate tool to predict subcellular local... | arxiv | @article{thampi2007a,
title={A System for Predicting Subcellular Localization of Yeast Genome Using
Neural Network},
author={Sabu M. Thampi, K. Chandra Sekaran},
journal={arXiv preprint arXiv:0710.2227},
year={2007},
archivePrefix={arXiv},
eprint={0710.2227},
primaryClass={cs.NE cs.AI}
} | thampi2007a |
arxiv-1384 | 0710.2228 | Recommendation model based on opinion diffusion | <|reference_start|>Recommendation model based on opinion diffusion: Information overload in the modern society calls for highly efficient recommendation algorithms. In this letter we present a novel diffusion based recommendation model, with users' ratings built into a transition matrix. To speed up computation we intr... | arxiv | @article{zhang2007recommendation,
title={Recommendation model based on opinion diffusion},
author={Yi-Cheng Zhang, Matus Medo, Jie Ren, Tao Zhou, Tao Li, and Fan Yang},
journal={Europhysics Letters 80 (2007) 68003},
year={2007},
doi={10.1209/0295-5075/80/68003},
archivePrefix={arXiv},
eprint... | zhang2007recommendation |
arxiv-1385 | 0710.2231 | Comparison and Combination of State-of-the-art Techniques for Handwritten Character Recognition: Topping the MNIST Benchmark | <|reference_start|>Comparison and Combination of State-of-the-art Techniques for Handwritten Character Recognition: Topping the MNIST Benchmark: Although the recognition of isolated handwritten digits has been a research topic for many years, it continues to be of interest for the research community and for commercial ... | arxiv | @article{keysers2007comparison,
title={Comparison and Combination of State-of-the-art Techniques for
Handwritten Character Recognition: Topping the MNIST Benchmark},
author={Daniel Keysers},
journal={arXiv preprint arXiv:0710.2231},
year={2007},
archivePrefix={arXiv},
eprint={0710.2231},
p... | keysers2007comparison |
arxiv-1386 | 0710.2243 | Edge Local Complementation and Equivalence of Binary Linear Codes | <|reference_start|>Edge Local Complementation and Equivalence of Binary Linear Codes: Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of a binary linear code. The information sets and the minimum dist... | arxiv | @article{danielsen2007edge,
title={Edge Local Complementation and Equivalence of Binary Linear Codes},
author={Lars Eirik Danielsen and Matthew G. Parker},
journal={Des. Codes Cryptogr. 49(1-3), 161-170, 2008},
year={2007},
doi={10.1007/s10623-008-9190-x},
archivePrefix={arXiv},
eprint={0710... | danielsen2007edge |
arxiv-1387 | 0710.2268 | Complexity of some Path Problems in DAGs and Linear Orders | <|reference_start|>Complexity of some Path Problems in DAGs and Linear Orders: We investigate here the computational complexity of three natural problems in directed acyclic graphs. We prove their NP Completeness and consider their restrictions to linear orders.<|reference_end|> | arxiv | @article{burckel2007complexity,
title={Complexity of some Path Problems in DAGs and Linear Orders},
author={Serge Burckel},
journal={arXiv preprint arXiv:0710.2268},
year={2007},
archivePrefix={arXiv},
eprint={0710.2268},
primaryClass={math.CO cs.IT math.IT}
} | burckel2007complexity |
arxiv-1388 | 0710.2284 | Symmetric and Synchronous Communication in Peer-to-Peer Networks | <|reference_start|>Symmetric and Synchronous Communication in Peer-to-Peer Networks: Motivated by distributed implementations of game-theoretical algorithms, we study symmetric process systems and the problem of attaining common knowledge between processes. We formalize our setting by defining a notion of peer-to-peer ... | arxiv | @article{witzel2007symmetric,
title={Symmetric and Synchronous Communication in Peer-to-Peer Networks},
author={Andreas Witzel},
journal={arXiv preprint arXiv:0710.2284},
year={2007},
archivePrefix={arXiv},
eprint={0710.2284},
primaryClass={cs.DC cs.GT}
} | witzel2007symmetric |
arxiv-1389 | 0710.2296 | Vertex Percolation on Expander Graphs | <|reference_start|>Vertex Percolation on Expander Graphs: We say that a graph $G=(V,E)$ on $n$ vertices is a $\beta$-expander for some constant $\beta>0$ if every $U\subseteq V$ of cardinality $|U|\leq \frac{n}{2}$ satisfies $|N_G(U)|\geq \beta|U|$ where $N_G(U)$ denotes the neighborhood of $U$. In this work we explore... | arxiv | @article{ben-shimon2007vertex,
title={Vertex Percolation on Expander Graphs},
author={Sonny Ben-Shimon and Michael Krivelevich},
journal={European Journal of Combinatorics, 30(2), pp. 339-350, 2009},
year={2007},
doi={10.1016/j.ejc.2008.07.001},
archivePrefix={arXiv},
eprint={0710.2296},
... | ben-shimon2007vertex |
arxiv-1390 | 0710.2358 | Success and failure of programming environments - report on the design and use of a graphic abstract syntax tree editor | <|reference_start|>Success and failure of programming environments - report on the design and use of a graphic abstract syntax tree editor: The STAPLE project investigated (at the end of the eighties), a persistent architecture for functional programming. Work has been done in two directions: the development of a progr... | arxiv | @article{recanati2007success,
title={Success and failure of programming environments - report on the design
and use of a graphic abstract syntax tree editor},
author={C. Recanati},
journal={arXiv preprint arXiv:0710.2358},
year={2007},
number={Esprit project no. 891 (STAPLE), Technical Report no 9... | recanati2007success |
arxiv-1391 | 0710.2419 | The Variable Hierarchy for the Games mu-Calculus | <|reference_start|>The Variable Hierarchy for the Games mu-Calculus: Parity games are combinatorial representations of closed Boolean mu-terms. By adding to them draw positions, they have been organized by Arnold and one of the authors into a mu-calculus. As done by Berwanger et al. for the propositional modal mu-calcu... | arxiv | @article{belkhir2007the,
title={The Variable Hierarchy for the Games mu-Calculus},
author={Walid Belkhir (LIF), Luigi Santocanale (LIF)},
journal={arXiv preprint arXiv:0710.2419},
year={2007},
archivePrefix={arXiv},
eprint={0710.2419},
primaryClass={cs.LO cs.GT math.LO}
} | belkhir2007the |
arxiv-1392 | 0710.2446 | The structure of verbal sequences analyzed with unsupervised learning techniques | <|reference_start|>The structure of verbal sequences analyzed with unsupervised learning techniques: Data mining allows the exploration of sequences of phenomena, whereas one usually tends to focus on isolated phenomena or on the relation between two phenomena. It offers invaluable tools for theoretical analyses and ex... | arxiv | @article{recanati2007the,
title={The structure of verbal sequences analyzed with unsupervised learning
techniques},
author={Catherine Recanati (LIPN), Nicoleta Rogovschi (LIPN), Youn`es Bennani
(LIPN)},
journal={Dans Proceedings - The 3rd Language & Technology Conference: Human
Language Technologies a... | recanati2007the |
arxiv-1393 | 0710.2496 | Regression estimation from an individual stable sequence | <|reference_start|>Regression estimation from an individual stable sequence: We consider univariate regression estimation from an individual (non-random) sequence $(x_1,y_1),(x_2,y_2), ... \in \real \times \real$, which is stable in the sense that for each interval $A \subseteq \real$, (i) the limiting relative frequen... | arxiv | @article{morvai2007regression,
title={Regression estimation from an individual stable sequence},
author={Gusztav Morvai, Sanjeev R. Kulkarni, Andrew B. Nobel},
journal={Statistics 33 (1999), no. 2, 99--118},
year={2007},
archivePrefix={arXiv},
eprint={0710.2496},
primaryClass={math.PR cs.IT ... | morvai2007regression |
arxiv-1394 | 0710.2500 | Density estimation from an individual numerical sequence | <|reference_start|>Density estimation from an individual numerical sequence: This paper considers estimation of a univariate density from an individual numerical sequence. It is assumed that (i) the limiting relative frequencies of the numerical sequence are governed by an unknown density, and (ii) there is a known upp... | arxiv | @article{nobel2007density,
title={Density estimation from an individual numerical sequence},
author={Andrew B. Nobel, Gusztav Morvai, Sanjeev R. Kulkarni},
journal={IEEE Trans. Inform. Theory 44 (1998), no. 2, 537--541},
year={2007},
archivePrefix={arXiv},
eprint={0710.2500},
primaryClass={m... | nobel2007density |
arxiv-1395 | 0710.2505 | Generic Trace Semantics via Coinduction | <|reference_start|>Generic Trace Semantics via Coinduction: Trace semantics has been defined for various kinds of state-based systems, notably with different forms of branching such as non-determinism vs. probability. In this paper we claim to identify one underlying mathematical structure behind these "trace semantics... | arxiv | @article{hasuo2007generic,
title={Generic Trace Semantics via Coinduction},
author={Ichiro Hasuo, Bart Jacobs and Ana Sokolova},
journal={Logical Methods in Computer Science, Volume 3, Issue 4 (November
19, 2007) lmcs:864},
year={2007},
doi={10.2168/LMCS-3(4:11)2007},
archivePrefix={arXiv},
... | hasuo2007generic |
arxiv-1396 | 0710.2532 | Sleeping on the Job: Energy-Efficient Broadcast for Radio Networks | <|reference_start|>Sleeping on the Job: Energy-Efficient Broadcast for Radio Networks: We address the problem of minimizing power consumption when performing reliable broadcast on a radio network under the following popular model. Each node in the network is located on a point in a two dimensional grid, and whenever a ... | arxiv | @article{king2007sleeping,
title={Sleeping on the Job: Energy-Efficient Broadcast for Radio Networks},
author={Valerie King, Cynthia Phillips, Jared Saia and Maxwell Young},
journal={arXiv preprint arXiv:0710.2532},
year={2007},
archivePrefix={arXiv},
eprint={0710.2532},
primaryClass={cs.DS}... | king2007sleeping |
arxiv-1397 | 0710.2553 | Capacity of Linear Two-hop Mesh Networks with Rate Splitting, Decode-and-forward Relaying and Cooperation | <|reference_start|>Capacity of Linear Two-hop Mesh Networks with Rate Splitting, Decode-and-forward Relaying and Cooperation: A linear mesh network is considered in which a single user per cell communicates to a local base station via a dedicated relay (two-hop communication). Exploiting the possibly relevant inter-cel... | arxiv | @article{simeone2007capacity,
title={Capacity of Linear Two-hop Mesh Networks with Rate Splitting,
Decode-and-forward Relaying and Cooperation},
author={O. Simeone, O. Somekh, Y. Bar-Ness, H. V. Poor, and S. Shamai},
journal={In the Proceedings of the 45th Annual Allerton Conference on
Communication, Co... | simeone2007capacity |
arxiv-1398 | 0710.2604 | Efficient Skyline Querying with Variable User Preferences on Nominal Attributes | <|reference_start|>Efficient Skyline Querying with Variable User Preferences on Nominal Attributes: Current skyline evaluation techniques assume a fixed ordering on the attributes. However, dynamic preferences on nominal attributes are more realistic in known applications. In order to generate online response for any s... | arxiv | @article{wong2007efficient,
title={Efficient Skyline Querying with Variable User Preferences on Nominal
Attributes},
author={Raymond Chi-Wing Wong, Ada Wai-chee Fu, Jian Pei, Yip Sing Ho, Tai
Wong, Yubao Liu},
journal={arXiv preprint arXiv:0710.2604},
year={2007},
archivePrefix={arXiv},
epri... | wong2007efficient |
arxiv-1399 | 0710.2611 | Geometric Analogue of Holographic Reduced Representation | <|reference_start|>Geometric Analogue of Holographic Reduced Representation: Holographic reduced representations (HRR) are based on superpositions of convolution-bound $n$-tuples, but the $n$-tuples cannot be regarded as vectors since the formalism is basis dependent. This is why HRR cannot be associated with geometric... | arxiv | @article{aerts2007geometric,
title={Geometric Analogue of Holographic Reduced Representation},
author={Diederik Aerts, Marek Czachor, Bart De Moor},
journal={Journal of Mathematical Psychology 53, 389-398 (2009)},
year={2007},
archivePrefix={arXiv},
eprint={0710.2611},
primaryClass={cs.AI qu... | aerts2007geometric |
arxiv-1400 | 0710.2659 | Rigidity and persistence for ensuring shape maintenance of multiagent meta formations (ext'd version) | <|reference_start|>Rigidity and persistence for ensuring shape maintenance of multiagent meta formations (ext'd version): This paper treats the problem of the merging of formations, where the underlying model of a formation is graphical. We first analyze the rigidity and persistence of meta-formations, which are format... | arxiv | @article{hendrickx2007rigidity,
title={Rigidity and persistence for ensuring shape maintenance of multiagent
meta formations (ext'd version)},
author={Julien M. Hendrickx, Changbin Yu, Baris Fidan and Brian D.O. Anderson},
journal={arXiv preprint arXiv:0710.2659},
year={2007},
archivePrefix={arXiv... | hendrickx2007rigidity |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.