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-901 | 0708.0271 | Capacity Region of the Finite-State Multiple Access Channel with and without Feedback | <|reference_start|>Capacity Region of the Finite-State Multiple Access Channel with and without Feedback: 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 characterize both an inner and... | arxiv | @article{permuter2007capacity,
title={Capacity Region of the Finite-State Multiple Access Channel with and
without Feedback},
author={Haim Permuter, Tsachy Weissman},
journal={arXiv preprint arXiv:0708.0271},
year={2007},
archivePrefix={arXiv},
eprint={0708.0271},
primaryClass={cs.IT math.... | permuter2007capacity |
arxiv-902 | 0708.0353 | The Local Fractal Properties of the Financial Time Series on the Polish Stock Exchange Market | <|reference_start|>The Local Fractal Properties of the Financial Time Series on the Polish Stock Exchange Market: We investigate the local fractal properties of the financial time series based on the evolution of the Warsaw Stock Exchange Index (WIG) connected with the largest developing financial market in Europe. Cal... | arxiv | @article{grech2007the,
title={The Local Fractal Properties of the Financial Time Series on the Polish
Stock Exchange Market},
author={D. Grech, G. Pamu{l}a (University of Wroclaw, ITP)},
journal={arXiv preprint arXiv:0708.0353},
year={2007},
archivePrefix={arXiv},
eprint={0708.0353},
prima... | grech2007the |
arxiv-903 | 0708.0361 | Why the relational data model can be considered as a formal basis for group operations in object-oriented systems | <|reference_start|>Why the relational data model can be considered as a formal basis for group operations in object-oriented systems: Relational data model defines a specification of a type "relation". However, its simplicity does not mean that the system implementing this model must operate with structures having the ... | arxiv | @article{grigoriev2007why,
title={Why the relational data model can be considered as a formal basis for
group operations in object-oriented systems},
author={Evgeniy Grigoriev},
journal={arXiv preprint arXiv:0708.0361},
year={2007},
archivePrefix={arXiv},
eprint={0708.0361},
primaryClass={... | grigoriev2007why |
arxiv-904 | 0708.0386 | Diversity of MIMO Multihop Relay Channels | <|reference_start|>Diversity of MIMO Multihop Relay Channels: We consider slow fading relay channels with a single multi-antenna source-destination terminal pair. The source signal arrives at the destination via N hops through N-1 layers of relays. We analyze the diversity of such channels with fixed network size at hi... | arxiv | @article{yang2007diversity,
title={Diversity of MIMO Multihop Relay Channels},
author={Sheng Yang and Jean-Claude Belfiore},
journal={arXiv preprint arXiv:0708.0386},
year={2007},
archivePrefix={arXiv},
eprint={0708.0386},
primaryClass={cs.IT math.IT}
} | yang2007diversity |
arxiv-905 | 0708.0495 | Virtual Manufacturing : Tools for improving Design and Production | <|reference_start|>Virtual Manufacturing : Tools for improving Design and Production: The research area "Virtual Manufacturing" can be defined as an integrated manufacturing environment which can enhance one or several levels of decision and control in manufacturing process. Several domains can be addressed: Product an... | arxiv | @article{dépincé2007virtual,
title={Virtual Manufacturing : Tools for improving Design and Production},
author={Philippe D'epinc'e (IRCCyN), Damien Chablat (IRCCyN), Peer-Oliver
Woelk (IFW)},
journal={Dans International Design Seminar - CIRP International Design
Seminar, Caire : \'Egypte (2004)},
ye... | dépincé2007virtual |
arxiv-906 | 0708.0505 | A preliminary analysis on metaheuristics methods applied to the Haplotype Inference Problem | <|reference_start|>A preliminary analysis on metaheuristics methods applied to the Haplotype Inference Problem: Haplotype Inference is a challenging problem in bioinformatics that consists in inferring the basic genetic constitution of diploid organisms on the basis of their genotype. This information allows researcher... | arxiv | @article{di gaspero2007a,
title={A preliminary analysis on metaheuristics methods applied to the
Haplotype Inference Problem},
author={Luca Di Gaspero, Andrea Roli},
journal={arXiv preprint arXiv:0708.0505},
year={2007},
number={DEIS-LIA-006-07},
archivePrefix={arXiv},
eprint={0708.0505},
... | di gaspero2007a |
arxiv-907 | 0708.0522 | Quasi-stationary distributions as centrality measures of reducible graphs | <|reference_start|>Quasi-stationary distributions as centrality measures of reducible graphs: Random walk can be used as a centrality measure of a directed graph. However, if the graph is reducible the random walk will be absorbed in some subset of nodes and will never visit the rest of the graph. In Google PageRank th... | arxiv | @article{avrachenkov2007quasi-stationary,
title={Quasi-stationary distributions as centrality measures of reducible
graphs},
author={Konstantin Avrachenkov (INRIA Sophia Antipolis), Vivek Borkar, Danil
Nemirovsky (INRIA Sophia Antipolis)},
journal={arXiv preprint arXiv:0708.0522},
year={2007},
a... | avrachenkov2007quasi-stationary |
arxiv-908 | 0708.0580 | Efficient Divide-and-Conquer Implementations Of Symmetric FSAs | <|reference_start|>Efficient Divide-and-Conquer Implementations Of Symmetric FSAs: A deterministic finite-state automaton (FSA) is an abstract sequential machine that reads the symbols comprising an input word one at a time. An FSA is symmetric if its output is independent of the order in which the input symbols are re... | arxiv | @article{pritchard2007efficient,
title={Efficient Divide-and-Conquer Implementations Of Symmetric FSAs},
author={David Pritchard},
journal={Journal of Cellular Automata 5(6) (special issue for Automata
2007, H. Fuks & A. T. Lawniczak, eds), pages 481-490, 2010},
year={2007},
archivePrefix={arXiv},... | pritchard2007efficient |
arxiv-909 | 0708.0598 | An Application of Chromatic Prototypes | <|reference_start|>An Application of Chromatic Prototypes: This paper has been withdrawn.<|reference_end|> | arxiv | @article{mccool2007an,
title={An Application of Chromatic Prototypes},
author={Matthew McCool},
journal={arXiv preprint arXiv:0708.0598},
year={2007},
archivePrefix={arXiv},
eprint={0708.0598},
primaryClass={cs.HC cs.MM}
} | mccool2007an |
arxiv-910 | 0708.0600 | Complementary algorithms for graphs and percolation | <|reference_start|>Complementary algorithms for graphs and percolation: A pair of complementary algorithms are presented. One of the pair is a fast method for connecting graphs with an edge. The other is a fast method for removing edges from a graph. Both algorithms employ the same tree based graph representation and s... | arxiv | @article{lee2007complementary,
title={Complementary algorithms for graphs and percolation},
author={Michael J. Lee},
journal={arXiv preprint arXiv:0708.0600},
year={2007},
doi={10.1103/PhysRevE.76.027702},
archivePrefix={arXiv},
eprint={0708.0600},
primaryClass={cs.DS}
} | lee2007complementary |
arxiv-911 | 0708.0603 | Public Cluster : parallel machine with multi-block approach | <|reference_start|>Public Cluster : parallel machine with multi-block approach: We introduce a new approach to enable an open and public parallel machine which is accessible for multi users with multi jobs belong to different blocks running at the same time. The concept is required especially for parallel machines whic... | arxiv | @article{akbar2007public,
title={Public Cluster : parallel machine with multi-block approach},
author={Z. Akbar, Slamet, B. I. Ajinagoro, G.I. Ohara, I. Firmansyah, B.
Hermanto and L.T. Handoko},
journal={arXiv preprint arXiv:0708.0603},
year={2007},
number={FISIKALIPI-07002},
archivePrefix={a... | akbar2007public |
arxiv-912 | 0708.0604 | Introducing OPTO : Portal for Optical Communities in Indonesia | <|reference_start|>Introducing OPTO : Portal for Optical Communities in Indonesia: Since January 1, 2005 we have launched "OPTO" Portal, a website dedicated to optical communities in Indonesia. The address of this portal is http://www.opto.lipi.go.id and is self-supporting managed and not for commercial purposes. Our a... | arxiv | @article{waluyo2007introducing,
title={Introducing OPTO : Portal for Optical Communities in Indonesia},
author={T.B. Waluyo and L.T. Handoko},
journal={arXiv preprint arXiv:0708.0604},
year={2007},
number={FISIKALIPI-07006},
archivePrefix={arXiv},
eprint={0708.0604},
primaryClass={cs.CY}... | waluyo2007introducing |
arxiv-913 | 0708.0605 | Open and Free Cluster for Public | <|reference_start|>Open and Free Cluster for Public: We introduce the LIPI Public Cluster, the first parallel machine facility fully open for public and for free in Indonesia and surrounding countries. In this paper, we focus on explaining our globally new concept on open cluster, and how to realize and manage it to me... | arxiv | @article{akbar2007open,
title={Open and Free Cluster for Public},
author={Z. Akbar, Slamet, B. I. Ajinagoro, G.I. Ohara, I. Firmansyah, B.
Hermanto and L.T. Handoko},
journal={arXiv preprint arXiv:0708.0605},
year={2007},
number={FISIKALIPI-07003},
archivePrefix={arXiv},
eprint={0708.0605}... | akbar2007open |
arxiv-914 | 0708.0607 | Real-time control and monitoring system for LIPI's Public Cluster | <|reference_start|>Real-time control and monitoring system for LIPI's Public Cluster: We have developed a monitoring and control system for LIPI's Public Cluster. The system consists of microcontrollers and full web-based user interfaces for daily operation. It is argued that, due to its special natures, the cluster re... | arxiv | @article{firmansyah2007real-time,
title={Real-time control and monitoring system for LIPI's Public Cluster},
author={I. Firmansyah, B. Hermanto, Hadiyanto and L.T. Handoko},
journal={arXiv preprint arXiv:0708.0607},
year={2007},
number={FISIKALIPI-07004},
archivePrefix={arXiv},
eprint={0708.... | firmansyah2007real-time |
arxiv-915 | 0708.0608 | Resource Allocation in Public Cluster with Extended Optimization Algorithm | <|reference_start|>Resource Allocation in Public Cluster with Extended Optimization Algorithm: We introduce an optimization algorithm for resource allocation in the LIPI Public Cluster to optimize its usage according to incoming requests from users. The tool is an extended and modified genetic algorithm developed to ma... | arxiv | @article{akbar2007resource,
title={Resource Allocation in Public Cluster with Extended Optimization
Algorithm},
author={Z. Akbar and L.T. Handoko},
journal={arXiv preprint arXiv:0708.0608},
year={2007},
number={FISIKALIPI-07005},
archivePrefix={arXiv},
eprint={0708.0608},
primaryClass=... | akbar2007resource |
arxiv-916 | 0708.0624 | ADS-Directory Services for Mobile Ad-Hoc Networks Based on an Information Market Model | <|reference_start|>ADS-Directory Services for Mobile Ad-Hoc Networks Based on an Information Market Model: Ubiquitous computing based on small mobile devices using wireless communication links is becoming very attractive. The computational power and storage capacities provided allow the execution of sophisticated appli... | arxiv | @article{hutter2007ads-directory,
title={ADS-Directory Services for Mobile Ad-Hoc Networks Based on an
Information Market Model},
author={Christian Hutter, Matthias R. Brust, Steffen Rothkugel},
journal={arXiv preprint arXiv:0708.0624},
year={2007},
archivePrefix={arXiv},
eprint={0708.0624},
... | hutter2007ads-directory |
arxiv-917 | 0708.0627 | ADS as Information Management Service in an M-Learning Environment | <|reference_start|>ADS as Information Management Service in an M-Learning Environment: Leveraging the potential power of even small handheld devices able to communicate wirelessly requires dedicated support. In particular, collaborative applications need sophisticated assistance in terms of querying and exchanging diff... | arxiv | @article{brust2007ads,
title={ADS as Information Management Service in an M-Learning Environment},
author={Matthias R. Brust, Daniel Goergen, Christian Hutter, Steffen Rothkugel},
journal={arXiv preprint arXiv:0708.0627},
year={2007},
archivePrefix={arXiv},
eprint={0708.0627},
primaryClass={... | brust2007ads |
arxiv-918 | 0708.0648 | Auction-Based Distributed Resource Allocation for Cooperation Transmission in Wireless Networks | <|reference_start|>Auction-Based Distributed Resource Allocation for Cooperation Transmission in Wireless Networks: Cooperative transmission can greatly improve communication system performance by taking advantage of the broadcast nature of wireless channels. Most previous work on resource allocation for cooperation tr... | arxiv | @article{huang2007auction-based,
title={Auction-Based Distributed Resource Allocation for Cooperation
Transmission in Wireless Networks},
author={Jianwei Huang, Zhu Han, Mung Chiang, and H. Vincent Poor},
journal={arXiv preprint arXiv:0708.0648},
year={2007},
doi={10.1109/GLOCOM.2007.912},
arc... | huang2007auction-based |
arxiv-919 | 0708.0654 | Structure or Noise? | <|reference_start|>Structure or Noise?: We show how rate-distortion theory provides a mechanism for automated theory building by naturally distinguishing between regularity and randomness. We start from the simple principle that model variables should, as much as possible, render the future and past conditionally indep... | arxiv | @article{still2007structure,
title={Structure or Noise?},
author={Susanne Still, James P. Crutchfield},
journal={arXiv preprint arXiv:0708.0654},
year={2007},
archivePrefix={arXiv},
eprint={0708.0654},
primaryClass={physics.data-an cond-mat.stat-mech cs.IT cs.LG math-ph math.IT math.MP math.... | still2007structure |
arxiv-920 | 0708.0660 | Network synchronizability analysis: the theory of subgraphs and complementary graphs | <|reference_start|>Network synchronizability analysis: the theory of subgraphs and complementary graphs: In this paper, subgraphs and complementary graphs are used to analyze the network synchronizability. Some sharp and attainable bounds are provided for the eigenratio of the network structural matrix, which character... | arxiv | @article{duan2007network,
title={Network synchronizability analysis: the theory of subgraphs and
complementary graphs},
author={Zhisheng Duan, Chao Liu and Guanrong Chen},
journal={arXiv preprint arXiv:0708.0660},
year={2007},
doi={10.1016/j.physd.2007.12.003},
archivePrefix={arXiv},
eprin... | duan2007network |
arxiv-921 | 0708.0694 | Reconstruction of Protein-Protein Interaction Pathways by Mining Subject-Verb-Objects Intermediates | <|reference_start|>Reconstruction of Protein-Protein Interaction Pathways by Mining Subject-Verb-Objects Intermediates: The exponential increase in publication rate of new articles is limiting access of researchers to relevant literature. This has prompted the use of text mining tools to extract key biological informat... | arxiv | @article{ling2007reconstruction,
title={Reconstruction of Protein-Protein Interaction Pathways by Mining
Subject-Verb-Objects Intermediates},
author={Maurice HT Ling, Christophe Lefevre, Kevin R. Nicholas, and Feng Lin},
journal={Ling, Maurice HT, Lefevre, Christophe, Nicholas, Kevin R, Lin,
Feng. 2007.... | ling2007reconstruction |
arxiv-922 | 0708.0712 | Virtual Environments for Training: From Individual Learning to Collaboration with Humanoids | <|reference_start|>Virtual Environments for Training: From Individual Learning to Collaboration with Humanoids: The next generation of virtual environments for training is oriented towards collaborative aspects. Therefore, we have decided to enhance our platform for virtual training environments, adding collaboration o... | arxiv | @article{gerbaud2007virtual,
title={Virtual Environments for Training: From Individual Learning to
Collaboration with Humanoids},
author={St'ephanie Gerbaud (IRISA), Nicolas Mollet (IRISA), Bruno Arnaldi
(IRISA)},
journal={Dans Edutainment (2007)},
year={2007},
archivePrefix={arXiv},
eprint=... | gerbaud2007virtual |
arxiv-923 | 0708.0713 | Edit and verify | <|reference_start|>Edit and verify: Automated theorem provers are used in extended static checking, where they are the performance bottleneck. Extended static checkers are run typically after incremental changes to the code. We propose to exploit this usage pattern to improve performance. We present two approaches of h... | arxiv | @article{grigore2007edit,
title={Edit and verify},
author={Radu Grigore and Micha{l} Moskal},
journal={arXiv preprint arXiv:0708.0713},
year={2007},
archivePrefix={arXiv},
eprint={0708.0713},
primaryClass={cs.LO}
} | grigore2007edit |
arxiv-924 | 0708.0741 | Characterising Web Site Link Structure | <|reference_start|>Characterising Web Site Link Structure: The topological structures of the Internet and the Web have received considerable attention. However, there has been little research on the topological properties of individual web sites. In this paper, we consider whether web sites (as opposed to the entire We... | arxiv | @article{zhou2007characterising,
title={Characterising Web Site Link Structure},
author={Shi Zhou, Ingemar Cox and Vaclav Petricek},
journal={arXiv preprint arXiv:0708.0741},
year={2007},
doi={10.1109/WSE.2007.4380247},
archivePrefix={arXiv},
eprint={0708.0741},
primaryClass={cs.IR}
} | zhou2007characterising |
arxiv-925 | 0708.0805 | Cooperative Beamforming for Wireless Ad Hoc Networks | <|reference_start|>Cooperative Beamforming for Wireless Ad Hoc Networks: Via collaborative beamforming, nodes in a wireless network are able to transmit a common message over long distances in an energy efficient fashion. However, the process of making available the same message to all collaborating nodes introduces de... | arxiv | @article{dong2007cooperative,
title={Cooperative Beamforming for Wireless Ad Hoc Networks},
author={Lun Dong, Athina P. Petropulu and H. Vincent Poor},
journal={arXiv preprint arXiv:0708.0805},
year={2007},
doi={10.1109/GLOCOM.2007.560},
archivePrefix={arXiv},
eprint={0708.0805},
primary... | dong2007cooperative |
arxiv-926 | 0708.0846 | Cooperative game theory and the Gaussian interference channel | <|reference_start|>Cooperative game theory and the Gaussian interference channel: In this paper we discuss the use of cooperative game theory for analyzing interference channels. We extend our previous work, to games with N players as well as frequency selective channels and joint TDM/FDM strategies. We show that the... | arxiv | @article{leshem2007cooperative,
title={Cooperative game theory and the Gaussian interference channel},
author={Amir Leshem and Ephi Zehavi},
journal={arXiv preprint arXiv:0708.0846},
year={2007},
archivePrefix={arXiv},
eprint={0708.0846},
primaryClass={cs.IT cs.GT math.IT}
} | leshem2007cooperative |
arxiv-927 | 0708.0850 | Relations between random coding exponents and the statistical physics of random codes | <|reference_start|>Relations between random coding exponents and the statistical physics of random codes: The partition function pertaining to finite--temperature decoding of a (typical) randomly chosen code is known to have three types of behavior, corresponding to three phases in the plane of rate vs. temperature: th... | arxiv | @article{merhav2007relations,
title={Relations between random coding exponents and the statistical physics of
random codes},
author={Neri Merhav},
journal={arXiv preprint arXiv:0708.0850},
year={2007},
archivePrefix={arXiv},
eprint={0708.0850},
primaryClass={cs.IT math.IT}
} | merhav2007relations |
arxiv-928 | 0708.0877 | A Portal Analysis for the Design of a Collaborative Research Environment for Students and Supervisors (CRESS) within the CSCR Domain | <|reference_start|>A Portal Analysis for the Design of a Collaborative Research Environment for Students and Supervisors (CRESS) within the CSCR Domain: In a previous paper the CSCR domain was defined. Here this is taken to the next stage where we consider the design of a particular Collaborative Research Environment t... | arxiv | @article{hinze-hoare2007a,
title={A Portal Analysis for the Design of a Collaborative Research Environment
for Students and Supervisors (CRESS) within the CSCR Domain},
author={V. Hinze-Hoare},
journal={arXiv preprint arXiv:0708.0877},
year={2007},
archivePrefix={arXiv},
eprint={0708.0877},
... | hinze-hoare2007a |
arxiv-929 | 0708.0905 | Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes | <|reference_start|>Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes: We introduce the notion of the stopping redundancy hierarchy of a linear block code as a measure of the trade-off between performance and complexity of iterative decoding for the binary erasure channel. We... | arxiv | @article{hehn2007permutation,
title={Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and
Extended Cyclic Codes},
author={Thorsten Hehn, Olgica Milenkovic, Stefan Laendner, Johannes B. Huber},
journal={arXiv preprint arXiv:0708.0905},
year={2007},
doi={10.1109/TIT.2008.2006456}... | hehn2007permutation |
arxiv-930 | 0708.0909 | On the Self-stabilization of Mobile Robots in Graphs | <|reference_start|>On the Self-stabilization of Mobile Robots in Graphs: Self-stabilization is a versatile technique to withstand any transient fault in a distributed system. Mobile robots (or agents) are one of the emerging trends in distributed computing as they mimic autonomous biologic entities. The contribution of... | arxiv | @article{blin2007on,
title={On the Self-stabilization of Mobile Robots in Graphs},
author={L'elia Blin (IBISC), Maria Gradinariu Potop-Butucaru (INRIA
Rocquencourt, LIP6), S'ebastien Tixeuil (INRIA Futurs, LRI)},
journal={arXiv preprint arXiv:0708.0909},
year={2007},
archivePrefix={arXiv},
epr... | blin2007on |
arxiv-931 | 0708.0927 | Modeling Visual Information Processing in Brain: A Computer Vision Point of View and Approach | <|reference_start|>Modeling Visual Information Processing in Brain: A Computer Vision Point of View and Approach: We live in the Information Age, and information has become a critically important component of our life. The success of the Internet made huge amounts of it easily available and accessible to everyone. To k... | arxiv | @article{diamant2007modeling,
title={Modeling Visual Information Processing in Brain: A Computer Vision Point
of View and Approach},
author={Emanuel Diamant},
journal={Signal Processing: Image Communication, vol. 22, issue 6, pp.
583-590, July 2007},
year={2007},
archivePrefix={arXiv},
eprin... | diamant2007modeling |
arxiv-932 | 0708.0964 | Nodally 3-connected planar graphs and convex combination mappings | <|reference_start|>Nodally 3-connected planar graphs and convex combination mappings: A convex combination mapping of a planar graph is a plane mapping in which the external vertices are mapped to the corners of a convex polygon and every internal vertex is a proper weighted average of its neighbours. If a planar graph... | arxiv | @article{dunlaing2007nodally,
title={Nodally 3-connected planar graphs and convex combination mappings},
author={Colm O Dunlaing},
journal={arXiv preprint arXiv:0708.0964},
year={2007},
number={TCDMATH 06-16},
archivePrefix={arXiv},
eprint={0708.0964},
primaryClass={cs.CG}
} | dunlaing2007nodally |
arxiv-933 | 0708.0975 | Near Optimal Broadcast with Network Coding in Large Sensor Networks | <|reference_start|>Near Optimal Broadcast with Network Coding in Large Sensor Networks: We study efficient broadcasting for wireless sensor networks, with network coding. We address this issue for homogeneous sensor networks in the plane. Our results are based on a simple principle (IREN/IRON), which sets the same rate... | arxiv | @article{adjih2007near,
title={Near Optimal Broadcast with Network Coding in Large Sensor Networks},
author={C'edric Adjih (INRIA Rocquencourt), Song Yean Cho (INRIA
Rocquencourt), Philippe Jacquet (INRIA Rocquencourt)},
journal={arXiv preprint arXiv:0708.0975},
year={2007},
archivePrefix={arXiv},... | adjih2007near |
arxiv-934 | 0708.0977 | From symmetry break to Poisson point process in 2D Voronoi tessellations: the generic nature of hexagons | <|reference_start|>From symmetry break to Poisson point process in 2D Voronoi tessellations: the generic nature of hexagons: We bridge the properties of the regular square and honeycomb Voronoi tessellations of the plane to those of the Poisson-Voronoi case, thus analyzing in a common framework symmetry-break processes... | arxiv | @article{lucarini2007from,
title={From symmetry break to Poisson point process in 2D Voronoi
tessellations: the generic nature of hexagons},
author={Valerio Lucarini},
journal={J. Stat. Phys., 130, 1047-1062 (2008)},
year={2007},
doi={10.1007/s10955-007-9475-x},
archivePrefix={arXiv},
epri... | lucarini2007from |
arxiv-935 | 0708.1037 | A Formulation of the Channel Capacity of Multiple-Access Channel | <|reference_start|>A Formulation of the Channel Capacity of Multiple-Access Channel: The necessary and sufficient condition of the channel capacity is rigorously formulated for the N-user discrete memoryless multiple-access channel (MAC). The essence of the formulation is to invoke an {\em elementary} MAC where sizes o... | arxiv | @article{watanabe2007a,
title={A Formulation of the Channel Capacity of Multiple-Access Channel},
author={Yoichiro Watanabe and Koichi Kamoi},
journal={arXiv preprint arXiv:0708.1037},
year={2007},
number={Proc. 2002 IEEE Int'l Sym. on Information Theory, Lausanne, p.308,
2002},
archivePrefix=... | watanabe2007a |
arxiv-936 | 0708.1049 | An Interval Analysis Based Study for the Design and the Comparison of 3-DOF Parallel Kinematic Machines | <|reference_start|>An Interval Analysis Based Study for the Design and the Comparison of 3-DOF Parallel Kinematic Machines: This paper addresses an interval analysis based study that is applied to the design and the comparison of 3-DOF parallel kinematic machines. Two design criteria are used, (i) a regular workspace s... | arxiv | @article{chablat2007an,
title={An Interval Analysis Based Study for the Design and the Comparison of
3-DOF Parallel Kinematic Machines},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN), F'elix Majou
(IRCCyN), Jean-Pierre Merlet (INRIA Sophia-Antipolis)},
journal={International Journal of Robot... | chablat2007an |
arxiv-937 | 0708.1078 | Nearly MDS expander codes with reduced alphabet size | <|reference_start|>Nearly MDS expander codes with reduced alphabet size: Recently, Roth and Skachek proposed two methods for constructing nearly maximum-distance separable (MDS) expander codes. We show that through the simple modification of using mixed-alphabet codes derived from MDS codes as constituent codes in thei... | arxiv | @article{armand2007nearly,
title={Nearly MDS expander codes with reduced alphabet size},
author={Marc A. Armand, Jianwen Zhang},
journal={arXiv preprint arXiv:0708.1078},
year={2007},
archivePrefix={arXiv},
eprint={0708.1078},
primaryClass={cs.IT math.IT}
} | armand2007nearly |
arxiv-938 | 0708.1116 | A variant of the Recoil Growth algorithm to generate multi-polymer systems | <|reference_start|>A variant of the Recoil Growth algorithm to generate multi-polymer systems: The Recoil Growth algorithm, proposed in 1999 by Consta et al., is one of the most efficient algorithm available in the literature to sample from a multi-polymer system. Such problems are closely related to the generation of ... | arxiv | @article{simatos2007a,
title={A variant of the Recoil Growth algorithm to generate multi-polymer
systems},
author={Florian Simatos},
journal={arXiv preprint arXiv:0708.1116},
year={2007},
archivePrefix={arXiv},
eprint={0708.1116},
primaryClass={cs.CE cond-mat.stat-mech}
} | simatos2007a |
arxiv-939 | 0708.1150 | A Practical Ontology for the Large-Scale Modeling of Scholarly Artifacts and their Usage | <|reference_start|>A Practical Ontology for the Large-Scale Modeling of Scholarly Artifacts and their Usage: The large-scale analysis of scholarly artifact usage is constrained primarily by current practices in usage data archiving, privacy issues concerned with the dissemination of usage data, and the lack of a practi... | arxiv | @article{rodriguez2007a,
title={A Practical Ontology for the Large-Scale Modeling of Scholarly Artifacts
and their Usage},
author={Marko A. Rodriguez, Johah Bollen, Herbert Van de Sompel},
journal={Proceedings of the IEEE/ACM Joint Conference on Digital Libraries
(JCDL'07), pp. 278-287, 2007},
year=... | rodriguez2007a |
arxiv-940 | 0708.1179 | Diversity-Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks | <|reference_start|>Diversity-Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks: Synchronization of relay nodes is an important and critical issue in exploiting cooperative diversity in wireless networks. In this paper, two asynchronous cooperative diversity schemes are proposed, namely, d... | arxiv | @article{wei2007diversity-multiplexing,
title={Diversity-Multiplexing Tradeoff of Asynchronous Cooperative Diversity in
Wireless Networks},
author={Shuangqing Wei},
journal={arXiv preprint arXiv:0708.1179},
year={2007},
archivePrefix={arXiv},
eprint={0708.1179},
primaryClass={cs.IT math.IT... | wei2007diversity-multiplexing |
arxiv-941 | 0708.1211 | A Deterministic Sub-linear Time Sparse Fourier Algorithm via Non-adaptive Compressed Sensing Methods | <|reference_start|>A Deterministic Sub-linear Time Sparse Fourier Algorithm via Non-adaptive Compressed Sensing Methods: We study the problem of estimating the best B term Fourier representation for a given frequency-sparse signal (i.e., vector) $\textbf{A}$ of length $N \gg B$. More explicitly, we investigate how to d... | arxiv | @article{iwen2007a,
title={A Deterministic Sub-linear Time Sparse Fourier Algorithm via
Non-adaptive Compressed Sensing Methods},
author={M. A. Iwen},
journal={arXiv preprint arXiv:0708.1211},
year={2007},
archivePrefix={arXiv},
eprint={0708.1211},
primaryClass={cs.DM cs.NA}
} | iwen2007a |
arxiv-942 | 0708.1242 | Cost-minimising strategies for data labelling : optimal stopping and active learning | <|reference_start|>Cost-minimising strategies for data labelling : optimal stopping and active learning: Supervised learning deals with the inference of a distribution over an output or label space $\CY$ conditioned on points in an observation space $\CX$, given a training dataset $D$ of pairs in $\CX \times \CY$. Howe... | arxiv | @article{dimitrakakis2007cost-minimising,
title={Cost-minimising strategies for data labelling : optimal stopping and
active learning},
author={Christos Dimitrakakis and Christian Savu-Krohn},
journal={arXiv preprint arXiv:0708.1242},
year={2007},
archivePrefix={arXiv},
eprint={0708.1242},
... | dimitrakakis2007cost-minimising |
arxiv-943 | 0708.1343 | A Matrix Ring Description for Cyclic Convolutional Codes | <|reference_start|>A Matrix Ring Description for Cyclic Convolutional Codes: In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew polynomial ring is isomorphic to a matrix ring we can describe the ... | arxiv | @article{gluesing-luerssen2007a,
title={A Matrix Ring Description for Cyclic Convolutional Codes},
author={Heide Gluesing-Luerssen, Fai-Lung Tsang},
journal={arXiv preprint arXiv:0708.1343},
year={2007},
archivePrefix={arXiv},
eprint={0708.1343},
primaryClass={cs.IT math.IT math.RA}
} | gluesing-luerssen2007a |
arxiv-944 | 0708.1362 | Physical limits of inference | <|reference_start|>Physical limits of inference: I show that physical devices that perform observation, prediction, or recollection share an underlying mathematical structure. I call devices with that structure "inference devices". I present a set of existence and impossibility results concerning inference devices. The... | arxiv | @article{wolpert2007physical,
title={Physical limits of inference},
author={David H. Wolpert},
journal={PhysicaD237:1257-1281,2008},
year={2007},
doi={10.1016/j.physd.2008.03.040},
archivePrefix={arXiv},
eprint={0708.1362},
primaryClass={cond-mat.stat-mech cs.CC cs.IT gr-qc math.IT}
} | wolpert2007physical |
arxiv-945 | 0708.1411 | Achievable Outage Rates with Improved Decoding of Bicm Multiband Ofdm Under Channel Estimation Errors | <|reference_start|>Achievable Outage Rates with Improved Decoding of Bicm Multiband Ofdm Under Channel Estimation Errors: We consider the decoding of bit interleaved coded modulation (BICM) applied to multiband OFDM for practical scenarios where only a noisy (possibly very bad) estimate of the channel is available at t... | arxiv | @article{sadough2007achievable,
title={Achievable Outage Rates with Improved Decoding of Bicm Multiband Ofdm
Under Channel Estimation Errors},
author={Sajad Sadough (LSS), Pablo Piantanida (LSS), Pierre Duhamel (LSS)},
journal={Dans 40th Asilomar Conference on Signals, Systems, and Computers -
40th Asil... | sadough2007achievable |
arxiv-946 | 0708.1413 | On Optimal Turbo Decoding of Wideband MIMO-OFDM Systems Under Imperfect Channel State Information | <|reference_start|>On Optimal Turbo Decoding of Wideband MIMO-OFDM Systems Under Imperfect Channel State Information: We consider the decoding of bit interleaved coded modulation (BICM) applied to both multiband and MIMO OFDM systems for typical scenarios where only a noisy (possibly very bad) estimate of the channel i... | arxiv | @article{sadough2007on,
title={On Optimal Turbo Decoding of Wideband MIMO-OFDM Systems Under Imperfect
Channel State Information},
author={Sajad Sadough (LSS), Pierre Duhamel (LSS)},
journal={COST2100 Meeting, Lisbon : Portugal (2007)},
year={2007},
archivePrefix={arXiv},
eprint={0708.1413},
... | sadough2007on |
arxiv-947 | 0708.1414 | Wavelet Based Semi-blind Channel Estimation For Multiband OFDM | <|reference_start|>Wavelet Based Semi-blind Channel Estimation For Multiband OFDM: This paper introduces an expectation-maximization (EM) algorithm within a wavelet domain Bayesian framework for semi-blind channel estimation of multiband OFDM based UWB communications. A prior distribution is chosen for the wavelet coef... | arxiv | @article{sadough2007wavelet,
title={Wavelet Based Semi-blind Channel Estimation For Multiband OFDM},
author={Sajad Sadough (LSS), Mahieddine Ichir (LSS), Emmanuel Jaffrot, Pierre
Duhamel (LSS)},
journal={Dans European Wireless - European Wireless, Paris : France (2007)},
year={2007},
archivePrefix... | sadough2007wavelet |
arxiv-948 | 0708.1416 | MIMO-OFDM Optimal Decoding and Achievable Information Rates Under Imperfect Channel Estimation | <|reference_start|>MIMO-OFDM Optimal Decoding and Achievable Information Rates Under Imperfect Channel Estimation: Optimal decoding of bit interleaved coded modulation (BICM) MIMO-OFDM where an imperfect channel estimate is available at the receiver is investigated. First, by using a Bayesian approach involving the cha... | arxiv | @article{sadough2007mimo-ofdm,
title={MIMO-OFDM Optimal Decoding and Achievable Information Rates Under
Imperfect Channel Estimation},
author={Sajad Sadough (LSS), Pablo Piantanida (LSS), Pierre Duhamel (LSS)},
journal={Dans The VIII IEEE Workshop on Signal Processing Advances in
Wireless Communications... | sadough2007mimo-ofdm |
arxiv-949 | 0708.1480 | Valid formulas, games and network protocols | <|reference_start|>Valid formulas, games and network protocols: We describe a remarkable relation between the notion of valid formula of predicate logic and the specification of network protocols. We give several examples such as the acknowledgement of one packet or of a sequence of packets. We show how to specify the ... | arxiv | @article{krivine2007valid,
title={Valid formulas, games and network protocols},
author={Jean-Louis Krivine (PPS), Yves Legrandg'erard (PPS)},
journal={arXiv preprint arXiv:0708.1480},
year={2007},
archivePrefix={arXiv},
eprint={0708.1480},
primaryClass={cs.LO}
} | krivine2007valid |
arxiv-950 | 0708.1491 | On perfect, amicable, and sociable chains | <|reference_start|>On perfect, amicable, and sociable chains: Let $x = (x_0,...,x_{n-1})$ be an n-chain, i.e., an n-tuple of non-negative integers $< n$. Consider the operator $s: x \mapsto x' = (x'_0,...,x'_{n-1})$, where x'_j represents the number of $j$'s appearing among the components of x. An n-chain x is said to ... | arxiv | @article{marichal2007on,
title={On perfect, amicable, and sociable chains},
author={Jean-Luc Marichal},
journal={arXiv preprint arXiv:0708.1491},
year={2007},
archivePrefix={arXiv},
eprint={0708.1491},
primaryClass={math.CO cs.DM math.NT}
} | marichal2007on |
arxiv-951 | 0708.1496 | A Light-Based Device for Solving the Hamiltonian Path Problem | <|reference_start|>A Light-Based Device for Solving the Hamiltonian Path Problem: In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which uses light rays for solving the Hamiltonian path problem on a directed graph. The device has a graph-like representati... | arxiv | @article{oltean2007a,
title={A Light-Based Device for Solving the Hamiltonian Path Problem},
author={Mihai Oltean},
journal={LNCS 4135, Unconventional Computation conference, pp. 217-227,
2006},
year={2007},
doi={10.1007/11839132},
archivePrefix={arXiv},
eprint={0708.1496},
primaryClas... | oltean2007a |
arxiv-952 | 0708.1503 | Defensive forecasting for optimal prediction with expert advice | <|reference_start|>Defensive forecasting for optimal prediction with expert advice: The method of defensive forecasting is applied to the problem of prediction with expert advice for binary outcomes. It turns out that defensive forecasting is not only competitive with the Aggregating Algorithm but also handles the case... | arxiv | @article{vovk2007defensive,
title={Defensive forecasting for optimal prediction with expert advice},
author={Vladimir Vovk},
journal={arXiv preprint arXiv:0708.1503},
year={2007},
archivePrefix={arXiv},
eprint={0708.1503},
primaryClass={cs.LG}
} | vovk2007defensive |
arxiv-953 | 0708.1512 | Solving the Hamiltonian path problem with a light-based computer | <|reference_start|>Solving the Hamiltonian path problem with a light-based computer: In this paper we propose a special computational device which uses light rays for solving the Hamiltonian path problem on a directed graph. The device has a graph-like representation and the light is traversing it by following the rout... | arxiv | @article{oltean2007solving,
title={Solving the Hamiltonian path problem with a light-based computer},
author={Mihai Oltean},
journal={Natural Computing, Springer, Vol 6, 2007},
year={2007},
doi={10.1007/s11047-007-9042-z},
archivePrefix={arXiv},
eprint={0708.1512},
primaryClass={cs.AR cs... | oltean2007solving |
arxiv-954 | 0708.1527 | A Data-Parallel Version of Aleph | <|reference_start|>A Data-Parallel Version of Aleph: This is to present work on modifying the Aleph ILP system so that it evaluates the hypothesised clauses in parallel by distributing the data-set among the nodes of a parallel or distributed machine. The paper briefly discusses MPI, the interface used to access messag... | arxiv | @article{konstantopoulos2007a,
title={A Data-Parallel Version of Aleph},
author={Stasinos Konstantopoulos},
journal={arXiv preprint arXiv:0708.1527},
year={2007},
archivePrefix={arXiv},
eprint={0708.1527},
primaryClass={cs.AI cs.DC}
} | konstantopoulos2007a |
arxiv-955 | 0708.1529 | Resolution over Linear Equations and Multilinear Proofs | <|reference_start|>Resolution over Linear Equations and Multilinear Proofs: We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead of clauses. We demonstrate polynomial-size refutations for hard ... | arxiv | @article{raz2007resolution,
title={Resolution over Linear Equations and Multilinear Proofs},
author={Ran Raz, Iddo Tzameret},
journal={Annals of Pure and Applied Logic , 155(3):194-224, 2008;},
year={2007},
doi={10.1016/j.apal.2008.04.001},
archivePrefix={arXiv},
eprint={0708.1529},
prim... | raz2007resolution |
arxiv-956 | 0708.1558 | Construction of a 3-Dimensional MDS code | <|reference_start|>Construction of a 3-Dimensional MDS code: In this paper, we describe a procedure for constructing $q$--ary $[N,3,N-2]$--MDS codes, of length $N\leq q+1$ (for $q$ odd) or $N\leq q+2$ (for $q$ even), using a set of non--degenerate Hermitian forms in $PG(2,q^2)$.<|reference_end|> | arxiv | @article{aguglia2007construction,
title={Construction of a 3-Dimensional MDS code},
author={A. Aguglia, L. Giuzzi},
journal={Contributions to Discrete Mathematics 3 no. 1: 39-46 (2007)},
year={2007},
archivePrefix={arXiv},
eprint={0708.1558},
primaryClass={cs.IT math.IT}
} | aguglia2007construction |
arxiv-957 | 0708.1564 | Learning Phonotactics Using ILP | <|reference_start|>Learning Phonotactics Using ILP: This paper describes experiments on learning Dutch phonotactic rules using Inductive Logic Programming, a machine learning discipline based on inductive logical operators. Two different ways of approaching the problem are experimented with, and compared against each o... | arxiv | @article{konstantopoulos2007learning,
title={Learning Phonotactics Using ILP},
author={Stasinos Konstantopoulos},
journal={Special Issue of the WEB-SLS Journal: The Language Sections of the
ESSLLI-01 Student Session. 2002},
year={2007},
archivePrefix={arXiv},
eprint={0708.1564},
primaryCla... | konstantopoulos2007learning |
arxiv-958 | 0708.1579 | Homogeneous temporal activity patterns in a large online communication space | <|reference_start|>Homogeneous temporal activity patterns in a large online communication space: The many-to-many social communication activity on the popular technology-news website Slashdot has been studied. We have concentrated on the dynamics of message production without considering semantic relations and have fou... | arxiv | @article{kaltenbrunner2007homogeneous,
title={Homogeneous temporal activity patterns in a large online communication
space},
author={Andreas Kaltenbrunner, Vicenc{c} G'omez, Ayman Moghnieh, Rodrigo
Meza, Josep Blat, Vicente L'opez},
journal={arXiv preprint arXiv:0708.1579},
year={2007},
archiveP... | kaltenbrunner2007homogeneous |
arxiv-959 | 0708.1580 | Optimal Causal Inference: Estimating Stored Information and Approximating Causal Architecture | <|reference_start|>Optimal Causal Inference: Estimating Stored Information and Approximating Causal Architecture: We introduce an approach to inferring the causal architecture of stochastic dynamical systems that extends rate distortion theory to use causal shielding---a natural principle of learning. We study two dist... | arxiv | @article{still2007optimal,
title={Optimal Causal Inference: Estimating Stored Information and
Approximating Causal Architecture},
author={Susanne Still, James P. Crutchfield, Christopher J. Ellison},
journal={arXiv preprint arXiv:0708.1580},
year={2007},
archivePrefix={arXiv},
eprint={0708.158... | still2007optimal |
arxiv-960 | 0708.1593 | Updating Probabilities with Data and Moments | <|reference_start|>Updating Probabilities with Data and Moments: We use the method of Maximum (relative) Entropy to process information in the form of observed data and moment constraints. The generic "canonical" form of the posterior distribution for the problem of simultaneous updating with data and moments is obtain... | arxiv | @article{giffin2007updating,
title={Updating Probabilities with Data and Moments},
author={Adom Giffin and Ariel Caticha},
journal={arXiv preprint arXiv:0708.1593},
year={2007},
doi={10.1063/1.2821302},
archivePrefix={arXiv},
eprint={0708.1593},
primaryClass={physics.data-an cs.IT math.I... | giffin2007updating |
arxiv-961 | 0708.1624 | Designing a Collaborative Research Environment for Students and their Supervisors (CRESS) | <|reference_start|>Designing a Collaborative Research Environment for Students and their Supervisors (CRESS): In a previous paper the CSCR domain was defined. Here this is taken to the next stage where the design of a particular Collaborative Research Environment to support Students and Supervisors (CRESS) is considere... | arxiv | @article{hinze-hoare2007designing,
title={Designing a Collaborative Research Environment for Students and their
Supervisors (CRESS)},
author={V. Hinze-Hoare},
journal={arXiv preprint arXiv:0708.1624},
year={2007},
archivePrefix={arXiv},
eprint={0708.1624},
primaryClass={cs.HC}
} | hinze-hoare2007designing |
arxiv-962 | 0708.1723 | Hybrid Branching-Time Logics | <|reference_start|>Hybrid Branching-Time Logics: Hybrid branching-time logics are introduced as extensions of CTL-like logics with state variables and the downarrow-binder. Following recent work in the linear framework, only logics with a single variable are considered. The expressive power and the complexity of satisf... | arxiv | @article{weber2007hybrid,
title={Hybrid Branching-Time Logics},
author={Volker Weber},
journal={arXiv preprint arXiv:0708.1723},
year={2007},
archivePrefix={arXiv},
eprint={0708.1723},
primaryClass={cs.LO cs.CC}
} | weber2007hybrid |
arxiv-963 | 0708.1725 | Design: One, but in different forms | <|reference_start|>Design: One, but in different forms: This overview paper defends an augmented cognitively oriented generic-design hypothesis: there are both significant similarities between the design activities implemented in different situations and crucial differences between these and other cognitive activities;... | arxiv | @article{visser2007design:,
title={Design: One, but in different forms},
author={Willemien Visser (LTCI)},
journal={Design Studies 30, 3 (2009) 187-223},
year={2007},
doi={10.1016/j.destud.2008.11.004},
archivePrefix={arXiv},
eprint={0708.1725},
primaryClass={cs.HC}
} | visser2007design: |
arxiv-964 | 0708.1768 | Cryptanalysis of shifted conjugacy authentication protocol | <|reference_start|>Cryptanalysis of shifted conjugacy authentication protocol: In this paper we present the first practical attack on the shifted conjugacy-based authentication protocol proposed by P. Dehornoy. We discuss the weaknesses of that primitive and propose ways to improve the protocol.<|reference_end|> | arxiv | @article{longrigg2007cryptanalysis,
title={Cryptanalysis of shifted conjugacy authentication protocol},
author={Jonathan Longrigg and Alexander Ushakov},
journal={arXiv preprint arXiv:0708.1768},
year={2007},
archivePrefix={arXiv},
eprint={0708.1768},
primaryClass={math.GR cs.CR}
} | longrigg2007cryptanalysis |
arxiv-965 | 0708.1818 | Computational Simulation and 3D Virtual Reality Engineering Tools for Dynamical Modeling and Imaging of Composite Nanomaterials | <|reference_start|>Computational Simulation and 3D Virtual Reality Engineering Tools for Dynamical Modeling and Imaging of Composite Nanomaterials: An adventure at engineering design and modeling is possible with a Virtual Reality Environment (VRE) that uses multiple computer-generated media to let a user experience si... | arxiv | @article{bochkareva2007computational,
title={Computational Simulation and 3D Virtual Reality Engineering Tools for
Dynamical Modeling and Imaging of Composite Nanomaterials},
author={L.-V. Bochkareva, M.-V. Kireitseu, G. R. Tomlinson, H. Altenbach, V.
Kompis, D. Hui},
journal={Dans European Nano Systems... | bochkareva2007computational |
arxiv-966 | 0708.1859 | Multiple-Description Coding by Dithered Delta-Sigma Quantization | <|reference_start|>Multiple-Description Coding by Dithered Delta-Sigma Quantization: We address the connection between the multiple-description (MD) problem and Delta-Sigma quantization. The inherent redundancy due to oversampling in Delta-Sigma quantization, and the simple linear-additive noise model resulting from di... | arxiv | @article{ostergaard2007multiple-description,
title={Multiple-Description Coding by Dithered Delta-Sigma Quantization},
author={Jan Ostergaard and Ram Zamir},
journal={arXiv preprint arXiv:0708.1859},
year={2007},
archivePrefix={arXiv},
eprint={0708.1859},
primaryClass={cs.IT math.IT}
} | ostergaard2007multiple-description |
arxiv-967 | 0708.1877 | A nearly tight memory-redundancy trade-off for one-pass compression | <|reference_start|>A nearly tight memory-redundancy trade-off for one-pass compression: Let $s$ be a string of length $n$ over an alphabet of constant size $\sigma$ and let $c$ and $\epsilon$ be constants with (1 \geq c \geq 0) and (\epsilon > 0). Using (O (n)) time, (O (n^c)) bits of memory and one pass we can always ... | arxiv | @article{gagie2007a,
title={A nearly tight memory-redundancy trade-off for one-pass compression},
author={Travis Gagie},
journal={arXiv preprint arXiv:0708.1877},
year={2007},
archivePrefix={arXiv},
eprint={0708.1877},
primaryClass={cs.IT math.IT}
} | gagie2007a |
arxiv-968 | 0708.1903 | On Edge-Disjoint Pairs Of Matchings | <|reference_start|>On Edge-Disjoint Pairs Of Matchings: For a graph G, consider the pairs of edge-disjoint matchings whose union consists of as many edges as possible. Let H be the largest matching among such pairs. Let M be a maximum matching of G. We show that 5/4 is a tight upper bound for |M|/|H|.<|reference_end|> | arxiv | @article{mkrtchyan2007on,
title={On Edge-Disjoint Pairs Of Matchings},
author={V. V. Mkrtchyan, V. L. Musoyan, A. V. Tserunyan},
journal={Discrete Mathematics, 2008, Vol 308/23 pp 5823-5828},
year={2007},
doi={10.1016/j.disc.2007.09.061},
archivePrefix={arXiv},
eprint={0708.1903},
primar... | mkrtchyan2007on |
arxiv-969 | 0708.1909 | Lower Bounds for the Complexity of the Voronoi Diagram of Polygonal Curves under the Discrete Frechet Distance | <|reference_start|>Lower Bounds for the Complexity of the Voronoi Diagram of Polygonal Curves under the Discrete Frechet Distance: We give lower bounds for the combinatorial complexity of the Voronoi diagram of polygonal curves under the discrete Frechet distance. We show that the Voronoi diagram of n curves in R^d wit... | arxiv | @article{buchin2007lower,
title={Lower Bounds for the Complexity of the Voronoi Diagram of Polygonal
Curves under the Discrete Frechet Distance},
author={Kevin Buchin and Maike Buchin},
journal={arXiv preprint arXiv:0708.1909},
year={2007},
archivePrefix={arXiv},
eprint={0708.1909},
primar... | buchin2007lower |
arxiv-970 | 0708.1962 | Exact Cover with light | <|reference_start|>Exact Cover with light: We suggest a new optical solution for solving the YES/NO version of the Exact Cover problem by using the massive parallelism of light. The idea is to build an optical device which can generate all possible solutions of the problem and then to pick the correct one. In our case ... | arxiv | @article{oltean2007exact,
title={Exact Cover with light},
author={Mihai Oltean, Oana Muntean},
journal={New Generation Computing, Springer-Verlag, Vol. 26, Issue 4, pp.
327-344, 2008},
year={2007},
doi={10.1007/s00354-008-0049-5},
archivePrefix={arXiv},
eprint={0708.1962},
primaryClass... | oltean2007exact |
arxiv-971 | 0708.1964 | Solving the subset-sum problem with a light-based device | <|reference_start|>Solving the subset-sum problem with a light-based device: We propose a special computational device which uses light rays for solving the subset-sum problem. The device has a graph-like representation and the light is traversing it by following the routes given by the connections between nodes. The n... | arxiv | @article{oltean2007solving,
title={Solving the subset-sum problem with a light-based device},
author={Mihai Oltean, Oana Muntean},
journal={Natural Computing, Springer-Verlag, Vol 8, Issue 2, pp. 321-331,
2009},
year={2007},
doi={10.1007/s11047-007-9059-3},
archivePrefix={arXiv},
eprint={0... | oltean2007solving |
arxiv-972 | 0708.2021 | Who is the best connected EC researcher? Centrality analysis of the complex network of authors in evolutionary computation | <|reference_start|>Who is the best connected EC researcher? Centrality analysis of the complex network of authors in evolutionary computation: Co-authorship graphs (that is, the graph of authors linked by co-authorship of papers) are complex networks, which expresses the dynamics of a complex system. Only recently its ... | arxiv | @article{merelo2007who,
title={Who is the best connected EC researcher? Centrality analysis of the
complex network of authors in evolutionary computation},
author={Juan J. Merelo and Carlos Cotta},
journal={arXiv preprint arXiv:0708.2021},
year={2007},
archivePrefix={arXiv},
eprint={0708.2021}... | merelo2007who |
arxiv-973 | 0708.2023 | Nonantagonistic noisy duels of discrete type with an arbitrary number of actions | <|reference_start|>Nonantagonistic noisy duels of discrete type with an arbitrary number of actions: We study a nonzero-sum game of two players which is a generalization of the antagonistic noisy duel of discrete type. The game is considered from the point of view of various criterions of optimality. We prove existence... | arxiv | @article{positselskaya2007nonantagonistic,
title={Nonantagonistic noisy duels of discrete type with an arbitrary number of
actions},
author={Lyubov N. Positselskaya},
journal={arXiv preprint arXiv:0708.2023},
year={2007},
archivePrefix={arXiv},
eprint={0708.2023},
primaryClass={math.OC cs.... | positselskaya2007nonantagonistic |
arxiv-974 | 0708.2026 | Derivative of BICM Mutual Information | <|reference_start|>Derivative of BICM Mutual Information: In this letter we determine the derivative of the mutual information corresponding to bit-interleaved coded modulation systems. The derivative follows as a linear combination of minimum-mean-squared error functions of coded modulation sets. The result finds appl... | arxiv | @article{fabregas2007derivative,
title={Derivative of BICM Mutual Information},
author={Albert Guillen I Fabregas and Alfonso Martinez},
journal={arXiv preprint arXiv:0708.2026},
year={2007},
archivePrefix={arXiv},
eprint={0708.2026},
primaryClass={cs.IT math.IT}
} | fabregas2007derivative |
arxiv-975 | 0708.2076 | Repairing Inconsistent XML Write-Access Control Policies | <|reference_start|>Repairing Inconsistent XML Write-Access Control Policies: XML access control policies involving updates may contain security flaws, here called inconsistencies, in which a forbidden operation may be simulated by performing a sequence of allowed operations. This paper investigates the problem of decid... | arxiv | @article{bravo2007repairing,
title={Repairing Inconsistent XML Write-Access Control Policies},
author={Loreto Bravo, James Cheney and Irini Fundulaki},
journal={arXiv preprint arXiv:0708.2076},
year={2007},
archivePrefix={arXiv},
eprint={0708.2076},
primaryClass={cs.DB}
} | bravo2007repairing |
arxiv-976 | 0708.2078 | Obstructions to Genericity in Study of Parametric Problems in Control Theory | <|reference_start|>Obstructions to Genericity in Study of Parametric Problems in Control Theory: We investigate systems of equations, involving parameters from the point of view of both control theory and computer algebra. The equations might involve linear operators such as partial (q-)differentiation, (q-)shift, (q-)... | arxiv | @article{levandovskyy2007obstructions,
title={Obstructions to Genericity in Study of Parametric Problems in Control
Theory},
author={Viktor Levandovskyy and Eva Zerz},
journal={arXiv preprint arXiv:0708.2078},
year={2007},
archivePrefix={arXiv},
eprint={0708.2078},
primaryClass={math.OC cs... | levandovskyy2007obstructions |
arxiv-977 | 0708.2084 | Empirical entropy in context | <|reference_start|>Empirical entropy in context: We trace the history of empirical entropy, touching briefly on its relation to Markov processes, normal numbers, Shannon entropy, the Chomsky hierarchy, Kolmogorov complexity, Ziv-Lempel compression, de Bruijn sequences and stochastic complexity.<|reference_end|> | arxiv | @article{gagie2007empirical,
title={Empirical entropy in context},
author={Travis Gagie},
journal={arXiv preprint arXiv:0708.2084},
year={2007},
archivePrefix={arXiv},
eprint={0708.2084},
primaryClass={cs.IT math.IT}
} | gagie2007empirical |
arxiv-978 | 0708.2105 | Attribute Estimation and Testing Quasi-Symmetry | <|reference_start|>Attribute Estimation and Testing Quasi-Symmetry: A Boolean function is symmetric if it is invariant under all permutations of its arguments; it is quasi-symmetric if it is symmetric with respect to the arguments on which it actually depends. We present a test that accepts every quasi-symmetric functi... | arxiv | @article{majewski2007attribute,
title={Attribute Estimation and Testing Quasi-Symmetry},
author={Krzysztof Majewski and Nicholas Pippenger},
journal={arXiv preprint arXiv:0708.2105},
year={2007},
archivePrefix={arXiv},
eprint={0708.2105},
primaryClass={cs.CC}
} | majewski2007attribute |
arxiv-979 | 0708.2173 | Provenance as Dependency Analysis | <|reference_start|>Provenance as Dependency Analysis: Provenance is information recording the source, derivation, or history of some information. Provenance tracking has been studied in a variety of settings; however, although many design points have been explored, the mathematical or semantic foundations of data prove... | arxiv | @article{cheney2007provenance,
title={Provenance as Dependency Analysis},
author={James Cheney, Amal Ahmed, and Umut Acar},
journal={arXiv preprint arXiv:0708.2173},
year={2007},
archivePrefix={arXiv},
eprint={0708.2173},
primaryClass={cs.DB cs.PL}
} | cheney2007provenance |
arxiv-980 | 0708.2213 | Moderate Growth Time Series for Dynamic Combinatorics Modelisation | <|reference_start|>Moderate Growth Time Series for Dynamic Combinatorics Modelisation: Here, we present a family of time series with a simple growth constraint. This family can be the basis of a model to apply to emerging computation in business and micro-economy where global functions can be expressed from local rules... | arxiv | @article{jaff2007moderate,
title={Moderate Growth Time Series for Dynamic Combinatorics Modelisation},
author={Lua"i Jaff (LIPN), G'erard H.E. Duchamp (LIPN), Hatem Hadj Kacem,
Cyrille Bertelle (LITIS)},
journal={ECELM-2, Tirgu-Mures : Roumanie (2006)},
year={2007},
archivePrefix={arXiv},
epri... | jaff2007moderate |
arxiv-981 | 0708.2230 | Collection analysis for Horn clause programs | <|reference_start|>Collection analysis for Horn clause programs: We consider approximating data structures with collections of the items that they contain. For examples, lists, binary trees, tuples, etc, can be approximated by sets or multisets of the items within them. Such approximations can be used to provide partia... | arxiv | @article{miller2007collection,
title={Collection analysis for Horn clause programs},
author={Dale Miller (INRIA Futurs)},
journal={Dans International ACM SIGPLAN Conference on Principles and
Practice of Declarative Programming (2006)},
year={2007},
archivePrefix={arXiv},
eprint={0708.2230},
... | miller2007collection |
arxiv-982 | 0708.2252 | Focusing and Polarization in Intuitionistic Logic | <|reference_start|>Focusing and Polarization in Intuitionistic Logic: A focused proof system provides a normal form to cut-free proofs that structures the application of invertible and non-invertible inference rules. The focused proof system of Andreoli for linear logic has been applied to both the proof search and the... | arxiv | @article{liang2007focusing,
title={Focusing and Polarization in Intuitionistic Logic},
author={Chuck Liang, Dale Miller (INRIA Futurs)},
journal={Dans Computer Science Logic (2007)},
year={2007},
archivePrefix={arXiv},
eprint={0708.2252},
primaryClass={cs.LO}
} | liang2007focusing |
arxiv-983 | 0708.2255 | A Language for Generic Programming in the Large | <|reference_start|>A Language for Generic Programming in the Large: Generic programming is an effective methodology for developing reusable software libraries. Many programming languages provide generics and have features for describing interfaces, but none completely support the idioms used in generic programming. To ... | arxiv | @article{siek2007a,
title={A Language for Generic Programming in the Large},
author={Jeremy G. Siek and Andrew Lumsdaine},
journal={arXiv preprint arXiv:0708.2255},
year={2007},
archivePrefix={arXiv},
eprint={0708.2255},
primaryClass={cs.PL cs.SE}
} | siek2007a |
arxiv-984 | 0708.2266 | The study of a new gerrymandering methodology | <|reference_start|>The study of a new gerrymandering methodology: This paper is to obtain a simple dividing-diagram of the congressional districts, where the only limit is that each district should contain the same population if possibly. In order to solve this problem, we introduce three different standards of the "si... | arxiv | @article{kai2007the,
title={The study of a new gerrymandering methodology},
author={Pan Kai, Tan Yue and Jiang Sheng},
journal={arXiv preprint arXiv:0708.2266},
year={2007},
archivePrefix={arXiv},
eprint={0708.2266},
primaryClass={cs.CY}
} | kai2007the |
arxiv-985 | 0708.2270 | Capacity of the Degraded Half-Duplex Relay Channel | <|reference_start|>Capacity of the Degraded Half-Duplex Relay Channel: A discrete memoryless half-duplex relay channel is constructed from a broadcast channel from the source to the relay and destination and a multiple access channel from the source and relay to the destination. When the relay listens, the channel oper... | arxiv | @article{vijayakumaran2007capacity,
title={Capacity of the Degraded Half-Duplex Relay Channel},
author={Saravanan Vijayakumaran, Tan F. Wong and Tat M. Lok},
journal={arXiv preprint arXiv:0708.2270},
year={2007},
archivePrefix={arXiv},
eprint={0708.2270},
primaryClass={cs.IT math.IT}
} | vijayakumaran2007capacity |
arxiv-986 | 0708.2273 | Opportunism in Multiuser Relay Channels: Scheduling, Routing and Spectrum Reuse | <|reference_start|>Opportunism in Multiuser Relay Channels: Scheduling, Routing and Spectrum Reuse: In order to understand the key merits of multiuser diversity techniques in relay-assisted cellular multihop networks, this paper analyzes the spectral efficiency of opportunistic (i.e., channel-aware) scheduling algorith... | arxiv | @article{oyman2007opportunism,
title={Opportunism in Multiuser Relay Channels: Scheduling, Routing and
Spectrum Reuse},
author={Ozgur Oyman},
journal={IEEE International Symposium on Information Theory (ISIT), Nice,
France, June 2007},
year={2007},
doi={10.1109/ISIT.2007.4557240},
archivePre... | oyman2007opportunism |
arxiv-987 | 0708.2303 | Compositional Semantics Grounded in Commonsense Metaphysics | <|reference_start|>Compositional Semantics Grounded in Commonsense Metaphysics: We argue for a compositional semantics grounded in a strongly typed ontology that reflects our commonsense view of the world and the way we talk about it in ordinary language. Assuming the existence of such a structure, we show that the sem... | arxiv | @article{saba2007compositional,
title={Compositional Semantics Grounded in Commonsense Metaphysics},
author={Walid S. Saba},
journal={arXiv preprint arXiv:0708.2303},
year={2007},
archivePrefix={arXiv},
eprint={0708.2303},
primaryClass={cs.AI cs.CL}
} | saba2007compositional |
arxiv-988 | 0708.2309 | On Compact Routing for the Internet | <|reference_start|>On Compact Routing for the Internet: While there exist compact routing schemes designed for grids, trees, and Internet-like topologies that offer routing tables of sizes that scale logarithmically with the network size, we demonstrate in this paper that in view of recent results in compact routing re... | arxiv | @article{krioukov2007on,
title={On Compact Routing for the Internet},
author={Dmitri Krioukov, kc claffy, Kevin Fall, Arthur Brady},
journal={ACM SIGCOMM Computer Communication Review (CCR), v.37, n.3,
p.41-52, 2007},
year={2007},
doi={10.1145/1273445.1273450},
archivePrefix={arXiv},
eprin... | krioukov2007on |
arxiv-989 | 0708.2310 | Benefiting from Disorder: Source Coding for Unordered Data | <|reference_start|>Benefiting from Disorder: Source Coding for Unordered Data: The order of letters is not always relevant in a communication task. This paper discusses the implications of order irrelevance on source coding, presenting results in several major branches of source coding theory: lossless coding, universa... | arxiv | @article{varshney2007benefiting,
title={Benefiting from Disorder: Source Coding for Unordered Data},
author={Lav R. Varshney and Vivek K. Goyal},
journal={arXiv preprint arXiv:0708.2310},
year={2007},
archivePrefix={arXiv},
eprint={0708.2310},
primaryClass={cs.IT math.IT}
} | varshney2007benefiting |
arxiv-990 | 0708.2319 | On Semimeasures Predicting Martin-Loef Random Sequences | <|reference_start|>On Semimeasures Predicting Martin-Loef Random Sequences: Solomonoff's central result on induction is that the posterior of a universal semimeasure M converges rapidly and with probability 1 to the true sequence generating posterior mu, if the latter is computable. Hence, M is eligible as a universal ... | arxiv | @article{hutter2007on,
title={On Semimeasures Predicting Martin-Loef Random Sequences},
author={Marcus Hutter and Andrej Muchnik},
journal={Theoretical Computer Science, 382 (2007) 247-261},
year={2007},
archivePrefix={arXiv},
eprint={0708.2319},
primaryClass={cs.IT cs.LG math.IT math.PR}
} | hutter2007on |
arxiv-991 | 0708.2336 | Unsatisfiable Linear k-CNFs Exist, for every k | <|reference_start|>Unsatisfiable Linear k-CNFs Exist, for every k: We call a CNF formula linear if any two clauses have at most one variable in common. Let Linear k-SAT be the problem of deciding whether a given linear k-CNF formula is satisfiable. Here, a k-CNF formula is a CNF formula in which every clause has size e... | arxiv | @article{scheder2007unsatisfiable,
title={Unsatisfiable Linear k-CNFs Exist, for every k},
author={Dominik Scheder},
journal={arXiv preprint arXiv:0708.2336},
year={2007},
archivePrefix={arXiv},
eprint={0708.2336},
primaryClass={cs.DM cs.CC cs.LO}
} | scheder2007unsatisfiable |
arxiv-992 | 0708.2351 | Randomized algorithm for the k-server problem on decomposable spaces | <|reference_start|>Randomized algorithm for the k-server problem on decomposable spaces: We study the randomized k-server problem on metric spaces consisting of widely separated subspaces. We give a method which extends existing algorithms to larger spaces with the growth rate of the competitive quotients being at most... | arxiv | @article{nagy-györgy2007randomized,
title={Randomized algorithm for the k-server problem on decomposable spaces},
author={Judit Nagy-Gy"orgy},
journal={arXiv preprint arXiv:0708.2351},
year={2007},
archivePrefix={arXiv},
eprint={0708.2351},
primaryClass={cs.DS cs.DM}
} | nagy-györgy2007randomized |
arxiv-993 | 0708.2353 | Continuous and randomized defensive forecasting: unified view | <|reference_start|>Continuous and randomized defensive forecasting: unified view: Defensive forecasting is a method of transforming laws of probability (stated in game-theoretic terms as strategies for Sceptic) into forecasting algorithms. There are two known varieties of defensive forecasting: "continuous", in which S... | arxiv | @article{vovk2007continuous,
title={Continuous and randomized defensive forecasting: unified view},
author={Vladimir Vovk},
journal={arXiv preprint arXiv:0708.2353},
year={2007},
archivePrefix={arXiv},
eprint={0708.2353},
primaryClass={cs.LG}
} | vovk2007continuous |
arxiv-994 | 0708.2363 | On a constructive characterization of a class of trees related to pairs of disjoint matchings | <|reference_start|>On a constructive characterization of a class of trees related to pairs of disjoint matchings: For a graph consider the pairs of disjoint matchings which union contains as many edges as possible, and define a parameter $\alpha$ which eqauls the cardinality of the largest matching in those pairs. Also... | arxiv | @article{kamalian2007on,
title={On a constructive characterization of a class of trees related to pairs
of disjoint matchings},
author={R. R. Kamalian, V. V. Mkrtchyan},
journal={arXiv preprint arXiv:0708.2363},
year={2007},
archivePrefix={arXiv},
eprint={0708.2363},
primaryClass={cs.DM}
} | kamalian2007on |
arxiv-995 | 0708.2395 | Key Agreement and Authentication Schemes Using Non-Commutative Semigroups | <|reference_start|>Key Agreement and Authentication Schemes Using Non-Commutative Semigroups: We give a new two-pass authentication scheme, whichis a generalisation of an authentication scheme of Sibert-Dehornoy-Girault based on the Diffie-Hellman conjugacy problem. Compared to the above scheme, for some parameters it ... | arxiv | @article{chowdhury2007key,
title={Key Agreement and Authentication Schemes Using Non-Commutative
Semigroups},
author={M. M. Chowdhury},
journal={arXiv preprint arXiv:0708.2395},
year={2007},
archivePrefix={arXiv},
eprint={0708.2395},
primaryClass={cs.CR}
} | chowdhury2007key |
arxiv-996 | 0708.2397 | On the AAGL Protocol | <|reference_start|>On the AAGL Protocol: Recently the AAGL (Anshel-Anshel-Goldfeld-Lemieux) has been proposed which can be used for RFID tags. We give algorithms for the problem (we call the MSCSPv) on which the security of the AAGL protocol is based upon. Hence we give various attacks for general parameters on the rec... | arxiv | @article{chowdhury2007on,
title={On the AAGL Protocol},
author={M. M. Chowdhury},
journal={arXiv preprint arXiv:0708.2397},
year={2007},
archivePrefix={arXiv},
eprint={0708.2397},
primaryClass={cs.CR}
} | chowdhury2007on |
arxiv-997 | 0708.2414 | User Participation in Social Media: Digg Study | <|reference_start|>User Participation in Social Media: Digg Study: The social news aggregator Digg allows users to submit and moderate stories by voting on (digging) them. As is true of most social sites, user participation on Digg is non-uniformly distributed, with few users contributing a disproportionate fraction of... | arxiv | @article{lerman2007user,
title={User Participation in Social Media: Digg Study},
author={Kristina Lerman},
journal={arXiv preprint arXiv:0708.2414},
year={2007},
doi={10.1109/WI-IATW.2007.68},
archivePrefix={arXiv},
eprint={0708.2414},
primaryClass={cs.CY}
} | lerman2007user |
arxiv-998 | 0708.2432 | A structure from motion inequality | <|reference_start|>A structure from motion inequality: We state an elementary inequality for the structure from motion problem for m cameras and n points. This structure from motion inequality relates space dimension, camera parameter dimension, the number of cameras and number points and global symmetry properties and... | arxiv | @article{knill2007a,
title={A structure from motion inequality},
author={Oliver Knill and Jose Ramirez-Herran},
journal={arXiv preprint arXiv:0708.2432},
year={2007},
archivePrefix={arXiv},
eprint={0708.2432},
primaryClass={cs.CV cs.AI}
} | knill2007a |
arxiv-999 | 0708.2438 | On Ullman's theorem in computer vision | <|reference_start|>On Ullman's theorem in computer vision: Both in the plane and in space, we invert the nonlinear Ullman transformation for 3 points and 3 orthographic cameras. While Ullman's theorem assures a unique reconstruction modulo a reflection for 3 cameras and 4 points, we find a locally unique reconstruction... | arxiv | @article{knill2007on,
title={On Ullman's theorem in computer vision},
author={Oliver Knill and Jose Ramirez-Herran},
journal={arXiv preprint arXiv:0708.2438},
year={2007},
archivePrefix={arXiv},
eprint={0708.2438},
primaryClass={cs.CV cs.AI}
} | knill2007on |
arxiv-1000 | 0708.2442 | Space and camera path reconstruction for omni-directional vision | <|reference_start|>Space and camera path reconstruction for omni-directional vision: In this paper, we address the inverse problem of reconstructing a scene as well as the camera motion from the image sequence taken by an omni-directional camera. Our structure from motion results give sharp conditions under which the r... | arxiv | @article{knill2007space,
title={Space and camera path reconstruction for omni-directional vision},
author={Oliver Knill and Jose Ramirez-Herran},
journal={arXiv preprint arXiv:0708.2442},
year={2007},
archivePrefix={arXiv},
eprint={0708.2442},
primaryClass={cs.CV cs.AI}
} | knill2007space |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.