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-3001 | 0803.1217 | Hsiao-Code Check Matrices and Recursively Balanced Matrices | <|reference_start|>Hsiao-Code Check Matrices and Recursively Balanced Matrices: The key step of generating the well-known Hsiao code is to construct a {0,1}-check-matrix in which each column contains the same odd-number of 1's and each row contains the same number of 1's or differs at most by one for the number of 1's.... | arxiv | @article{chen2008hsiao-code,
title={Hsiao-Code Check Matrices and Recursively Balanced Matrices},
author={Li Chen},
journal={arXiv preprint arXiv:0803.1217},
year={2008},
archivePrefix={arXiv},
eprint={0803.1217},
primaryClass={cs.DM}
} | chen2008hsiao-code |
arxiv-3002 | 0803.1220 | 22-Step Collisions for SHA-2 | <|reference_start|>22-Step Collisions for SHA-2: In this note, we provide the first 22-step collisions for SHA-256 and SHA-512. Detailed technique of generating these collisions will be provided in the next revision of this note.<|reference_end|> | arxiv | @article{sanadhya200822-step,
title={22-Step Collisions for SHA-2},
author={Somitra Kumar Sanadhya and Palash Sarkar},
journal={arXiv preprint arXiv:0803.1220},
year={2008},
archivePrefix={arXiv},
eprint={0803.1220},
primaryClass={cs.CR}
} | sanadhya200822-step |
arxiv-3003 | 0803.1221 | Non-Singular Assembly-mode Changing Motions for 3-RPR Parallel Manipulators | <|reference_start|>Non-Singular Assembly-mode Changing Motions for 3-RPR Parallel Manipulators: When moving from one arbitrary location at another, a parallel manipulator may change its assembly-mode without crossing a singularity. Because the non-singular change of assembly-mode cannot be simply detected, the actual a... | arxiv | @article{zein2008non-singular,
title={Non-Singular Assembly-mode Changing Motions for 3-RPR Parallel
Manipulators},
author={Mazen Zein (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={Mechanism and Machine Theory 23, 4 (2008) 480-490},
year={2008},
archivePrefix={arXiv},
... | zein2008non-singular |
arxiv-3004 | 0803.1227 | Linear programming bounds for unitary space time codes | <|reference_start|>Linear programming bounds for unitary space time codes: The linear programming method is applied to the space $\U_n(\C)$ of unitary matrices in order to obtain bounds for codes relative to the diversity sum and the diversity product. Theoretical and numerical results improving previously known bounds... | arxiv | @article{creignou2008linear,
title={Linear programming bounds for unitary space time codes},
author={Jean Creignou (IMB), Herv'e Diet (IMB)},
journal={arXiv preprint arXiv:0803.1227},
year={2008},
archivePrefix={arXiv},
eprint={0803.1227},
primaryClass={cs.IT math.IT}
} | creignou2008linear |
arxiv-3005 | 0803.1245 | The shortest game of Chinese Checkers and related problems | <|reference_start|>The shortest game of Chinese Checkers and related problems: In 1979, David Fabian found a complete game of two-person Chinese Checkers in 30 moves (15 by each player) [Martin Gardner, Penrose Tiles to Trapdoor Ciphers, MAA, 1997]. This solution requires that the two players cooperate to generate a wi... | arxiv | @article{bell2008the,
title={The shortest game of Chinese Checkers and related problems},
author={George I. Bell},
journal={INTEGERS: Electronic Journal of Combinatorial Number Theory 9
(2009) #G01},
year={2008},
archivePrefix={arXiv},
eprint={0803.1245},
primaryClass={math.CO cs.DM cs.DS}... | bell2008the |
arxiv-3006 | 0803.1296 | On the Topology of the Restricted Delaunay Triangulation and Witness Complex in Higher Dimensions | <|reference_start|>On the Topology of the Restricted Delaunay Triangulation and Witness Complex in Higher Dimensions: It is a well-known fact that, under mild sampling conditions, the restricted Delaunay triangulation provides good topological approximations of 1- and 2-manifolds. We show that this is not the case for ... | arxiv | @article{oudot2008on,
title={On the Topology of the Restricted Delaunay Triangulation and Witness
Complex in Higher Dimensions},
author={Steve Y. Oudot},
journal={arXiv preprint arXiv:0803.1296},
year={2008},
archivePrefix={arXiv},
eprint={0803.1296},
primaryClass={cs.CG}
} | oudot2008on |
arxiv-3007 | 0803.1321 | Treewidth computation and extremal combinatorics | <|reference_start|>Treewidth computation and extremal combinatorics: For a given graph G and integers b,f >= 0, let S be a subset of vertices of G of size b+1 such that the subgraph of G induced by S is connected and S can be separated from other vertices of G by removing f vertices. We prove that every graph on n vert... | arxiv | @article{fomin2008treewidth,
title={Treewidth computation and extremal combinatorics},
author={Fedor V. Fomin and Yngve Villanger},
journal={arXiv preprint arXiv:0803.1321},
year={2008},
archivePrefix={arXiv},
eprint={0803.1321},
primaryClass={cs.DS}
} | fomin2008treewidth |
arxiv-3008 | 0803.1323 | A Game Theoretic Framework for Decentralized Power Allocation in IDMA Systems | <|reference_start|>A Game Theoretic Framework for Decentralized Power Allocation in IDMA Systems: In this contribution we present a decentralized power allocation algorithm for the uplink interleave division multiple access (IDMA) channel. Within the proposed optimal strategy for power allocation, each user aims at sel... | arxiv | @article{perlaza2008a,
title={A Game Theoretic Framework for Decentralized Power Allocation in IDMA
Systems},
author={Samir Medina Perlaza, Laura Cottatellucci, Merouane Debbah},
journal={arXiv preprint arXiv:0803.1323},
year={2008},
doi={10.1109/PIMRC.2008.4699708},
archivePrefix={arXiv},
... | perlaza2008a |
arxiv-3009 | 0803.1360 | On the need for a global academic internet platform | <|reference_start|>On the need for a global academic internet platform: The article collects arguments for the necessity of a global academic internet platform, which is organized as a kind of ``global scientific parliament''. With such a constitution educational and research institutions will have direct means for com... | arxiv | @article{kutz2008on,
title={On the need for a global academic internet platform},
author={Nadja Kutz},
journal={arXiv preprint arXiv:0803.1360},
year={2008},
archivePrefix={arXiv},
eprint={0803.1360},
primaryClass={cs.CY}
} | kutz2008on |
arxiv-3010 | 0803.1393 | On inversion formulas and Fibonomial coefficients | <|reference_start|>On inversion formulas and Fibonomial coefficients: A research problem for undergraduates and graduates is being posed as a cap for the prior antecedent regular discrete mathematics exercises. [Here cap is not necessarily CAP=Competitive Access Provider, though nevertheless ...] The object of the cap ... | arxiv | @article{kwaśniewski2008on,
title={On inversion formulas and Fibonomial coefficients},
author={A. Krzysztof Kwa'sniewski, Ewa Krot-Sieniawska},
journal={Proc. Jangjeon Math. Soc. volume 11 (1), 2008 (June),65-68},
year={2008},
archivePrefix={arXiv},
eprint={0803.1393},
primaryClass={math.CO ... | kwaśniewski2008on |
arxiv-3011 | 0803.1416 | New formulas for Stirling-like numbers and Dobinski-like formulas | <|reference_start|>New formulas for Stirling-like numbers and Dobinski-like formulas: Extensions of the $Stirling$ numbers of the second kind and $Dobinski$ -like formulas are proposed in a series of exercises for graduates. Some of these new formulas recently discovered by me are to be found in the source paper $ [1]$... | arxiv | @article{kwasniewski2008new,
title={New formulas for Stirling-like numbers and Dobinski-like formulas},
author={A. K. Kwasniewski},
journal={Proc. Jangjeon Math. Soc. Vol. 11 No 2, (2008),137-144},
year={2008},
archivePrefix={arXiv},
eprint={0803.1416},
primaryClass={math.CO cs.DM}
} | kwasniewski2008new |
arxiv-3012 | 0803.1443 | Lexical growth, entropy and the benefits of networking | <|reference_start|>Lexical growth, entropy and the benefits of networking: If each node of an idealized network has an equal capacity to efficiently exchange benefits, then the network's capacity to use energy is scaled by the average amount of energy required to connect any two of its nodes. The scaling factor equals ... | arxiv | @article{shour2008lexical,
title={Lexical growth, entropy and the benefits of networking},
author={Robert Shour},
journal={arXiv preprint arXiv:0803.1443},
year={2008},
archivePrefix={arXiv},
eprint={0803.1443},
primaryClass={cs.IT math.IT q-bio.QM}
} | shour2008lexical |
arxiv-3013 | 0803.1445 | Distributed Joint Source-Channel Coding on a Multiple Access Channel with Side Information | <|reference_start|>Distributed Joint Source-Channel Coding on a Multiple Access Channel with Side Information: We consider the problem of transmission of several distributed sources over a multiple access channel (MAC) with side information at the sources and the decoder. Source-channel separation does not hold for thi... | arxiv | @article{rajesh2008distributed,
title={Distributed Joint Source-Channel Coding on a Multiple Access Channel
with Side Information},
author={R. Rajesh and Vinod Sharma},
journal={arXiv preprint arXiv:0803.1445},
year={2008},
number={TR-PME-2008-01},
archivePrefix={arXiv},
eprint={0803.1445}... | rajesh2008distributed |
arxiv-3014 | 0803.1454 | Tight Bounds on the Capacity of Binary Input random CDMA Systems | <|reference_start|>Tight Bounds on the Capacity of Binary Input random CDMA Systems: We consider multiple access communication on a binary input additive white Gaussian noise channel using randomly spread code division. For a general class of symmetric distributions for spreading coefficients, in the limit of a large n... | arxiv | @article{korada2008tight,
title={Tight Bounds on the Capacity of Binary Input random CDMA Systems},
author={Satish Babu Korada, Nicolas Macris},
journal={arXiv preprint arXiv:0803.1454},
year={2008},
archivePrefix={arXiv},
eprint={0803.1454},
primaryClass={cs.IT math.IT}
} | korada2008tight |
arxiv-3015 | 0803.1457 | Hybrid Reasoning and the Future of Iconic Representations | <|reference_start|>Hybrid Reasoning and the Future of Iconic Representations: We give a brief overview of the main characteristics of diagrammatic reasoning, analyze a case of human reasoning in a mastermind game, and explain why hybrid representation systems (HRS) are particularly attractive and promising for Artifici... | arxiv | @article{recanati2008hybrid,
title={Hybrid Reasoning and the Future of Iconic Representations},
author={Catherine Recanati (LIPN)},
journal={Dans Artificial General Intelligence 2008 - The First AGI
Conference, Memphis, Tennessee : \'Etats-Unis d'Am\'erique (2008)},
year={2008},
archivePrefix={arX... | recanati2008hybrid |
arxiv-3016 | 0803.1500 | NCore: Architecture and Implementation of a Flexible, Collaborative Digital Library | <|reference_start|>NCore: Architecture and Implementation of a Flexible, Collaborative Digital Library: NCore is an open source architecture and software platform for creating flexible, collaborative digital libraries. NCore was developed by the National Science Digital Library (NSDL) project, and it serves as the cent... | arxiv | @article{krafft2008ncore:,
title={NCore: Architecture and Implementation of a Flexible, Collaborative
Digital Library},
author={Dean B. Krafft, Aaron Birkland, Ellen J. Cramer},
journal={arXiv preprint arXiv:0803.1500},
year={2008},
archivePrefix={arXiv},
eprint={0803.1500},
primaryClass={... | krafft2008ncore: |
arxiv-3017 | 0803.1511 | The Capacity Region of the Degraded Finite-State Broadcast Channel | <|reference_start|>The Capacity Region of the Degraded Finite-State Broadcast Channel: We consider the discrete, time-varying broadcast channel with memory under the assumption that the channel states belong to a set of finite cardinality. We first define the physically degraded finite-state broadcast channel for which... | arxiv | @article{dabora2008the,
title={The Capacity Region of the Degraded Finite-State Broadcast Channel},
author={Ron Dabora and Andrea Goldsmith},
journal={arXiv preprint arXiv:0803.1511},
year={2008},
archivePrefix={arXiv},
eprint={0803.1511},
primaryClass={cs.IT math.IT}
} | dabora2008the |
arxiv-3018 | 0803.1520 | Integrity-Enhancing Replica Coordination for Byzantine Fault Tolerant Systems | <|reference_start|>Integrity-Enhancing Replica Coordination for Byzantine Fault Tolerant Systems: Strong replica consistency is often achieved by writing deterministic applications, or by using a variety of mechanisms to render replicas deterministic. There exists a large body of work on how to render replicas determin... | arxiv | @article{zhao2008integrity-enhancing,
title={Integrity-Enhancing Replica Coordination for Byzantine Fault Tolerant
Systems},
author={Wenbing Zhao},
journal={arXiv preprint arXiv:0803.1520},
year={2008},
archivePrefix={arXiv},
eprint={0803.1520},
primaryClass={cs.DC}
} | zhao2008integrity-enhancing |
arxiv-3019 | 0803.1521 | Proactive Service Migration for Long-Running Byzantine Fault Tolerant Systems | <|reference_start|>Proactive Service Migration for Long-Running Byzantine Fault Tolerant Systems: In this paper, we describe a novel proactive recovery scheme based on service migration for long-running Byzantine fault tolerant systems. Proactive recovery is an essential method for ensuring long term reliability of fau... | arxiv | @article{zhao2008proactive,
title={Proactive Service Migration for Long-Running Byzantine Fault Tolerant
Systems},
author={Wenbing Zhao},
journal={arXiv preprint arXiv:0803.1521},
year={2008},
archivePrefix={arXiv},
eprint={0803.1521},
primaryClass={cs.DC}
} | zhao2008proactive |
arxiv-3020 | 0803.1555 | Privacy Preserving ID3 over Horizontally, Vertically and Grid Partitioned Data | <|reference_start|>Privacy Preserving ID3 over Horizontally, Vertically and Grid Partitioned Data: We consider privacy preserving decision tree induction via ID3 in the case where the training data is horizontally or vertically distributed. Furthermore, we consider the same problem in the case where the data is both ho... | arxiv | @article{kuijpers2008privacy,
title={Privacy Preserving ID3 over Horizontally, Vertically and Grid
Partitioned Data},
author={Bart Kuijpers, Vanessa Lemmens, Bart Moelans and Karl Tuyls},
journal={arXiv preprint arXiv:0803.1555},
year={2008},
archivePrefix={arXiv},
eprint={0803.1555},
prim... | kuijpers2008privacy |
arxiv-3021 | 0803.1568 | Dempster-Shafer for Anomaly Detection | <|reference_start|>Dempster-Shafer for Anomaly Detection: In this paper, we implement an anomaly detection system using the Dempster-Shafer method. Using two standard benchmark problems we show that by combining multiple signals it is possible to achieve better results than by using a single signal. We further show tha... | arxiv | @article{chen2008dempster-shafer,
title={Dempster-Shafer for Anomaly Detection},
author={Qi Chen and Uwe Aickelin},
journal={Proceedings of the International Conference on Data Mining (DMIN
2006), pp 232-238, Las Vegas, USA 2006},
year={2008},
archivePrefix={arXiv},
eprint={0803.1568},
pri... | chen2008dempster-shafer |
arxiv-3022 | 0803.1575 | A Quantifier Elimination Algorithm for Linear Real Arithmetic | <|reference_start|>A Quantifier Elimination Algorithm for Linear Real Arithmetic: We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutine satisfiability modulo this theory, a problem for which there are several implementations available. The quantifi... | arxiv | @article{monniaux2008a,
title={A Quantifier Elimination Algorithm for Linear Real Arithmetic},
author={David Monniaux (VERIMAG - Imag)},
journal={arXiv preprint arXiv:0803.1575},
year={2008},
archivePrefix={arXiv},
eprint={0803.1575},
primaryClass={cs.LO}
} | monniaux2008a |
arxiv-3023 | 0803.1576 | Simulation Optimization of the Crossdock Door Assignment Problem | <|reference_start|>Simulation Optimization of the Crossdock Door Assignment Problem: The purpose of this report is to present the Crossdock Door Assignment Problem, which involves assigning destinations to outbound dock doors of Crossdock centres such that travel distance by material handling equipment is minimized. We... | arxiv | @article{aickelin2008simulation,
title={Simulation Optimization of the Crossdock Door Assignment Problem},
author={Uwe Aickelin and Adrian Adewunmi},
journal={UK Operational Research Society Simulation Workshop 2006 (SW
2006), Leamington Spa, UK 2006},
year={2008},
archivePrefix={arXiv},
eprin... | aickelin2008simulation |
arxiv-3024 | 0803.1586 | Spatio-activity based object detection | <|reference_start|>Spatio-activity based object detection: We present the SAMMI lightweight object detection method which has a high level of accuracy and robustness, and which is able to operate in an environment with a large number of cameras. Background modeling is based on DCT coefficients provided by cameras. Fore... | arxiv | @article{springett2008spatio-activity,
title={Spatio-activity based object detection},
author={Jarrad Springett, Jeroen Vendrig},
journal={arXiv preprint arXiv:0803.1586},
year={2008},
archivePrefix={arXiv},
eprint={0803.1586},
primaryClass={cs.CV}
} | springett2008spatio-activity |
arxiv-3025 | 0803.1596 | Using Intelligent Agents to understand organisational behaviour | <|reference_start|>Using Intelligent Agents to understand organisational behaviour: This paper introduces two ongoing research projects which seek to apply computer modelling techniques in order to simulate human behaviour within organisations. Previous research in other disciplines has suggested that complex social be... | arxiv | @article{celia2008using,
title={Using Intelligent Agents to understand organisational behaviour},
author={Helen Celia, Christopher Clegg, Mark Robinson, Peer-Olaf Siebers, Uwe
Aickelin and Christine Sprigg},
journal={Proceedings of the British Psychology Society Annual Conference,
Occupational Psycholog... | celia2008using |
arxiv-3026 | 0803.1598 | A Multi-Agent Simulation of Retail Management Practices | <|reference_start|>A Multi-Agent Simulation of Retail Management Practices: We apply Agent-Based Modeling and Simulation (ABMS) to investigate a set of problems in a retail context. Specifically, we are working to understand the relationship between human resource management practices and retail productivity. Despite t... | arxiv | @article{siebers2008a,
title={A Multi-Agent Simulation of Retail Management Practices},
author={Peer-Olaf Siebers, Uwe Aickelin, Helen Celia and Christopher Clegg},
journal={Proceedings of the Summer Computer Simulation Conference (SCSC
2007), pp 959-966, San Diego, USA 2007},
year={2008},
archive... | siebers2008a |
arxiv-3027 | 0803.1600 | Understanding Retail Productivity by Simulating Management Practise | <|reference_start|>Understanding Retail Productivity by Simulating Management Practise: Intelligent agents offer a new and exciting way of understanding the world of work. In this paper we apply agent-based modeling and simulation to investigate a set of problems in a retail context. Specifically, we are working to und... | arxiv | @article{siebers2008understanding,
title={Understanding Retail Productivity by Simulating Management Practise},
author={Peer-Olaf Siebers, Uwe Aickelin, Helen Celia and Christopher Clegg},
journal={Proceedings of the EUROSIM Congress on Modelling and Simulation
(EUROSIM 2007), pp 1-12, Ljubljana, Slovenia... | siebers2008understanding |
arxiv-3028 | 0803.1604 | Using Intelligent Agents to Understand Management Practices and Retail Productivity | <|reference_start|>Using Intelligent Agents to Understand Management Practices and Retail Productivity: Intelligent agents offer a new and exciting way of understanding the world of work. In this paper we apply agent-based modeling and simulation to investigate a set of problems in a retail context. Specifically, we ar... | arxiv | @article{siebers2008using,
title={Using Intelligent Agents to Understand Management Practices and Retail
Productivity},
author={Peer-Olaf Siebers, Uwe Aickelin, Helen Celia and Christopher Clegg},
journal={Proceedings of the Winter Simulation Conference (WSC 2007), pp
2212-2220, Washington, USA 2007},
... | siebers2008using |
arxiv-3029 | 0803.1610 | A Queueing System for Modeling a File Sharing Principle | <|reference_start|>A Queueing System for Modeling a File Sharing Principle: We investigate in this paper the performance of a simple file sharing principle. For this purpose, we consider a system composed of N peers becoming active at exponential random times; the system is initiated with only one server offering the d... | arxiv | @article{simatos2008a,
title={A Queueing System for Modeling a File Sharing Principle},
author={Florian Simatos, Philippe Robert, Fabrice Guillemin (FT R&D)},
journal={Dans ACM Sigmetrics (2008)},
year={2008},
archivePrefix={arXiv},
eprint={0803.1610},
primaryClass={cs.NI}
} | simatos2008a |
arxiv-3030 | 0803.1621 | An Agent-Based Simulation of In-Store Customer Experiences | <|reference_start|>An Agent-Based Simulation of In-Store Customer Experiences: Agent-based modelling and simulation offers a new and exciting way of understanding the world of work. In this paper we describe the development of an agent-based simulation model, designed to help to understand the relationship between huma... | arxiv | @article{siebers2008an,
title={An Agent-Based Simulation of In-Store Customer Experiences},
author={Peer-Olaf Siebers, Uwe Aickelin, Helen Celia and Christopher Clegg},
journal={Operational Research Society 4th Simulation Workshop (SW08), in
print, pp, Worcestershire, UK 2008},
year={2008},
archiv... | siebers2008an |
arxiv-3031 | 0803.1626 | Genetic-Algorithm Seeding Of Idiotypic Networks For Mobile-Robot Navigation | <|reference_start|>Genetic-Algorithm Seeding Of Idiotypic Networks For Mobile-Robot Navigation: Robot-control designers have begun to exploit the properties of the human immune system in order to produce dynamic systems that can adapt to complex, varying, real-world tasks. Jernes idiotypic-network theory has proved the... | arxiv | @article{whitbrook2008genetic-algorithm,
title={Genetic-Algorithm Seeding Of Idiotypic Networks For Mobile-Robot
Navigation},
author={Amanda Whitbrook, Uwe Aickelin and Jonathan Garibaldi},
journal={Proceedings of the International Conference on Informatics in
Control, Automation and Robotics (ICINCO 20... | whitbrook2008genetic-algorithm |
arxiv-3032 | 0803.1672 | Self-Assembly of Discrete Self-Similar Fractals | <|reference_start|>Self-Assembly of Discrete Self-Similar Fractals: In this paper, we search for {\it absolute} limitations of the Tile Assembly Model (TAM), along with techniques to work around such limitations. Specifically, we investigate the self-assembly of fractal shapes in the TAM. We prove that no self-similar ... | arxiv | @article{patitz2008self-assembly,
title={Self-Assembly of Discrete Self-Similar Fractals},
author={Matthew J. Patitz, and Scott M. Summers},
journal={arXiv preprint arXiv:0803.1672},
year={2008},
archivePrefix={arXiv},
eprint={0803.1672},
primaryClass={cs.CC cs.DM}
} | patitz2008self-assembly |
arxiv-3033 | 0803.1695 | Use of self-correlation metrics for evaluation of information properties of binary strings | <|reference_start|>Use of self-correlation metrics for evaluation of information properties of binary strings: It is demonstrated that appropriately chosen computable metrics based on self-correlation properties provide a degree of determinism sufficient to segregate binary strings by level of information content.<|ref... | arxiv | @article{viznyuk2008use,
title={Use of self-correlation metrics for evaluation of information properties
of binary strings},
author={S.Viznyuk},
journal={arXiv preprint arXiv:0803.1695},
year={2008},
archivePrefix={arXiv},
eprint={0803.1695},
primaryClass={cs.IT math.IT}
} | viznyuk2008use |
arxiv-3034 | 0803.1716 | Citation Counting, Citation Ranking, and h-Index of Human-Computer Interaction Researchers: A Comparison between Scopus and Web of Science | <|reference_start|>Citation Counting, Citation Ranking, and h-Index of Human-Computer Interaction Researchers: A Comparison between Scopus and Web of Science: This study examines the differences between Scopus and Web of Science in the citation counting, citation ranking, and h-index of 22 top human-computer interactio... | arxiv | @article{meho2008citation,
title={Citation Counting, Citation Ranking, and h-Index of Human-Computer
Interaction Researchers: A Comparison between Scopus and Web of Science},
author={Lokman I. Meho and Yvonne Rogers},
journal={arXiv preprint arXiv:0803.1716},
year={2008},
archivePrefix={arXiv},
... | meho2008citation |
arxiv-3035 | 0803.1723 | Estimation of available bandwidth and measurement infrastructure for Russian segment of Internet | <|reference_start|>Estimation of available bandwidth and measurement infrastructure for Russian segment of Internet: In paper the method for estimation of available bandwidth is supposed which does not demand the advanced utilities. Our method is based on the measurement of network delay $D$ for packets of different si... | arxiv | @article{platonov2008estimation,
title={Estimation of available bandwidth and measurement infrastructure for
Russian segment of Internet},
author={A. P. Platonov, D. I. Sidelnikov, M. V. Strizhov, A. M. Sukhov},
journal={arXiv preprint arXiv:0803.1723},
year={2008},
archivePrefix={arXiv},
epri... | platonov2008estimation |
arxiv-3036 | 0803.1728 | Investigating a Hybrid Metaheuristic For Job Shop Rescheduling | <|reference_start|>Investigating a Hybrid Metaheuristic For Job Shop Rescheduling: Previous research has shown that artificial immune systems can be used to produce robust schedules in a manufacturing environment. The main goal is to develop building blocks (antibodies) of partial schedules that can be used to construc... | arxiv | @article{abdullah2008investigating,
title={Investigating a Hybrid Metaheuristic For Job Shop Rescheduling},
author={Salwani Abdullah, Uwe Aickelin, Edmund Burke, Aniza Din and Rong Qu},
journal={Proceedings of the 3rd Australian Conference on Artificial Life
(ACAL07), Lecture Notes in Computer Science 482... | abdullah2008investigating |
arxiv-3037 | 0803.1733 | Degrees of Freedom of the MIMO Interference Channel with Cooperation and Cognition | <|reference_start|>Degrees of Freedom of the MIMO Interference Channel with Cooperation and Cognition: In this paper, we explore the benefits, in the sense of total (sum rate) degrees of freedom (DOF), of cooperation and cognitive message sharing for a two-user multiple-input-multiple-output (MIMO) Gaussian interferenc... | arxiv | @article{huang2008degrees,
title={Degrees of Freedom of the MIMO Interference Channel with Cooperation and
Cognition},
author={Chiachi Huang and Syed A. Jafar},
journal={arXiv preprint arXiv:0803.1733},
year={2008},
archivePrefix={arXiv},
eprint={0803.1733},
primaryClass={cs.IT math.IT}
} | huang2008degrees |
arxiv-3038 | 0803.1748 | A Computational Framework for the Near Elimination of Spreadsheet Risk | <|reference_start|>A Computational Framework for the Near Elimination of Spreadsheet Risk: We present Risk Integrated's Enterprise Spreadsheet Platform (ESP), a technical approach to the near-elimination of spreadsheet risk in the enterprise computing environment, whilst maintaining the full flexibility of spreadsheets... | arxiv | @article{jafry2008a,
title={A Computational Framework for the Near Elimination of Spreadsheet Risk},
author={Yusuf Jafry, Fredrika Sidoroff, Roger Chi},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2006 85-93
ISBN:1-905617-08-9},
year={2008},
archivePrefix={arXiv},
eprint={080... | jafry2008a |
arxiv-3039 | 0803.1751 | TellTable Spreadsheet Audit: from Technical Possibility to Operating Prototype | <|reference_start|>TellTable Spreadsheet Audit: from Technical Possibility to Operating Prototype: At the 2003 EuSpRIG meeting, we presented a framework and software infrastructure to generate and analyse an audit trail for a spreadsheet file. This report describes the results of a pilot implementation of this software... | arxiv | @article{nash2008telltable,
title={TellTable Spreadsheet Audit: from Technical Possibility to Operating
Prototype},
author={John Nash, Andy Adler, Neil Smith},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2004
45-55ISBN 1 902724 94 1},
year={2008},
archivePrefix={arXiv},
epr... | nash2008telltable |
arxiv-3040 | 0803.1754 | A Novel Approach to Formulae Production and Overconfidence Measurement to Reduce Risk in Spreadsheet Modelling | <|reference_start|>A Novel Approach to Formulae Production and Overconfidence Measurement to Reduce Risk in Spreadsheet Modelling: Research on formulae production in spreadsheets has established the practice as high risk yet unrecognised as such by industry. There are numerous software applications that are designed to... | arxiv | @article{thorne2008a,
title={A Novel Approach to Formulae Production and Overconfidence Measurement
to Reduce Risk in Spreadsheet Modelling},
author={Simon Thorne, David Ball, Zoe Lawson},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2004 71-83
ISBN 1 902724 94 1},
year={2008},
... | thorne2008a |
arxiv-3041 | 0803.1764 | WiFly: experimenting with Wireless Sensor Networks and Virtual coordinates | <|reference_start|>WiFly: experimenting with Wireless Sensor Networks and Virtual coordinates: Experimentation is important when designing communication protocols for Wireless Sensor Networks. Lower-layers have a major impact on upper-layer performance, and the complexity of the phenomena can not be entirely captured b... | arxiv | @article{watteyne2008wifly:,
title={WiFly: experimenting with Wireless Sensor Networks and Virtual
coordinates},
author={Thomas Watteyne (INRIA Rh^one-Alpes, FT R&D), Dominique Barthel (FT
R&D), Mischa Dohler (CTTC), Isabelle Aug'e-Blum (INRIA Rh^one-Alpes)},
journal={arXiv preprint arXiv:0803.1764},
... | watteyne2008wifly: |
arxiv-3042 | 0803.1807 | Minimum-Delay Decoding of Turbo-Codes for Upper-Layer FEC | <|reference_start|>Minimum-Delay Decoding of Turbo-Codes for Upper-Layer FEC: In this paper we investigate the decoding of parallel turbo codes over the binary erasure channel suited for upper-layer error correction. The proposed algorithm performs on-the-fly decoding, i.e. it starts decoding as soon as the first symbo... | arxiv | @article{kraidy2008minimum-delay,
title={Minimum-Delay Decoding of Turbo-Codes for Upper-Layer FEC},
author={Ghassan M. Kraidy and Valentin Savin},
journal={arXiv preprint arXiv:0803.1807},
year={2008},
archivePrefix={arXiv},
eprint={0803.1807},
primaryClass={cs.IT math.IT}
} | kraidy2008minimum-delay |
arxiv-3043 | 0803.1830 | On Winning Conditions of High Borel Complexity in Pushdown Games | <|reference_start|>On Winning Conditions of High Borel Complexity in Pushdown Games: Some decidable winning conditions of arbitrarily high finite Borel complexity for games on finite graphs or on pushdown graphs have been recently presented by O. Serre in [ Games with Winning Conditions of High Borel Complexity, in the... | arxiv | @article{finkel2008on,
title={On Winning Conditions of High Borel Complexity in Pushdown Games},
author={Olivier Finkel (ELM)},
journal={Fundamenta Informaticae 66 (3) (2005) 277-298},
year={2008},
archivePrefix={arXiv},
eprint={0803.1830},
primaryClass={cs.LO cs.GT math.LO}
} | finkel2008on |
arxiv-3044 | 0803.1841 | On the Topological Complexity of Infinitary Rational Relations | <|reference_start|>On the Topological Complexity of Infinitary Rational Relations: We prove in this paper that there exists some infinitary rational relations which are analytic but non Borel sets, giving an answer to a question of Simonnet [Automates et Th\'eorie Descriptive, Ph. D. Thesis, Universit\'e Paris 7, March... | arxiv | @article{finkel2008on,
title={On the Topological Complexity of Infinitary Rational Relations},
author={Olivier Finkel (ELM)},
journal={RAIRO-Theoretical Informatics and Applications 37 (2) (2003)
105-113},
year={2008},
archivePrefix={arXiv},
eprint={0803.1841},
primaryClass={cs.LO cs.CC ma... | finkel2008on |
arxiv-3045 | 0803.1842 | Closure Properties of Locally Finite Omega Languages | <|reference_start|>Closure Properties of Locally Finite Omega Languages: Locally finite omega languages were introduced by Ressayre in [Journal of Symbolic Logic, Volume 53, No. 4, p.1009-1026]. They generalize omega languages accepted by finite automata or defined by monadic second order sentences. We study here closu... | arxiv | @article{finkel2008closure,
title={Closure Properties of Locally Finite Omega Languages},
author={Olivier Finkel (ELM)},
journal={Theoretical Computer Science 322 (1) (2004) 69-84},
year={2008},
archivePrefix={arXiv},
eprint={0803.1842},
primaryClass={cs.LO math.LO}
} | finkel2008closure |
arxiv-3046 | 0803.1862 | Exploring Human Factors in Spreadsheet Development | <|reference_start|>Exploring Human Factors in Spreadsheet Development: In this paper we consider human factors and their impact on spreadsheet development in strategic decision-making. This paper brings forward research from many disciplines both directly related to spreadsheets and a broader spectrum from psychology t... | arxiv | @article{thorne2008exploring,
title={Exploring Human Factors in Spreadsheet Development},
author={Simon Thorne, David Ball},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2005 161-172
ISBN:1-902724-16-X},
year={2008},
archivePrefix={arXiv},
eprint={0803.1862},
primaryClass=... | thorne2008exploring |
arxiv-3047 | 0803.1866 | Risk Management for Complex Calculations: EuSpRIG Best Practices in Hybrid Applications | <|reference_start|>Risk Management for Complex Calculations: EuSpRIG Best Practices in Hybrid Applications: As the need for advanced, interactive mathematical models has increased, user/programmers are increasingly choosing the MatLab scripting language over spreadsheets. However, applications developed in these tools ... | arxiv | @article{cernauskas2008risk,
title={Risk Management for Complex Calculations: EuSpRIG Best Practices in
Hybrid Applications},
author={Deborah Cernauskas, Andrew Kumiega, Ben VanVliet},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2007 25-36
ISBN 978-905617-58-6},
year={2008},
ar... | cernauskas2008risk |
arxiv-3048 | 0803.1875 | Breaking Out of the Cell: On The Benefits of a New Spreadsheet User-Interaction Paradigm | <|reference_start|>Breaking Out of the Cell: On The Benefits of a New Spreadsheet User-Interaction Paradigm: Contemporary spreadsheets are plagued by a profusion of errors, auditing difficulties, lack of uniform development methodologies, and barriers to easy comprehension of the underlying business models they represe... | arxiv | @article{hellman2008breaking,
title={Breaking Out of the Cell: On The Benefits of a New Spreadsheet
User-Interaction Paradigm},
author={Ziv Hellman},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2005 113-124
ISBN:1-902724-16-X},
year={2008},
archivePrefix={arXiv},
eprint={08... | hellman2008breaking |
arxiv-3049 | 0803.1908 | On the Throughput Allocation for Proportional Fairness in Multirate IEEE 80211 DCF under General Load Conditions | <|reference_start|>On the Throughput Allocation for Proportional Fairness in Multirate IEEE 80211 DCF under General Load Conditions: This paper presents a modified proportional fairness (PF) criterion suitable for mitigating the \textit{rate anomaly} problem of multirate IEEE 802.11 Wireless LANs employing the mandator... | arxiv | @article{daneshgaran2008on,
title={On the Throughput Allocation for Proportional Fairness in Multirate IEEE
802.11 DCF under General Load Conditions},
author={F. Daneshgaran, M. Laddomada, F. Mesiti, M. Mondin},
journal={arXiv preprint arXiv:0803.1908},
year={2008},
archivePrefix={arXiv},
epri... | daneshgaran2008on |
arxiv-3050 | 0803.1926 | Improved evolutionary generation of XSLT stylesheets | <|reference_start|>Improved evolutionary generation of XSLT stylesheets: This paper introduces a procedure based on genetic programming to evolve XSLT programs (usually called stylesheets or logicsheets). XSLT is a general purpose, document-oriented functional language, generally used to transform XML documents (or, in... | arxiv | @article{garcia-sanchez2008improved,
title={Improved evolutionary generation of XSLT stylesheets},
author={Pablo Garcia-Sanchez, J. L. J. Laredo, J. P. Sevilla, Pedro Castillo,
J. J. Merelo},
journal={arXiv preprint arXiv:0803.1926},
year={2008},
archivePrefix={arXiv},
eprint={0803.1926},
... | garcia-sanchez2008improved |
arxiv-3051 | 0803.1944 | Early Experiences in Traffic Engineering Exploiting Path Diversity: A Practical Approach | <|reference_start|>Early Experiences in Traffic Engineering Exploiting Path Diversity: A Practical Approach: Recent literature has proved that stable dynamic routing algorithms have solid theoretical foundation that makes them suitable to be implemented in a real protocol, and used in practice in many different operati... | arxiv | @article{muscariello2008early,
title={Early Experiences in Traffic Engineering Exploiting Path Diversity: A
Practical Approach},
author={Luca Muscariello (FT R&D), Diego Perino (FT R&D, INRIA Rocquencourt)},
journal={arXiv preprint arXiv:0803.1944},
year={2008},
archivePrefix={arXiv},
eprint={... | muscariello2008early |
arxiv-3052 | 0803.1945 | Resampling and requantization of band-limited Gaussian stochastic signals with flat power spectrum | <|reference_start|>Resampling and requantization of band-limited Gaussian stochastic signals with flat power spectrum: A theoretical analysis, aimed at characterizing the degradation induced by the resampling and requantization processes applied to band-limited Gaussian signals with flat power spectrum, available throu... | arxiv | @article{lanucara2008resampling,
title={Resampling and requantization of band-limited Gaussian stochastic
signals with flat power spectrum},
author={Marco Lanucara and Riccardo Borghi},
journal={arXiv preprint arXiv:0803.1945},
year={2008},
archivePrefix={arXiv},
eprint={0803.1945},
primar... | lanucara2008resampling |
arxiv-3053 | 0803.1975 | Compressed Modular Matrix Multiplication | <|reference_start|>Compressed Modular Matrix Multiplication: We propose to store several integers modulo a small prime into a single machine word. Modular addition is performed by addition and possibly subtraction of a word containing several times the modulo. Modular Multiplication is not directly accessible but modul... | arxiv | @article{dumas2008compressed,
title={Compressed Modular Matrix Multiplication},
author={Jean-Guillaume Dumas (LJK), Laurent Fousse (LJK), Bruno Salvy (INRIA
Rocquencourt)},
journal={arXiv preprint arXiv:0803.1975},
year={2008},
archivePrefix={arXiv},
eprint={0803.1975},
primaryClass={cs.SC... | dumas2008compressed |
arxiv-3054 | 0803.1985 | An Investigation of the Sequential Sampling Method for Crossdocking Simulation Output Variance Reduction | <|reference_start|>An Investigation of the Sequential Sampling Method for Crossdocking Simulation Output Variance Reduction: This paper investigates the reduction of variance associated with a simulation output performance measure, using the Sequential Sampling method while applying minimum simulation replications, for... | arxiv | @article{adewunmi2008an,
title={An Investigation of the Sequential Sampling Method for Crossdocking
Simulation Output Variance Reduction},
author={Adrian Adewunmi, Uwe Aickelin and Mike Byrne},
journal={Operational Research Society 4th Simulation Workshop (SW08) in
print, pp, Worcestershire, UK 2008},
... | adewunmi2008an |
arxiv-3055 | 0803.1992 | Achievable Rates and Optimal Resource Allocation for Imperfectly-Known Fading Relay Channels | <|reference_start|>Achievable Rates and Optimal Resource Allocation for Imperfectly-Known Fading Relay Channels: In this paper, achievable rates and optimal resource allocation strategies for imperfectly-known fading relay channels are studied. It is assumed that communication starts with the network training phase in ... | arxiv | @article{zhang2008achievable,
title={Achievable Rates and Optimal Resource Allocation for Imperfectly-Known
Fading Relay Channels},
author={Junwei Zhang, Mustafa Cenk Gursoy},
journal={arXiv preprint arXiv:0803.1992},
year={2008},
number={UNL-123},
archivePrefix={arXiv},
eprint={0803.1992}... | zhang2008achievable |
arxiv-3056 | 0803.1993 | Improved Squeaky Wheel Optimisation for Driver Scheduling | <|reference_start|>Improved Squeaky Wheel Optimisation for Driver Scheduling: This paper presents a technique called Improved Squeaky Wheel Optimisation for driver scheduling problems. It improves the original Squeaky Wheel Optimisations effectiveness and execution speed by incorporating two additional steps of Selecti... | arxiv | @article{aickelin2008improved,
title={Improved Squeaky Wheel Optimisation for Driver Scheduling},
author={Uwe Aickelin, Edmund Burke and Jingpeng Li},
journal={Proceedings of the 9th International Conference on Parallel
Problem Solving from Nature (PPSN IX), Lecture Notes in Computer Science
4193, pp 18... | aickelin2008improved |
arxiv-3057 | 0803.1994 | The Application of Bayesian Optimization and Classifier Systems in Nurse Scheduling | <|reference_start|>The Application of Bayesian Optimization and Classifier Systems in Nurse Scheduling: Two ideas taken from Bayesian optimization and classifier systems are presented for personnel scheduling based on choosing a suitable scheduling rule from a set for each persons assignment. Unlike our previous work o... | arxiv | @article{li2008the,
title={The Application of Bayesian Optimization and Classifier Systems in Nurse
Scheduling},
author={Jingpeng Li and Uwe Aickelin},
journal={Proceedings of the 8th International Conference on Parallel
Problem Solving from Nature (PPSN VIII), Lecture Notes in Computer Science
3242, ... | li2008the |
arxiv-3058 | 0803.1997 | Danger Theory: The Link between AIS and IDS? | <|reference_start|>Danger Theory: The Link between AIS and IDS?: We present ideas about creating a next generation Intrusion Detection System based on the latest immunological theories. The central challenge with computer security is determining the difference between normal and potentially harmful activity. For half a... | arxiv | @article{aickelin2008danger,
title={Danger Theory: The Link between AIS and IDS?},
author={Uwe Aickelin, Peter Bentley, Steve Cayzer, Kim Jungwon and Julie
McLeod},
journal={Proceedings of the 2nd International Conference on Artificial
Immune Systems (ICARIS 2003), Lecture Notes in Computer Science 2787... | aickelin2008danger |
arxiv-3059 | 0803.2027 | Excelsior: Bringing the Benefits of Modularisation to Excel | <|reference_start|>Excelsior: Bringing the Benefits of Modularisation to Excel: Excel lacks features for modular design. Had it such features, as do most programming languages, they would save time, avoid unneeded programming, make mistakes less likely, make code-control easier, help organisations adopt a uniform house... | arxiv | @article{paine2008excelsior:,
title={Excelsior: Bringing the Benefits of Modularisation to Excel},
author={Jocelyn Paine},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2005 173-184
ISBN:1-902724-16-X},
year={2008},
archivePrefix={arXiv},
eprint={0803.2027},
primaryClass={c... | paine2008excelsior: |
arxiv-3060 | 0803.2092 | An Ant-Based Model for Multiple Sequence Alignment | <|reference_start|>An Ant-Based Model for Multiple Sequence Alignment: Multiple sequence alignment is a key process in today's biology, and finding a relevant alignment of several sequences is much more challenging than just optimizing some improbable evaluation functions. Our approach for addressing multiple sequence ... | arxiv | @article{guinand2008an,
title={An Ant-Based Model for Multiple Sequence Alignment},
author={Fr'ed'eric Guinand (LITIS), Yoann Pign'e (LITIS)},
journal={Dans Large-Scale Scientific Computing - Large-Scale Scientific
Computing, 6th International Conference, LSSC 2007, Sozopol : Bulgarie (2007)},
year={2... | guinand2008an |
arxiv-3061 | 0803.2093 | GraphStream: A Tool for bridging the gap between Complex Systems and Dynamic Graphs | <|reference_start|>GraphStream: A Tool for bridging the gap between Complex Systems and Dynamic Graphs: The notion of complex systems is common to many domains, from Biology to Economy, Computer Science, Physics, etc. Often, these systems are made of sets of entities moving in an evolving environment. One of their majo... | arxiv | @article{pigné2008graphstream:,
title={GraphStream: A Tool for bridging the gap between Complex Systems and
Dynamic Graphs},
author={Yoann Pign'e (LITIS), Antoine Dutot (LITIS), Fr'ed'eric Guinand
(LITIS), Damien Olivier (LITIS)},
journal={Emergent Properties in Natural and Artificial Complex Systems.
... | pigné2008graphstream: |
arxiv-3062 | 0803.2123 | Groups from Cyclic Infrastructures and Pohlig-Hellman in Certain Infrastructures | <|reference_start|>Groups from Cyclic Infrastructures and Pohlig-Hellman in Certain Infrastructures: In discrete logarithm based cryptography, a method by Pohlig and Hellman allows solving the discrete logarithm problem efficiently if the group order is known and has no large prime factors. The consequence is that such... | arxiv | @article{fontein2008groups,
title={Groups from Cyclic Infrastructures and Pohlig-Hellman in Certain
Infrastructures},
author={Felix Fontein (University of Zurich)},
journal={Advances in Mathematics of Communications, 2 (3), 2008},
year={2008},
doi={10.3934/amc.2008.2.293},
archivePrefix={arXiv... | fontein2008groups |
arxiv-3063 | 0803.2129 | Comparison of the Discriminatory Processor Sharing Policies | <|reference_start|>Comparison of the Discriminatory Processor Sharing Policies: Discriminatory Processor Sharing policy introduced by Kleinrock is of a great interest in many application areas, including telecommunications, web applications and TCP flow modelling. Under the DPS policy the job priority is controlled by ... | arxiv | @article{osipova2008comparison,
title={Comparison of the Discriminatory Processor Sharing Policies},
author={Natalia Osipova (INRIA Sophia Antipolis)},
journal={arXiv preprint arXiv:0803.2129},
year={2008},
number={RR-6475},
archivePrefix={arXiv},
eprint={0803.2129},
primaryClass={cs.NI}... | osipova2008comparison |
arxiv-3064 | 0803.2135 | On $(P_5,\barP_5)$-sparse graphs and other families | <|reference_start|>On $(P_5,\barP_5)$-sparse graphs and other families: We extend the notion of $P_4$-sparse graphs previously introduced by {\scshape Ho\`ang} by considering $\mathcal{F}$-sparse graphs were $\mathcal{F}$ denotes a finite set of graphs on $p$ vertices. Thus we obtain some results on $(P_5,\bar{P_5})$-s... | arxiv | @article{fouquet2008on,
title={On $(P_5,\bar{P_5})$-sparse graphs and other families},
author={Jean-Luc Fouquet (LIFO), Jean-Marie Vanherpe (LIFO)},
journal={arXiv preprint arXiv:0803.2135},
year={2008},
archivePrefix={arXiv},
eprint={0803.2135},
primaryClass={cs.DM}
} | fouquet2008on |
arxiv-3065 | 0803.2174 | Local Approximation Schemes for Topology Control | <|reference_start|>Local Approximation Schemes for Topology Control: This paper presents a distributed algorithm on wireless ad-hoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a linear size, lightweight, (1+\epsilon)-spanner for any given \epsilon > 0. A wireless net... | arxiv | @article{damian2008local,
title={Local Approximation Schemes for Topology Control},
author={Mirela Damian, Saurav Pandit and Sriram Pemmaraju},
journal={Proceedings of the 25th ACM Symposium on Principles of Distributed
Computing, pages 208-218, July 2006},
year={2008},
archivePrefix={arXiv},
... | damian2008local |
arxiv-3066 | 0803.2212 | Conditioning Probabilistic Databases | <|reference_start|>Conditioning Probabilistic Databases: Past research on probabilistic databases has studied the problem of answering queries on a static database. Application scenarios of probabilistic databases however often involve the conditioning of a database using additional information in the form of new evide... | arxiv | @article{koch2008conditioning,
title={Conditioning Probabilistic Databases},
author={Christoph Koch and Dan Olteanu},
journal={arXiv preprint arXiv:0803.2212},
year={2008},
archivePrefix={arXiv},
eprint={0803.2212},
primaryClass={cs.DB cs.AI}
} | koch2008conditioning |
arxiv-3067 | 0803.2219 | Lighweight Target Tracking Using Passive Traces in Sensor Networks | <|reference_start|>Lighweight Target Tracking Using Passive Traces in Sensor Networks: We study the important problem of tracking moving targets in wireless sensor networks. We try to overcome the limitations of standard state of the art tracking methods based on continuous location tracking, i.e. the high energy dissi... | arxiv | @article{marculescu2008lighweight,
title={Lighweight Target Tracking Using Passive Traces in Sensor Networks},
author={Andrei Marculescu and Sotiris Nikoletseas and Olivier Powell and Jose
Rolim},
journal={arXiv preprint arXiv:0803.2219},
year={2008},
archivePrefix={arXiv},
eprint={0803.2219},... | marculescu2008lighweight |
arxiv-3068 | 0803.2220 | The Anatomy of Mitos Web Search Engine | <|reference_start|>The Anatomy of Mitos Web Search Engine: Engineering a Web search engine offering effective and efficient information retrieval is a challenging task. This document presents our experiences from designing and developing a Web search engine offering a wide spectrum of functionalities and we report some... | arxiv | @article{papadakos2008the,
title={The Anatomy of Mitos Web Search Engine},
author={Panagiotis Papadakos, Giorgos Vasiliadis, Yannis Theoharis, Nikos
Armenatzoglou, Stella Kopidaki, Yannis Marketakis, Manos Daskalakis, Kostas
Karamaroudis, Giorgos Linardakis, Giannis Makrydakis, Vangelis Papathanasiou,
Lef... | papadakos2008the |
arxiv-3069 | 0803.2257 | High-Resolution Radar via Compressed Sensing | <|reference_start|>High-Resolution Radar via Compressed Sensing: A stylized compressed sensing radar is proposed in which the time-frequency plane is discretized into an N by N grid. Assuming the number of targets K is small (i.e., K much less than N^2), then we can transmit a sufficiently "incoherent" pulse and employ... | arxiv | @article{herman2008high-resolution,
title={High-Resolution Radar via Compressed Sensing},
author={Matthew A. Herman and Thomas Strohmer},
journal={arXiv preprint arXiv:0803.2257},
year={2008},
doi={10.1109/TSP.2009.2014277},
archivePrefix={arXiv},
eprint={0803.2257},
primaryClass={math.N... | herman2008high-resolution |
arxiv-3070 | 0803.2262 | Constant-Rank Codes and Their Connection to Constant-Dimension Codes | <|reference_start|>Constant-Rank Codes and Their Connection to Constant-Dimension Codes: Constant-dimension codes have recently received attention due to their significance to error control in noncoherent random linear network coding. What the maximal cardinality of any constant-dimension code with finite dimension and... | arxiv | @article{gadouleau2008constant-rank,
title={Constant-Rank Codes and Their Connection to Constant-Dimension Codes},
author={Maximilien Gadouleau and Zhiyuan Yan},
journal={arXiv preprint arXiv:0803.2262},
year={2008},
archivePrefix={arXiv},
eprint={0803.2262},
primaryClass={cs.IT math.IT}
} | gadouleau2008constant-rank |
arxiv-3071 | 0803.2285 | A Practical Attack on the MIFARE Classic | <|reference_start|>A Practical Attack on the MIFARE Classic: The MIFARE Classic is the most widely used contactless smart card in the market. Its design and implementation details are kept secret by its manufacturer. This paper studies the architecture of the card and the communication protocol between card and reader.... | arxiv | @article{gans2008a,
title={A Practical Attack on the MIFARE Classic},
author={Gerhard de Koning Gans, Jaap-Henk Hoepman, and Flavio D. Garcia},
journal={arXiv preprint arXiv:0803.2285},
year={2008},
archivePrefix={arXiv},
eprint={0803.2285},
primaryClass={cs.CR}
} | gans2008a |
arxiv-3072 | 0803.2305 | The Abella Interactive Theorem Prover (System Description) | <|reference_start|>The Abella Interactive Theorem Prover (System Description): Abella is an interactive system for reasoning about aspects of object languages that have been formally presented through recursive rules based on syntactic structure. Abella utilizes a two-level logic approach to specification and reasoning... | arxiv | @article{gacek2008the,
title={The Abella Interactive Theorem Prover (System Description)},
author={Andrew Gacek},
journal={arXiv preprint arXiv:0803.2305},
year={2008},
archivePrefix={arXiv},
eprint={0803.2305},
primaryClass={cs.LO cs.PL}
} | gacek2008the |
arxiv-3073 | 0803.2306 | Tableau-based decision procedures for logics of strategic ability in multi-agent systems | <|reference_start|>Tableau-based decision procedures for logics of strategic ability in multi-agent systems: We develop an incremental tableau-based decision procedures for the Alternating-time temporal logic ATL and some of its variants. While running within the theoretically established complexity upper bound, we... | arxiv | @article{goranko2008tableau-based,
title={Tableau-based decision procedures for logics of strategic ability in
multi-agent systems},
author={Valentin Goranko and Dmitry Shkatov},
journal={arXiv preprint arXiv:0803.2306},
year={2008},
archivePrefix={arXiv},
eprint={0803.2306},
primaryClass=... | goranko2008tableau-based |
arxiv-3074 | 0803.2314 | Problem Solving and Complex Systems | <|reference_start|>Problem Solving and Complex Systems: The observation and modeling of natural Complex Systems (CSs) like the human nervous system, the evolution or the weather, allows the definition of special abilities and models reusable to solve other problems. For instance, Genetic Algorithms or Ant Colony Optimi... | arxiv | @article{guinand2008problem,
title={Problem Solving and Complex Systems},
author={Fr'ed'eric Guinand (LITIS), Yoann Pign'e (LITIS)},
journal={Emergent Properties in Natural and Artificial Dynamical Systems,
Springer Verlag (Ed.) (2006) 53-86},
year={2008},
archivePrefix={arXiv},
eprint={0803.2... | guinand2008problem |
arxiv-3075 | 0803.2315 | Science mapping with asymmetrical paradigmatic proximity | <|reference_start|>Science mapping with asymmetrical paradigmatic proximity: We propose a series of methods to represent the evolution of a field of science at different levels: namely micro, meso and macro levels. We use a previously introduced asymmetric measure of paradigmatic proximity between terms that enables us... | arxiv | @article{cointet2008science,
title={Science mapping with asymmetrical paradigmatic proximity},
author={Jean-Philippe Cointet (CREA, TSV), David Chavalarias (CREA)},
journal={Networks and Heterogeneous Media 3, 2 (2008) 267 - 276},
year={2008},
archivePrefix={arXiv},
eprint={0803.2315},
prima... | cointet2008science |
arxiv-3076 | 0803.2316 | On the CNOT-cost of TOFFOLI gates | <|reference_start|>On the CNOT-cost of TOFFOLI gates: The three-input TOFFOLI gate is the workhorse of circuit synthesis for classical logic operations on quantum data, e.g., reversible arithmetic circuits. In physical implementations, however, TOFFOLI gates are decomposed into six CNOT gates and several one-qubit gate... | arxiv | @article{shende2008on,
title={On the CNOT-cost of TOFFOLI gates},
author={Vivek V. Shende and Igor L. Markov},
journal={Quant.Inf.Comp. 9(5-6):461-486 (2009)},
year={2008},
archivePrefix={arXiv},
eprint={0803.2316},
primaryClass={quant-ph cs.ET}
} | shende2008on |
arxiv-3077 | 0803.2317 | Lissom, a Source Level Proof Carrying Code Platform | <|reference_start|>Lissom, a Source Level Proof Carrying Code Platform: This paper introduces a proposal for a Proof Carrying Code (PCC) architecture called Lissom. Started as a challenge for final year Computing students, Lissom was thought as a mean to prove to a sceptic community, and in particular to students, that... | arxiv | @article{gomes2008lissom,,
title={Lissom, a Source Level Proof Carrying Code Platform},
author={Joao Gomes and Daniel Martins and Simao Melo de Sousa and Jorge Sousa
Pinto},
journal={arXiv preprint arXiv:0803.2317},
year={2008},
archivePrefix={arXiv},
eprint={0803.2317},
primaryClass={cs.L... | gomes2008lissom, |
arxiv-3078 | 0803.2319 | Two Algorithms for Solving A General Backward Pentadiagonal Linear Systems | <|reference_start|>Two Algorithms for Solving A General Backward Pentadiagonal Linear Systems: In this paper we present an efficient computational and symbolic algorithms for solving a backward pentadiagonal linear systems. The implementation of the algorithms using Computer Algebra Systems (CAS) such as MAPLE, MACSYMA... | arxiv | @article{karawia2008two,
title={Two Algorithms for Solving A General Backward Pentadiagonal Linear
Systems},
author={A. A. Karawia},
journal={arXiv preprint arXiv:0803.2319},
year={2008},
archivePrefix={arXiv},
eprint={0803.2319},
primaryClass={cs.SC cs.NA}
} | karawia2008two |
arxiv-3079 | 0803.2337 | Data Fusion Trees for Detection: Does Architecture Matter? | <|reference_start|>Data Fusion Trees for Detection: Does Architecture Matter?: We consider the problem of decentralized detection in a network consisting of a large number of nodes arranged as a tree of bounded height, under the assumption of conditionally independent, identically distributed observations. We character... | arxiv | @article{tay2008data,
title={Data Fusion Trees for Detection: Does Architecture Matter?},
author={Wee Peng Tay, John Tsitsiklis, and Moe Win},
journal={arXiv preprint arXiv:0803.2337},
year={2008},
archivePrefix={arXiv},
eprint={0803.2337},
primaryClass={cs.IT math.IT}
} | tay2008data |
arxiv-3080 | 0803.2363 | lambda-Connectedness Determination for Image Segmentation | <|reference_start|>lambda-Connectedness Determination for Image Segmentation: Image segmentation is to separate an image into distinct homogeneous regions belonging to different objects. It is an essential step in image analysis and computer vision. This paper compares some segmentation technologies and attempts to fin... | arxiv | @article{chen2008lambda-connectedness,
title={lambda-Connectedness Determination for Image Segmentation},
author={Li Chen},
journal={arXiv preprint arXiv:0803.2363},
year={2008},
archivePrefix={arXiv},
eprint={0803.2363},
primaryClass={cs.CV cs.DM}
} | chen2008lambda-connectedness |
arxiv-3081 | 0803.2365 | SAFIUS - A secure and accountable filesystem over untrusted storage | <|reference_start|>SAFIUS - A secure and accountable filesystem over untrusted storage: We describe SAFIUS, a secure accountable file system that resides over an untrusted storage. SAFIUS provides strong security guarantees like confidentiality, integrity, prevention from rollback attacks, and accountability. SAFIUS al... | arxiv | @article{sriram2008safius,
title={SAFIUS - A secure and accountable filesystem over untrusted storage},
author={V Sriram, Ganesh Narayan, K Gopinath},
journal={Fourth International IEEE Security in Storage Workshop, 2007 -
SISW '07. Publication Date: 27-27 Sept. 2007 On page(s): 34-45},
year={2008},
... | sriram2008safius |
arxiv-3082 | 0803.2386 | Conformal Computing: Algebraically connecting the hardware/software boundary using a uniform approach to high-performance computation for software and hardware applications | <|reference_start|>Conformal Computing: Algebraically connecting the hardware/software boundary using a uniform approach to high-performance computation for software and hardware applications: We present a systematic, algebraically based, design methodology for efficient implementation of computer programs optimized ov... | arxiv | @article{mullin2008conformal,
title={Conformal Computing: Algebraically connecting the hardware/software
boundary using a uniform approach to high-performance computation for
software and hardware applications},
author={Lenore R. Mullin and James E. Raynolds},
journal={arXiv preprint arXiv:0803.2386},
... | mullin2008conformal |
arxiv-3083 | 0803.2392 | CoSaMP: Iterative signal recovery from incomplete and inaccurate samples | <|reference_start|>CoSaMP: Iterative signal recovery from incomplete and inaccurate samples: Compressive sampling offers a new paradigm for acquiring signals that are compressible with respect to an orthonormal basis. The major algorithmic challenge in compressive sampling is to approximate a compressible signal from n... | arxiv | @article{needell2008cosamp:,
title={CoSaMP: Iterative signal recovery from incomplete and inaccurate samples},
author={D. Needell and J. A. Tropp},
journal={Appl. Comput. Harmon. Anal., Vol. 26, pp. 301-321, 2008},
year={2008},
archivePrefix={arXiv},
eprint={0803.2392},
primaryClass={math.NA... | needell2008cosamp: |
arxiv-3084 | 0803.2427 | A General Rate Duality of the MIMO Multiple Access Channel and the MIMO Broadcast Channel | <|reference_start|>A General Rate Duality of the MIMO Multiple Access Channel and the MIMO Broadcast Channel: We present a general rate duality between the multiple access channel (MAC) and the broadcast channel (BC) which is applicable to systems with and without nonlinear interference cancellation. Different to the s... | arxiv | @article{hunger2008a,
title={A General Rate Duality of the MIMO Multiple Access Channel and the MIMO
Broadcast Channel},
author={Raphael Hunger, Michael Joham},
journal={arXiv preprint arXiv:0803.2427},
year={2008},
doi={10.1109/GLOCOM.2008.ECP.178},
archivePrefix={arXiv},
eprint={0803.242... | hunger2008a |
arxiv-3085 | 0803.2443 | Discrete stochastic processes, replicator and Fokker-Planck equations of coevolutionary dynamics in finite and infinite populations | <|reference_start|>Discrete stochastic processes, replicator and Fokker-Planck equations of coevolutionary dynamics in finite and infinite populations: Finite-size fluctuations in coevolutionary dynamics arise in models of biological as well as of social and economic systems. This brief tutorial review surveys a system... | arxiv | @article{claussen2008discrete,
title={Discrete stochastic processes, replicator and Fokker-Planck equations of
coevolutionary dynamics in finite and infinite populations},
author={Jens Christian Claussen},
journal={Banach Center Publications 80, 17-31 (2008)},
year={2008},
doi={10.4064/bc80-0-1},
... | claussen2008discrete |
arxiv-3086 | 0803.2447 | Trajectory Networks and Their Topological Changes Induced by Geographical Infiltration | <|reference_start|>Trajectory Networks and Their Topological Changes Induced by Geographical Infiltration: In this article we investigate the topological changes undergone by trajectory networks as a consequence of progressive geographical infiltration. Trajectory networks, a type of knitted network, are obtained by es... | arxiv | @article{costa2008trajectory,
title={Trajectory Networks and Their Topological Changes Induced by
Geographical Infiltration},
author={Luciano da Fontoura Costa},
journal={arXiv preprint arXiv:0803.2447},
year={2008},
archivePrefix={arXiv},
eprint={0803.2447},
primaryClass={cs.DM cs.CG}
} | costa2008trajectory |
arxiv-3087 | 0803.2460 | Upper Bound on Error Exponent of Regular LDPC Codes Transmitted over the BEC | <|reference_start|>Upper Bound on Error Exponent of Regular LDPC Codes Transmitted over the BEC: The error performance of the ensemble of typical LDPC codes transmitted over the binary erasure channel (BEC) is analyzed. In the past, lower bounds on the error exponents were derived. In this paper a probabilistic upper b... | arxiv | @article{goldenberg2008upper,
title={Upper Bound on Error Exponent of Regular LDPC Codes Transmitted over the
BEC},
author={Idan Goldenberg and David Burshtein},
journal={arXiv preprint arXiv:0803.2460},
year={2008},
archivePrefix={arXiv},
eprint={0803.2460},
primaryClass={cs.IT math.IT}
} | goldenberg2008upper |
arxiv-3088 | 0803.2495 | Adversarial Scheduling Analysis of Game Theoretic Models of Norm Diffusion | <|reference_start|>Adversarial Scheduling Analysis of Game Theoretic Models of Norm Diffusion: In (Istrate, Marathe, Ravi SODA 2001) we advocated the investigation of robustness of results in the theory of learning in games under adversarial scheduling models. We provide evidence that such an analysis is feasible and c... | arxiv | @article{istrate2008adversarial,
title={Adversarial Scheduling Analysis of Game Theoretic Models of Norm
Diffusion},
author={Gabriel Istrate, Madhav V. Marathe and S.S.Ravi},
journal={arXiv preprint arXiv:0803.2495},
year={2008},
archivePrefix={arXiv},
eprint={0803.2495},
primaryClass={cs.... | istrate2008adversarial |
arxiv-3089 | 0803.2527 | Controlling the Information Flow in Spreadsheets | <|reference_start|>Controlling the Information Flow in Spreadsheets: There is no denying that spreadsheets have become critical for all operational processes including financial reporting, budgeting, forecasting, and analysis. Microsoft Excel has essentially become a scratch pad and a data browser that can quickly be p... | arxiv | @article{samar2008controlling,
title={Controlling the Information Flow in Spreadsheets},
author={Vipin Samar, Sangeeta Patni},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2005 125-134
ISBN:1-902724-16-X},
year={2008},
archivePrefix={arXiv},
eprint={0803.2527},
primaryClas... | samar2008controlling |
arxiv-3090 | 0803.2559 | Logical Queries over Views: Decidability and Expressiveness | <|reference_start|>Logical Queries over Views: Decidability and Expressiveness: We study the problem of deciding satisfiability of first order logic queries over views, our aim being to delimit the boundary between the decidable and the undecidable fragments of this language. Views currently occupy a central place in d... | arxiv | @article{bailey2008logical,
title={Logical Queries over Views: Decidability and Expressiveness},
author={James Bailey and Guozhu Dong and Anthony Widjaja To},
journal={arXiv preprint arXiv:0803.2559},
year={2008},
archivePrefix={arXiv},
eprint={0803.2559},
primaryClass={cs.LO cs.DB}
} | bailey2008logical |
arxiv-3091 | 0803.2570 | Unequal Error Protection: An Information Theoretic Perspective | <|reference_start|>Unequal Error Protection: An Information Theoretic Perspective: An information theoretic framework for unequal error protection is developed in terms of the exponential error bounds. The fundamental difference between the bit-wise and message-wise unequal error protection (UEP) is demonstrated, for f... | arxiv | @article{borade2008unequal,
title={Unequal Error Protection: An Information Theoretic Perspective},
author={Shashi Borade, Baris Nakiboglu, Lizhong Zheng},
journal={IEEE Transactions on Information Theory, 55(12):5511-5539, Dec
2009},
year={2008},
doi={10.1109/TIT.2009.2032819 10.1109/ISIT.2008.45... | borade2008unequal |
arxiv-3092 | 0803.2615 | Rapport de recherche sur le probl\`eme du plus court chemin contraint | <|reference_start|>Rapport de recherche sur le probl\`eme du plus court chemin contraint: This article provides an overview of the performance and the theoretical complexity of approximate and exact methods for various versions of the shortest path problem. The proposed study aims to improve the resolution of a more ge... | arxiv | @article{laval2008rapport,
title={Rapport de recherche sur le probl\`eme du plus court chemin contraint},
author={Olivier Laval (LIPN), Sophie Toulouse (LIPN), Anass Nagih (LITA)},
journal={arXiv preprint arXiv:0803.2615},
year={2008},
archivePrefix={arXiv},
eprint={0803.2615},
primaryClass=... | laval2008rapport |
arxiv-3093 | 0803.2616 | Combinatorial realization of the Thom-Smale complex via discrete Morse theory | <|reference_start|>Combinatorial realization of the Thom-Smale complex via discrete Morse theory: In the case of smooth manifolds, we use Forman's discrete Morse theory to realize combinatorially any Thom-Smale complex coming from a smooth Morse function by a couple triangulation-discrete Morse function. As an applicat... | arxiv | @article{gallais2008combinatorial,
title={Combinatorial realization of the Thom-Smale complex via discrete Morse
theory},
author={Etienne Gallais (LMAM, LMJL)},
journal={arXiv preprint arXiv:0803.2616},
year={2008},
archivePrefix={arXiv},
eprint={0803.2616},
primaryClass={math.GT cs.DM mat... | gallais2008combinatorial |
arxiv-3094 | 0803.2639 | Maximal Orders in the Design of Dense Space-Time Lattice Codes | <|reference_start|>Maximal Orders in the Design of Dense Space-Time Lattice Codes: We construct explicit rate-one, full-diversity, geometrically dense matrix lattices with large, non-vanishing determinants (NVD) for four transmit antenna multiple-input single-output (MISO) space-time (ST) applications. The construction... | arxiv | @article{hollanti2008maximal,
title={Maximal Orders in the Design of Dense Space-Time Lattice Codes},
author={Camilla Hollanti, Jyrki Lahtonen, Hsiao-feng Francis Lu},
journal={IEEE Trans. Inf. Theory, vol. 54(10), Oct. 2008, pp. 4493-4510},
year={2008},
doi={10.1109/TIT.2008.928998},
archivePre... | hollanti2008maximal |
arxiv-3095 | 0803.2675 | Digital Ecosystems: Self-Organisation of Evolving Agent Populations | <|reference_start|>Digital Ecosystems: Self-Organisation of Evolving Agent Populations: A primary motivation for our research in Digital Ecosystems is the desire to exploit the self-organising properties of biological ecosystems. Ecosystems are thought to be robust, scalable architectures that can automatically solve c... | arxiv | @article{briscoe2008digital,
title={Digital Ecosystems: Self-Organisation of Evolving Agent Populations},
author={Gerard Briscoe and Philippe De Wilde},
journal={arXiv preprint arXiv:0803.2675},
year={2008},
archivePrefix={arXiv},
eprint={0803.2675},
primaryClass={cs.NE cs.CC}
} | briscoe2008digital |
arxiv-3096 | 0803.2695 | KohonAnts: A Self-Organizing Ant Algorithm for Clustering and Pattern Classification | <|reference_start|>KohonAnts: A Self-Organizing Ant Algorithm for Clustering and Pattern Classification: In this paper we introduce a new ant-based method that takes advantage of the cooperative self-organization of Ant Colony Systems to create a naturally inspired clustering and pattern recognition method. The approac... | arxiv | @article{fernandes2008kohonants:,
title={KohonAnts: A Self-Organizing Ant Algorithm for Clustering and Pattern
Classification},
author={C. Fernandes, A.M. Mora, J.J. Merelo, V. Ramos, J.L.J. Laredo},
journal={arXiv preprint arXiv:0803.2695},
year={2008},
archivePrefix={arXiv},
eprint={0803.269... | fernandes2008kohonants: |
arxiv-3097 | 0803.2717 | Distributed authentication for randomly compromised networks | <|reference_start|>Distributed authentication for randomly compromised networks: We introduce a simple, practical approach with probabilistic information-theoretic security to solve one of quantum key distribution's major security weaknesses: the requirement of an authenticated classical channel to prevent man-in-the-m... | arxiv | @article{beals2008distributed,
title={Distributed authentication for randomly compromised networks},
author={Travis R. Beals, Kevin P. Hynes, Barry C. Sanders},
journal={New Journal of Physics 11 (2009) 085005},
year={2008},
doi={10.1088/1367-2630/11/8/085005},
archivePrefix={arXiv},
eprint=... | beals2008distributed |
arxiv-3098 | 0803.2812 | Using Spatially Varying Pixels Exposures and Bayer-covered Photosensors for High Dynamic Range Imaging | <|reference_start|>Using Spatially Varying Pixels Exposures and Bayer-covered Photosensors for High Dynamic Range Imaging: The method of a linear high dynamic range imaging using solid-state photosensors with Bayer colour filters array is provided in this paper. Using information from neighbour pixels, it is possible t... | arxiv | @article{konnik2008using,
title={Using Spatially Varying Pixels Exposures and Bayer-covered Photosensors
for High Dynamic Range Imaging},
author={Mikhail V. Konnik},
journal={arXiv preprint arXiv:0803.2812},
year={2008},
archivePrefix={arXiv},
eprint={0803.2812},
primaryClass={cs.CV}
} | konnik2008using |
arxiv-3099 | 0803.2824 | Combined Intra- and Inter-domain Traffic Engineering using Hot-Potato Aware Link Weights Optimization | <|reference_start|>Combined Intra- and Inter-domain Traffic Engineering using Hot-Potato Aware Link Weights Optimization: A well-known approach to intradomain traffic engineering consists in finding the set of link weights that minimizes a network-wide objective function for a given intradomain traffic matrix. This app... | arxiv | @article{balon2008combined,
title={Combined Intra- and Inter-domain Traffic Engineering using Hot-Potato
Aware Link Weights Optimization},
author={Simon Balon and Guy Leduc},
journal={arXiv preprint arXiv:0803.2824},
year={2008},
archivePrefix={arXiv},
eprint={0803.2824},
primaryClass={cs.... | balon2008combined |
arxiv-3100 | 0803.2827 | Impact of CSI on Distributed Space-Time Coding in Wireless Relay Networks | <|reference_start|>Impact of CSI on Distributed Space-Time Coding in Wireless Relay Networks: We consider a two-hop wireless network where a transmitter communicates with a receiver via $M$ relays with an amplify-and-forward (AF) protocol. Recent works have shown that sophisticated linear processing such as beamforming... | arxiv | @article{kobayashi2008impact,
title={Impact of CSI on Distributed Space-Time Coding in Wireless Relay
Networks},
author={Mari Kobayashi and Xavier Mestre},
journal={arXiv preprint arXiv:0803.2827},
year={2008},
archivePrefix={arXiv},
eprint={0803.2827},
primaryClass={cs.IT math.IT}
} | kobayashi2008impact |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.