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-2901 | 0802.4282 | Distributed Opportunistic Scheduling For Ad-Hoc Communications Under Noisy Channel Estimation | <|reference_start|>Distributed Opportunistic Scheduling For Ad-Hoc Communications Under Noisy Channel Estimation: Distributed opportunistic scheduling is studied for wireless ad-hoc networks, where many links contend for one channel using random access. In such networks, distributed opportunistic scheduling (DOS) invol... | arxiv | @article{zheng2008distributed,
title={Distributed Opportunistic Scheduling For Ad-Hoc Communications Under
Noisy Channel Estimation},
author={Dong Zheng, Man-On Pun, Weiyan Ge, Junshan Zhang and H. Vincent Poor},
journal={arXiv preprint arXiv:0802.4282},
year={2008},
doi={10.1109/ICC.2008.698},
... | zheng2008distributed |
arxiv-2902 | 0802.4284 | Distributed Opportunistic Scheduling for MIMO Ad-Hoc Networks | <|reference_start|>Distributed Opportunistic Scheduling for MIMO Ad-Hoc Networks: Distributed opportunistic scheduling (DOS) protocols are proposed for multiple-input multiple-output (MIMO) ad-hoc networks with contention-based medium access. The proposed scheduling protocols distinguish themselves from other existing ... | arxiv | @article{pun2008distributed,
title={Distributed Opportunistic Scheduling for MIMO Ad-Hoc Networks},
author={Man-On Pun, Weiyan Ge, Dong Zheng, Junshan Zhang and H. Vincent Poor},
journal={arXiv preprint arXiv:0802.4284},
year={2008},
doi={10.1109/ICC.2008.694},
archivePrefix={arXiv},
eprint=... | pun2008distributed |
arxiv-2903 | 0802.4291 | Opportunistic Scheduling and Beamforming for MIMO-OFDMA Downlink Systems with Reduced Feedback | <|reference_start|>Opportunistic Scheduling and Beamforming for MIMO-OFDMA Downlink Systems with Reduced Feedback: Opportunistic scheduling and beamforming schemes with reduced feedback are proposed for MIMO-OFDMA downlink systems. Unlike the conventional beamforming schemes in which beamforming is implemented solely b... | arxiv | @article{pun2008opportunistic,
title={Opportunistic Scheduling and Beamforming for MIMO-OFDMA Downlink Systems
with Reduced Feedback},
author={Man-On Pun, Kyeong Jin Kim and H. Vincent Poor},
journal={arXiv preprint arXiv:0802.4291},
year={2008},
doi={10.1109/ICC.2008.135},
archivePrefix={arXi... | pun2008opportunistic |
arxiv-2904 | 0802.4293 | Reduced Incidence algebras description of cobweb posets and KoDAGs | <|reference_start|>Reduced Incidence algebras description of cobweb posets and KoDAGs: After identifying the reduced incidence algebra of an arbitrary cobweb poset the very first properties of these algebras are being disclosed.<|reference_end|> | arxiv | @article{krot-sieniawska2008reduced,
title={Reduced Incidence algebras description of cobweb posets and KoDAGs},
author={Ewa Krot-Sieniawska},
journal={arXiv preprint arXiv:0802.4293},
year={2008},
archivePrefix={arXiv},
eprint={0802.4293},
primaryClass={math.CO cs.DM}
} | krot-sieniawska2008reduced |
arxiv-2905 | 0802.4299 | SINR Analysis of Opportunistic MIMO-SDMA Downlink Systems with Linear Combining | <|reference_start|>SINR Analysis of Opportunistic MIMO-SDMA Downlink Systems with Linear Combining: Opportunistic scheduling (OS) schemes have been proposed previously by the authors for multiuser MIMO-SDMA downlink systems with linear combining. In particular, it has been demonstrated that significant performance impr... | arxiv | @article{pun2008sinr,
title={SINR Analysis of Opportunistic MIMO-SDMA Downlink Systems with Linear
Combining},
author={Man-On Pun, Visa Koivunen and H. Vincent Poor},
journal={arXiv preprint arXiv:0802.4299},
year={2008},
doi={10.1109/ICC.2008.699},
archivePrefix={arXiv},
eprint={0802.4299... | pun2008sinr |
arxiv-2906 | 0802.4307 | A O(n^8) X O(n^7) Linear Programming Model of the Quadratic Assignment Problem | <|reference_start|>A O(n^8) X O(n^7) Linear Programming Model of the Quadratic Assignment Problem: This paper has been withdrawn because Theorem 21 and Corollary 22 are in error; The modeling idea is OK, but it needs 9-dimensional variables instead of the 8-dimensional variables defined in notations 6.9. Examples of ... | arxiv | @article{diaby2008a,
title={A O(n^8) X O(n^7) Linear Programming Model of the Quadratic Assignment
Problem},
author={Moustapha Diaby},
journal={arXiv preprint arXiv:0802.4307},
year={2008},
archivePrefix={arXiv},
eprint={0802.4307},
primaryClass={cs.DM cs.CC}
} | diaby2008a |
arxiv-2907 | 0802.4312 | Curves That Must Be Retraced | <|reference_start|>Curves That Must Be Retraced: We exhibit a polynomial time computable plane curve GAMMA that has finite length, does not intersect itself, and is smooth except at one endpoint, but has the following property. For every computable parametrization f of GAMMA and every positive integer n, there is some ... | arxiv | @article{gu2008curves,
title={Curves That Must Be Retraced},
author={Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo},
journal={arXiv preprint arXiv:0802.4312},
year={2008},
archivePrefix={arXiv},
eprint={0802.4312},
primaryClass={cs.CC}
} | gu2008curves |
arxiv-2908 | 0802.4325 | A Simple Yao-Yao-Based Spanner of Bounded Degree | <|reference_start|>A Simple Yao-Yao-Based Spanner of Bounded Degree: It is a standing open question to decide whether the Yao-Yao structure for unit disk graphs (UDGs) is a length spanner of not. This question is highly relevant to the topology control problem for wireless ad hoc networks. In this paper we make progres... | arxiv | @article{damian2008a,
title={A Simple Yao-Yao-Based Spanner of Bounded Degree},
author={Mirela Damian},
journal={arXiv preprint arXiv:0802.4325},
year={2008},
archivePrefix={arXiv},
eprint={0802.4325},
primaryClass={cs.CG cs.DS}
} | damian2008a |
arxiv-2909 | 0802.4326 | The Generation of Textual Entailment with NLML in an Intelligent Dialogue system for Language Learning CSIEC | <|reference_start|>The Generation of Textual Entailment with NLML in an Intelligent Dialogue system for Language Learning CSIEC: This research report introduces the generation of textual entailment within the project CSIEC (Computer Simulation in Educational Communication), an interactive web-based human-computer dialo... | arxiv | @article{jia2008the,
title={The Generation of Textual Entailment with NLML in an Intelligent
Dialogue system for Language Learning CSIEC},
author={Jiyou Jia},
journal={arXiv preprint arXiv:0802.4326},
year={2008},
archivePrefix={arXiv},
eprint={0802.4326},
primaryClass={cs.CL cs.AI cs.CY}
... | jia2008the |
arxiv-2910 | 0802.4330 | Eigenvalue Estimates and Mutual Information for the Linear Time-Varying Channel | <|reference_start|>Eigenvalue Estimates and Mutual Information for the Linear Time-Varying Channel: We consider linear time-varying channels with additive white Gaussian noise. For a large class of such channels we derive rigorous estimates of the eigenvalues of the correlation matrix of the effective channel in terms ... | arxiv | @article{farrell2008eigenvalue,
title={Eigenvalue Estimates and Mutual Information for the Linear Time-Varying
Channel},
author={Brendan Farrell, Thomas Strohmer},
journal={arXiv preprint arXiv:0802.4330},
year={2008},
doi={10.1109/TIT.2011.2161919},
archivePrefix={arXiv},
eprint={0802.433... | farrell2008eigenvalue |
arxiv-2911 | 0802.4344 | An Improved Scheme for Initial Ranging in OFDMA-based Networks | <|reference_start|>An Improved Scheme for Initial Ranging in OFDMA-based Networks: An efficient scheme for initial ranging has recently been proposed by X. Fu et al. in the context of orthogonal frequency-division multiple-access (OFDMA) networks based on the IEEE 802.16e-2005 standard. The proposed solution aims at es... | arxiv | @article{sanguinetti2008an,
title={An Improved Scheme for Initial Ranging in OFDMA-based Networks},
author={Luca Sanguinetti, Michele Morelli and H. Vincent Poor},
journal={arXiv preprint arXiv:0802.4344},
year={2008},
doi={10.1109/ICC.2008.652},
archivePrefix={arXiv},
eprint={0802.4344},
... | sanguinetti2008an |
arxiv-2912 | 0802.4350 | Role of Symmetry and Geometry in a chaotic Pseudo-Random Bit Generator | <|reference_start|>Role of Symmetry and Geometry in a chaotic Pseudo-Random Bit Generator: In this work, Pseudo-Random Bit Generation (PRBG) based on 2D chaotic mappings of logistic type is considered. The sequences generated with two Pseudorandom Bit Generators (PRBGs) of this type are statistically tested and the com... | arxiv | @article{pellicer-lostao2008role,
title={Role of Symmetry and Geometry in a chaotic Pseudo-Random Bit Generator},
author={Carmen Pellicer-Lostao and Ricardo Lopez-Ruiz},
journal={arXiv preprint arXiv:0802.4350},
year={2008},
archivePrefix={arXiv},
eprint={0802.4350},
primaryClass={nlin.CD cs... | pellicer-lostao2008role |
arxiv-2913 | 0802.4363 | Estimating the entropy of binary time series: Methodology, some theory and a simulation study | <|reference_start|>Estimating the entropy of binary time series: Methodology, some theory and a simulation study: Partly motivated by entropy-estimation problems in neuroscience, we present a detailed and extensive comparison between some of the most popular and effective entropy estimation methods used in practice: Th... | arxiv | @article{gao2008estimating,
title={Estimating the entropy of binary time series: Methodology, some theory
and a simulation study},
author={Y. Gao, I. Kontoyiannis and E. Bienenstock},
journal={arXiv preprint arXiv:0802.4363},
year={2008},
doi={10.3390/entropy-e10020071},
archivePrefix={arXiv},... | gao2008estimating |
arxiv-2914 | 0802.4390 | Low Complexity Sphere Decoding for Spatial Multiplexing MIMO | <|reference_start|>Low Complexity Sphere Decoding for Spatial Multiplexing MIMO: In this paper we present a novel method for decoding multiple input - multiple output (MIMO) transmission, which combines sphere decoding (SD) and zero forcing (ZF) techniques to provide near optimal low complexity and high performance con... | arxiv | @article{neder2008low,
title={Low Complexity Sphere Decoding for Spatial Multiplexing MIMO},
author={Vadim Neder, Doron Ezri and Motti Haridim},
journal={arXiv preprint arXiv:0802.4390},
year={2008},
archivePrefix={arXiv},
eprint={0802.4390},
primaryClass={cs.IT math.IT}
} | neder2008low |
arxiv-2915 | 0802.4450 | A Study On Distributed Model Predictive Consensus | <|reference_start|>A Study On Distributed Model Predictive Consensus: We investigate convergence properties of a proposed distributed model predictive control (DMPC) scheme, where agents negotiate to compute an optimal consensus point using an incremental subgradient method based on primal decomposition as described in... | arxiv | @article{keviczky2008a,
title={A Study On Distributed Model Predictive Consensus},
author={Tamas Keviczky, Karl Henrik Johansson},
journal={arXiv preprint arXiv:0802.4450},
year={2008},
archivePrefix={arXiv},
eprint={0802.4450},
primaryClass={cs.MA}
} | keviczky2008a |
arxiv-2916 | 0803.0011 | Qtier-Rapor: Managing Spreadsheet Systems & Improving Corporate Performance, Compliance and Governance | <|reference_start|>Qtier-Rapor: Managing Spreadsheet Systems & Improving Corporate Performance, Compliance and Governance: Much of what EuSpRIG discusses is concerned with the integrity of individual spreadsheets. In businesses, interlocking spreadsheets are regularly used to fill functional gaps in core administrative... | arxiv | @article{bishop2008qtier-rapor:,
title={Qtier-Rapor: Managing Spreadsheet Systems & Improving Corporate
Performance, Compliance and Governance},
author={Keith Bishop},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2006 33-44
ISBN:1-905617-08-9},
year={2008},
archivePrefix={arXiv}... | bishop2008qtier-rapor: |
arxiv-2917 | 0803.0014 | Automated Termination Proofs for Logic Programs by Term Rewriting | <|reference_start|>Automated Termination Proofs for Logic Programs by Term Rewriting: There are two kinds of approaches for termination analysis of logic programs: "transformational" and "direct" ones. Direct approaches prove termination directly on the basis of the logic program. Transformational approaches transform ... | arxiv | @article{schneider-kamp2008automated,
title={Automated Termination Proofs for Logic Programs by Term Rewriting},
author={P. Schneider-Kamp, J. Giesl, A. Serebrenik, R. Thiemann},
journal={arXiv preprint arXiv:0803.0014},
year={2008},
archivePrefix={arXiv},
eprint={0803.0014},
primaryClass={c... | schneider-kamp2008automated |
arxiv-2918 | 0803.0015 | EuSpRIG 2006 Commercial Spreadsheet Review | <|reference_start|>EuSpRIG 2006 Commercial Spreadsheet Review: This management summary provides an outline of a commercial spreadsheet review process. The aim of this process is to ensure remedial or enhancement work can safely be undertaken on a spreadsheet with a commercially acceptable level of risk of introducing n... | arxiv | @article{murphy2008eusprig,
title={EuSpRIG 2006 Commercial Spreadsheet Review},
author={Simon Murphy},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2006 45-52
ISBN:1-905617-08-9},
year={2008},
archivePrefix={arXiv},
eprint={0803.0015},
primaryClass={cs.SE}
} | murphy2008eusprig |
arxiv-2919 | 0803.0018 | Another approach to decide on real root existence for univariate Polynomials, and a multivariate extension for 3-SAT | <|reference_start|>Another approach to decide on real root existence for univariate Polynomials, and a multivariate extension for 3-SAT: We present six Theorems on the univariate real Polynomial, using which we develop a new algorithm for deciding the existence of atleast one real root for univariate integer Polynomial... | arxiv | @article{chermakani2008another,
title={Another approach to decide on real root existence for univariate
Polynomials, and a multivariate extension for 3-SAT},
author={Deepak Ponvel Chermakani},
journal={arXiv preprint arXiv:0803.0018},
year={2008},
archivePrefix={arXiv},
eprint={0803.0018},
... | chermakani2008another |
arxiv-2920 | 0803.0032 | Composition Attacks and Auxiliary Information in Data Privacy | <|reference_start|>Composition Attacks and Auxiliary Information in Data Privacy: Privacy is an increasingly important aspect of data publishing. Reasoning about privacy, however, is fraught with pitfalls. One of the most significant is the auxiliary information (also called external knowledge, background knowledge, or... | arxiv | @article{ganta2008composition,
title={Composition Attacks and Auxiliary Information in Data Privacy},
author={Srivatsava Ranjit Ganta, Shiva Prasad Kasiviswanathan, Adam Smith},
journal={arXiv preprint arXiv:0803.0032},
year={2008},
archivePrefix={arXiv},
eprint={0803.0032},
primaryClass={cs... | ganta2008composition |
arxiv-2921 | 0803.0034 | From a set of parts to an indivisible whole Part I: Operations in a closed mode | <|reference_start|>From a set of parts to an indivisible whole Part I: Operations in a closed mode: This paper provides a description of a new method for information processing based on holistic approach wherein analysis is a direct product of synthesis. The core of the method is iterative averaging of all the elements... | arxiv | @article{andreev2008from,
title={From a set of parts to an indivisible whole. Part I: Operations in a
closed mode},
author={Leonid Andreev},
journal={arXiv preprint arXiv:0803.0034},
year={2008},
archivePrefix={arXiv},
eprint={0803.0034},
primaryClass={cs.OH}
} | andreev2008from |
arxiv-2922 | 0803.0037 | A Survey on Deep Packet Inspection for Intrusion Detection Systems | <|reference_start|>A Survey on Deep Packet Inspection for Intrusion Detection Systems: Deep packet inspection is widely recognized as a powerful way which is used for intrusion detection systems for inspecting, deterring and deflecting malicious attacks over the network. Fundamentally, almost intrusion detection system... | arxiv | @article{abuhmed2008a,
title={A Survey on Deep Packet Inspection for Intrusion Detection Systems},
author={Tamer AbuHmed, Abedelaziz Mohaisen, DaeHun Nyang},
journal={Magazine of Korea Telecommunication Society, vol. 24, No. 11, pp.
25-36, November 2007},
year={2008},
archivePrefix={arXiv},
ep... | abuhmed2008a |
arxiv-2923 | 0803.0046 | One-Time Pad, Arithmetic Coding and Logic Gates: An unifying theme using Dynamical Systems | <|reference_start|>One-Time Pad, Arithmetic Coding and Logic Gates: An unifying theme using Dynamical Systems: In this letter, we prove that the perfectly secure One-Time Pad (OTP) encryption can be seen as finding the initial condition on the binary map under a random switch based on the perfectly random pad. This tur... | arxiv | @article{nagaraj2008one-time,
title={One-Time Pad, Arithmetic Coding and Logic Gates: An unifying theme using
Dynamical Systems},
author={Nithin Nagaraj and Prabhakar G. Vaidya},
journal={arXiv preprint arXiv:0803.0046},
year={2008},
archivePrefix={arXiv},
eprint={0803.0046},
primaryClass=... | nagaraj2008one-time |
arxiv-2924 | 0803.0048 | A Bit-Compatible Shared Memory Parallelization for ILU(k) Preconditioning and a Bit-Compatible Generalization to Distributed Memory | <|reference_start|>A Bit-Compatible Shared Memory Parallelization for ILU(k) Preconditioning and a Bit-Compatible Generalization to Distributed Memory: ILU(k) is a commonly used preconditioner for iterative linear solvers for sparse, non-symmetric systems. It is often preferred for the sake of its stability. We present... | arxiv | @article{dong2008a,
title={A Bit-Compatible Shared Memory Parallelization for ILU(k)
Preconditioning and a Bit-Compatible Generalization to Distributed Memory},
author={Xin Dong, Gene Cooperman},
journal={arXiv preprint arXiv:0803.0048},
year={2008},
archivePrefix={arXiv},
eprint={0803.0048},
... | dong2008a |
arxiv-2925 | 0803.0053 | Mobile Agents for Content-Based WWW Distributed Image Retrieval | <|reference_start|>Mobile Agents for Content-Based WWW Distributed Image Retrieval: At present, the de-facto standard for providing contents in the Internet is the World Wide Web. A technology, which is now emerging on the Web, is Content-Based Image Retrieval (CBIR). CBIR applies methods and algorithms from computer s... | arxiv | @article{thampi2008mobile,
title={Mobile Agents for Content-Based WWW Distributed Image Retrieval},
author={Sabu M. Thampi, K. Chandra Sekaran},
journal={arXiv preprint arXiv:0803.0053},
year={2008},
archivePrefix={arXiv},
eprint={0803.0053},
primaryClass={cs.DC cs.IR}
} | thampi2008mobile |
arxiv-2926 | 0803.0055 | A compact topology for sand automata | <|reference_start|>A compact topology for sand automata: In this paper, we exhibit a strong relation between the sand automata configuration space and the cellular automata configuration space. This relation induces a compact topology for sand automata, and a new context in which sand automata are homeomorphic to cellu... | arxiv | @article{dennunzio2008a,
title={A compact topology for sand automata},
author={Alberto Dennunzio (DISCo), Pierre Guillon (IGM), Beno^it Masson (LIF)},
journal={arXiv preprint arXiv:0803.0055},
year={2008},
archivePrefix={arXiv},
eprint={0803.0055},
primaryClass={cs.CC}
} | dennunzio2008a |
arxiv-2927 | 0803.0134 | On disjoint matchings in cubic graphs | <|reference_start|>On disjoint matchings in cubic graphs: For $i=2,3$ and a cubic graph $G$ let $\nu_{i}(G)$ denote the maximum number of edges that can be covered by $i$ matchings. We show that $\nu_{2}(G)\geq {4/5}| V(G)| $ and $\nu_{3}(G)\geq {7/6}| V(G)| $. Moreover, it turns out that $\nu_{2}(G)\leq \frac{|V(G)|+2... | arxiv | @article{mkrtchyan2008on,
title={On disjoint matchings in cubic graphs},
author={Vahan V. Mkrtchyan, Samvel S. Petrosyan, Gagik N. Vardanyan},
journal={Discrete Mathematics, 310/10-11 (2010), pp. 1588-1613},
year={2008},
doi={10.1016/j.disc.2010.02.007},
archivePrefix={arXiv},
eprint={0803.0... | mkrtchyan2008on |
arxiv-2928 | 0803.0146 | Polynomial time algorithms for bi-criteria, multi-objective and ratio problems in clustering and imaging Part I: Normalized cut and ratio regions | <|reference_start|>Polynomial time algorithms for bi-criteria, multi-objective and ratio problems in clustering and imaging Part I: Normalized cut and ratio regions: Partitioning and grouping of similar objects plays a fundamental role in image segmentation and in clustering problems. In such problems a typical goal is... | arxiv | @article{hochbaum2008polynomial,
title={Polynomial time algorithms for bi-criteria, multi-objective and ratio
problems in clustering and imaging. Part I: Normalized cut and ratio regions},
author={Dorit S. Hochbaum},
journal={IEEE Transactions on Pattern Analysis and Machine Intelligence,
May 2010 32:5 ... | hochbaum2008polynomial |
arxiv-2929 | 0803.0159 | Towards a Spreadsheet Engineering | <|reference_start|>Towards a Spreadsheet Engineering: In this paper, we report some on-going focused research, but are further keen to set it in the context of a proposed bigger picture, as follows. There is a certain depressing pattern about the attitude of industry to spreadsheet error research and a certain pattern ... | arxiv | @article{vemula2008towards,
title={Towards a Spreadsheet Engineering},
author={V.R. Vemula, David Ball, Simon Thorne},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2006 53-64
ISBN:1-905617-08-9},
year={2008},
archivePrefix={arXiv},
eprint={0803.0159},
primaryClass={cs.CY}
... | vemula2008towards |
arxiv-2930 | 0803.0162 | A Software Development Methodology for Research and Prototyping in Financial Markets | <|reference_start|>A Software Development Methodology for Research and Prototyping in Financial Markets: The objective of this paper is to develop a standardized methodology for software development in the very unique industry and culture of financial markets. The prototyping process we present allows the development t... | arxiv | @article{kumiega2008a,
title={A Software Development Methodology for Research and Prototyping in
Financial Markets},
author={Andrew Kumiega, Ben Van Vliet},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2006 107-127
ISBN:1-905617-08-9},
year={2008},
archivePrefix={arXiv},
epr... | kumiega2008a |
arxiv-2931 | 0803.0163 | Rapid Spreadsheet Reshaping with Excelsior: multiple drastic changes to content and layout are easy when you represent enough structure | <|reference_start|>Rapid Spreadsheet Reshaping with Excelsior: multiple drastic changes to content and layout are easy when you represent enough structure: Spreadsheets often need changing in ways made tedious and risky by Excel. For example: simultaneously altering many tables' size, orientation, and position; inserti... | arxiv | @article{paine2008rapid,
title={Rapid Spreadsheet Reshaping with Excelsior: multiple drastic changes to
content and layout are easy when you represent enough structure},
author={Jocelyn Paine, Emre Tek, Duncan Williamson},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2006 129-146
ISBN:1... | paine2008rapid |
arxiv-2932 | 0803.0164 | Considering Functional Spreadsheet Operator Usage Suggests the Value of Example Driven Modelling for Decision Support Systems | <|reference_start|>Considering Functional Spreadsheet Operator Usage Suggests the Value of Example Driven Modelling for Decision Support Systems: Most spreadsheet surveys both for reporting use and error focus on the practical application of the spreadsheet in a particular industry. Typically these studies will illustr... | arxiv | @article{thorne2008considering,
title={Considering Functional Spreadsheet Operator Usage Suggests the Value of
Example Driven Modelling for Decision Support Systems},
author={Simon Thorne, David Ball},
journal={roc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2006 147-158
ISBN:1-905617-08-9},
yea... | thorne2008considering |
arxiv-2933 | 0803.0165 | Documenting Spreadsheets | <|reference_start|>Documenting Spreadsheets: This paper discusses spreadsheets documentation and new means to achieve this end by using Excel's built-in "Comment" function. By structuring comments, they can be used as an essential tool to fully explain spreadsheet. This will greatly facilitate spreadsheet change contro... | arxiv | @article{payette2008documenting,
title={Documenting Spreadsheets},
author={Raymond Payette},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2006 163-173
ISBN:1-905617-08-9},
year={2008},
archivePrefix={arXiv},
eprint={0803.0165},
primaryClass={cs.HC}
} | payette2008documenting |
arxiv-2934 | 0803.0166 | Spreadsheet Validation and Analysis through Content Visualization | <|reference_start|>Spreadsheet Validation and Analysis through Content Visualization: Visualizing spreadsheet content provides analytic insight and visual validation of large amounts of spreadsheet data. Oculus Excel Visualizer is a point and click data visualization experiment which directly visualizes Excel data and ... | arxiv | @article{brath2008spreadsheet,
title={Spreadsheet Validation and Analysis through Content Visualization},
author={Richard Brath, Michael Peters},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2006 175-183
ISBN:1-905617-08-9},
year={2008},
archivePrefix={arXiv},
eprint={0803.016... | brath2008spreadsheet |
arxiv-2935 | 0803.0167 | Does an awareness of differing types of spreadsheet errors aid end-users in identifying spreadsheets errors? | <|reference_start|>Does an awareness of differing types of spreadsheet errors aid end-users in identifying spreadsheets errors?: The research presented in this paper establishes a valid, and simplified, revision of previous spreadsheet error classifications. This investigation is concerned with the results of a web sur... | arxiv | @article{purser2008does,
title={Does an awareness of differing types of spreadsheet errors aid end-users
in identifying spreadsheets errors?},
author={Michael Purser, David Chadwick},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2006 185-204
ISBN:1-905617-08-9},
year={2008},
arc... | purser2008does |
arxiv-2936 | 0803.0168 | Comparison of Characteristics and Practices amongst Spreadsheet Users with Different Levels of Experience | <|reference_start|>Comparison of Characteristics and Practices amongst Spreadsheet Users with Different Levels of Experience: We developed an internet-based questionnaire on spreadsheet use that we administered to a large number of users in several companies and organizations to document how spreadsheets are currently ... | arxiv | @article{baker2008comparison,
title={Comparison of Characteristics and Practices amongst Spreadsheet Users
with Different Levels of Experience},
author={Kenneth R. Baker, Stephen G. Powell, Barry Lawson, and Lynn
Foster-Johnson},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2006 205-219... | baker2008comparison |
arxiv-2937 | 0803.0169 | An Investigation of the Incidence and Effect of Spreadsheet Errors Caused by the Hard Coding of Input Data Values into Formulas | <|reference_start|>An Investigation of the Incidence and Effect of Spreadsheet Errors Caused by the Hard Coding of Input Data Values into Formulas: The hard coding of input data or constants into spreadsheet formulas is widely recognised as poor spreadsheet model design. However, the importance of avoiding such practic... | arxiv | @article{blayney2008an,
title={An Investigation of the Incidence and Effect of Spreadsheet Errors
Caused by the Hard Coding of Input Data Values into Formulas},
author={Paul J. Blayney},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2006 22-230
ISBN:1-905617-08-9},
year={2008},
a... | blayney2008an |
arxiv-2938 | 0803.0189 | Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs | <|reference_start|>Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs: This paper considers gossiping among mobile agents in graphs: agents move on the graph and have to disseminate their initial information to every other agent. We focus on self-stabilizing solutions for the gossip problem, where a... | arxiv | @article{masuzawa2008quiescence,
title={Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs},
author={Toshimitsu Masuzawa, S'ebastien Tixeuil (LIP6, INRIA Futurs)},
journal={arXiv preprint arXiv:0803.0189},
year={2008},
archivePrefix={arXiv},
eprint={0803.0189},
primaryCla... | masuzawa2008quiescence |
arxiv-2939 | 0803.0194 | Acquisition Accuracy Evaluation in Visual Inspection Systems - a Practical Approach | <|reference_start|>Acquisition Accuracy Evaluation in Visual Inspection Systems - a Practical Approach: This paper draws a proposal of a set of parameters and methods for accuracy evaluation of visual inspection systems. The case of a monochrome board is treated, but practically all conclusions and methods may be exten... | arxiv | @article{arsinte2008acquisition,
title={Acquisition Accuracy Evaluation in Visual Inspection Systems - a
Practical Approach},
author={Radu Arsinte, Costin Miron},
journal={Proceeedings of ETc '96 Conference, 1996, Timisoara, Romania},
year={2008},
archivePrefix={arXiv},
eprint={0803.0194},
... | arsinte2008acquisition |
arxiv-2940 | 0803.0197 | DSP Based System for Real time Voice Synthesis Applications Development | <|reference_start|>DSP Based System for Real time Voice Synthesis Applications Development: This paper describes an experimental system designed for development of real time voice synthesis applications. The system is composed from a DSP coprocessor card, equipped with an TMS320C25 or TMS320C50 chip, voice acquisition ... | arxiv | @article{arsinte2008dsp,
title={DSP Based System for Real time Voice Synthesis Applications Development},
author={Radu Arsinte, Attila Ferencz, Costin Miron},
journal={Proceedings of SPECOM' 96 Conference, 1996, St. Petersburg, Russia},
year={2008},
archivePrefix={arXiv},
eprint={0803.0197},
... | arsinte2008dsp |
arxiv-2941 | 0803.0225 | Random hypergraphs and algorithmics | <|reference_start|>Random hypergraphs and algorithmics: Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of hypergraph component is ... | arxiv | @article{andriamampianina2008random,
title={Random hypergraphs and algorithmics},
author={Tsiriniaina Andriamampianina},
journal={arXiv preprint arXiv:0803.0225},
year={2008},
archivePrefix={arXiv},
eprint={0803.0225},
primaryClass={cs.DM}
} | andriamampianina2008random |
arxiv-2942 | 0803.0241 | Self-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker Networks | <|reference_start|>Self-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker Networks: We define the ``Pulse Synchronization'' problem that requires nodes to achieve tight synchronization of regular pulse events, in the settings of distributed computing systems. Pulse-coupled synchronization is a phenomen... | arxiv | @article{daliot2008self-stabilizing,
title={Self-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker
Networks},
author={Ariel Daliot, Danny Dolev, and Hanna Parnas},
journal={In Proceedings of the Sixth Symposium on Self-Stabilizing Systems
(SSS'03), San Francisco, June 2003. See also LNC... | daliot2008self-stabilizing |
arxiv-2943 | 0803.0248 | Networks become navigable as nodes move and forget | <|reference_start|>Networks become navigable as nodes move and forget: We propose a dynamical process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of individuals are linked by a short chain of acquaintances computable by a simpl... | arxiv | @article{chaintreau2008networks,
title={Networks become navigable as nodes move and forget},
author={Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar},
journal={arXiv preprint arXiv:0803.0248},
year={2008},
archivePrefix={arXiv},
eprint={0803.0248},
primaryClass={cs.DS}
} | chaintreau2008networks |
arxiv-2944 | 0803.0265 | Blind Fingerprinting | <|reference_start|>Blind Fingerprinting: We study blind fingerprinting, where the host sequence into which fingerprints are embedded is partially or completely unknown to the decoder. This problem relates to a multiuser version of the Gel'fand-Pinsker problem. The number of colluders and the collusion channel are unkno... | arxiv | @article{wang2008blind,
title={Blind Fingerprinting},
author={Ying Wang and Pierre Moulin},
journal={arXiv preprint arXiv:0803.0265},
year={2008},
archivePrefix={arXiv},
eprint={0803.0265},
primaryClass={cs.IT math.IT}
} | wang2008blind |
arxiv-2945 | 0803.0316 | Staged Self-Assembly:Nanomanufacture of Arbitrary Shapes with O(1) Glues | <|reference_start|>Staged Self-Assembly:Nanomanufacture of Arbitrary Shapes with O(1) Glues: We introduce staged self-assembly of Wang tiles, where tiles can be added dynamically in sequence and where intermediate constructions can be stored for later mixing. This model and its various constraints and performance measu... | arxiv | @article{demaine2008staged,
title={Staged Self-Assembly:Nanomanufacture of Arbitrary Shapes with O(1) Glues},
author={Erik D. Demaine, Martin L. Demaine, Sandor P. Fekete, Mashhood
Ishaque, Eynat Rafalin, Robert T. Schweller and Diane Souvaine},
journal={arXiv preprint arXiv:0803.0316},
year={2008},
... | demaine2008staged |
arxiv-2946 | 0803.0378 | Thread algebra for poly-threading | <|reference_start|>Thread algebra for poly-threading: Threads as considered in basic thread algebra are primarily looked upon as behaviours exhibited by sequential programs on execution. It is a fact of life that sequential programs are often fragmented. Consequently, fragmented program behaviours are frequently found.... | arxiv | @article{bergstra2008thread,
title={Thread algebra for poly-threading},
author={J. A. Bergstra, C. A. Middelburg},
journal={Formal Aspects of Computing, 23(4):567--583, 2011},
year={2008},
doi={10.1007/s00165-011-0178-3},
number={PRG0810},
archivePrefix={arXiv},
eprint={0803.0378},
p... | bergstra2008thread |
arxiv-2947 | 0803.0398 | In-depth analysis of the Naming Game dynamics: the homogeneous mixing case | <|reference_start|>In-depth analysis of the Naming Game dynamics: the homogeneous mixing case: Language emergence and evolution has recently gained growing attention through multi-agent models and mathematical frameworks to study their behavior. Here we investigate further the Naming Game, a model able to account for t... | arxiv | @article{baronchelli2008in-depth,
title={In-depth analysis of the Naming Game dynamics: the homogeneous mixing
case},
author={Andrea Baronchelli, Vittorio Loreto, Luc Steels},
journal={Int. J. Mod. Phys. C 19, 785 (2008)},
year={2008},
doi={10.1142/S0129183108012522},
archivePrefix={arXiv},
... | baronchelli2008in-depth |
arxiv-2948 | 0803.0404 | The Complexity of Testing Properties of Simple Games | <|reference_start|>The Complexity of Testing Properties of Simple Games: Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of ``yea'' votes ... | arxiv | @article{freixas2008the,
title={The Complexity of Testing Properties of Simple Games},
author={Josep Freixas, Xavier Molinero, Martin Olsen, Maria Serna},
journal={arXiv preprint arXiv:0803.0404},
year={2008},
archivePrefix={arXiv},
eprint={0803.0404},
primaryClass={cs.GT cs.CC}
} | freixas2008the |
arxiv-2949 | 0803.0405 | Multi-dimensional sparse time series: feature extraction | <|reference_start|>Multi-dimensional sparse time series: feature extraction: We show an analysis of multi-dimensional time series via entropy and statistical linguistic techniques. We define three markers encoding the behavior of the series, after it has been translated into a multi-dimensional symbolic sequence. The l... | arxiv | @article{franciosi2008multi-dimensional,
title={Multi-dimensional sparse time series: feature extraction},
author={Marco Franciosi, Giulia Menconi},
journal={arXiv preprint arXiv:0803.0405},
year={2008},
archivePrefix={arXiv},
eprint={0803.0405},
primaryClass={cs.MM cs.IR}
} | franciosi2008multi-dimensional |
arxiv-2950 | 0803.0412 | Essential conditions for evolution of communication within a species | <|reference_start|>Essential conditions for evolution of communication within a species: A major obstacle in analyzing the evolution of information exchange and processing is our insufficient understanding of the underlying signaling and decision-making biological mechanisms. For instance, it is unclear why are humans ... | arxiv | @article{feigel2008essential,
title={Essential conditions for evolution of communication within a species},
author={A. Feigel},
journal={arXiv preprint arXiv:0803.0412},
year={2008},
doi={10.1016/j.jtbi.2008.07.005},
archivePrefix={arXiv},
eprint={0803.0412},
primaryClass={q-bio.PE cs.GT... | feigel2008essential |
arxiv-2951 | 0803.0428 | Zero-Forcing Precoding for Frequency Selective MIMO Channels with $H^\infty$ Criterion and Causality Constraint | <|reference_start|>Zero-Forcing Precoding for Frequency Selective MIMO Channels with $H^\infty$ Criterion and Causality Constraint: We consider zero-forcing equalization of frequency selective MIMO channels by causal and linear time-invariant precoders in the presence of intersymbol interference. Our motivation is twof... | arxiv | @article{wahls2008zero-forcing,
title={Zero-Forcing Precoding for Frequency Selective MIMO Channels with
$H^\infty$ Criterion and Causality Constraint},
author={Sander Wahls, Holger Boche, Volker Pohl},
journal={Signal Processing, Vol. 89, No. 9, pp. 1754-1761, Sep. 2009},
year={2008},
doi={10.101... | wahls2008zero-forcing |
arxiv-2952 | 0803.0439 | Optimizing polynomials for floating-point implementation | <|reference_start|>Optimizing polynomials for floating-point implementation: The floating-point implementation of a function on an interval often reduces to polynomial approximation, the polynomial being typically provided by Remez algorithm. However, the floating-point evaluation of a Remez polynomial sometimes leads ... | arxiv | @article{de dinechin2008optimizing,
title={Optimizing polynomials for floating-point implementation},
author={Florent De Dinechin (LIP), Christoph Quirin Lauter (LIP)},
journal={arXiv preprint arXiv:0803.0439},
year={2008},
archivePrefix={arXiv},
eprint={0803.0439},
primaryClass={cs.NA cs.MS... | de dinechin2008optimizing |
arxiv-2953 | 0803.0450 | Inferring Neuronal Network Connectivity from Spike Data: A Temporal Datamining Approach | <|reference_start|>Inferring Neuronal Network Connectivity from Spike Data: A Temporal Datamining Approach: Understanding the functioning of a neural system in terms of its underlying circuitry is an important problem in neuroscience. Recent developments in electrophysiology and imaging allow one to simultaneously reco... | arxiv | @article{patnaik2008inferring,
title={Inferring Neuronal Network Connectivity from Spike Data: A Temporal
Datamining Approach},
author={Debprakash Patnaik (Electical Engg. Dept., Indian Institute of
Science, Bangalore), and P. S. Sastry (Electrical Engg. Dept., Indian
Institute of Science, Bangalore), and... | patnaik2008inferring |
arxiv-2954 | 0803.0473 | Stream sampling for variance-optimal estimation of subset sums | <|reference_start|>Stream sampling for variance-optimal estimation of subset sums: From a high volume stream of weighted items, we want to maintain a generic sample of a certain limited size $k$ that we can later use to estimate the total weight of arbitrary subsets. This is the classic context of on-line reservoir sam... | arxiv | @article{cohen2008stream,
title={Stream sampling for variance-optimal estimation of subset sums},
author={Edith Cohen, Nick Duffield, Haim Kaplan, Carsten Lund, and Mikkel
Thorup},
journal={arXiv preprint arXiv:0803.0473},
year={2008},
archivePrefix={arXiv},
eprint={0803.0473},
primaryClas... | cohen2008stream |
arxiv-2955 | 0803.0476 | Fast unfolding of communities in large networks | <|reference_start|>Fast unfolding of communities in large networks: We propose a simple method to extract the community structure of large networks. Our method is a heuristic method that is based on modularity optimization. It is shown to outperform all other known community detection method in terms of computation tim... | arxiv | @article{blondel2008fast,
title={Fast unfolding of communities in large networks},
author={Vincent D. Blondel, Jean-Loup Guillaume, Renaud Lambiotte and Etienne
Lefebvre},
journal={J. Stat. Mech. (2008) P10008},
year={2008},
doi={10.1088/1742-5468/2008/10/P10008},
archivePrefix={arXiv},
ep... | blondel2008fast |
arxiv-2956 | 0803.0515 | Intuitive Source Code Visualization Tools for Improving Student Comprehension: BRICS | <|reference_start|>Intuitive Source Code Visualization Tools for Improving Student Comprehension: BRICS: Even relatively simple code analysis can be a daunting task for many first year students. Perceived complexity, coupled with foreign and harsh syntax, often outstrips the ability for students to take in what they ar... | arxiv | @article{pearson2008intuitive,
title={Intuitive Source Code Visualization Tools for Improving Student
Comprehension: BRICS},
author={Christopher Pearson, Celina Gibbs, Yvonne Coady},
journal={arXiv preprint arXiv:0803.0515},
year={2008},
archivePrefix={arXiv},
eprint={0803.0515},
primaryCl... | pearson2008intuitive |
arxiv-2957 | 0803.0528 | Une approche modulaire probabiliste pour le routage \`a Qualit\'e de Service int\'egr\'ee | <|reference_start|>Une approche modulaire probabiliste pour le routage \`a Qualit\'e de Service int\'egr\'ee: Due to emerging real-time and multimedia applications, efficient routing of information packets in dynamically changing communication network requires that as the load levels, traffic patterns and topology of t... | arxiv | @article{hoceini2008une,
title={Une approche modulaire probabiliste pour le routage \`a Qualit\'e de
Service int\'egr\'ee},
author={Said Hoceini (LISSI - Ea 3956), Abdelhamid Mellouk (LISSI - Ea 3956),
Hayet Hafi (LISSI - Ea 3956)},
journal={Colloque Francophone sur l'Ing\'enierie des Protocoles (CFIP),... | hoceini2008une |
arxiv-2958 | 0803.0529 | Evaluation and exploitation of knowledge robustness in knowledge-based systems | <|reference_start|>Evaluation and exploitation of knowledge robustness in knowledge-based systems: Industrial knowledge is complex, difficult to formalize and very dynamic in reason of the continuous development of techniques and technologies. The verification of the validity of the knowledge base at the time of its el... | arxiv | @article{barcikowski2008evaluation,
title={Evaluation and exploitation of knowledge robustness in knowledge-based
systems},
author={M. Barcikowski (INRIA Sophia Antipolis), P. Pernelle, A. Lefebvre
(AIB_ERN), M. Martinez, J. Renaud},
journal={Dans Proceedings - 9th IFAC (IEEE Control Systems Society) Sy... | barcikowski2008evaluation |
arxiv-2959 | 0803.0597 | Cooperative Spectrum Sensing Using Random Matrix Theory | <|reference_start|>Cooperative Spectrum Sensing Using Random Matrix Theory: In this paper, using tools from asymptotic random matrix theory, a new cooperative scheme for frequency band sensing is introduced for both AWGN and fading channels. Unlike previous works in the field, the new scheme does not require the knowle... | arxiv | @article{cardoso2008cooperative,
title={Cooperative Spectrum Sensing Using Random Matrix Theory},
author={L. S. Cardoso, M. Debbah, P. Bianchi, J. Najim},
journal={arXiv preprint arXiv:0803.0597},
year={2008},
archivePrefix={arXiv},
eprint={0803.0597},
primaryClass={cs.IT math.IT}
} | cardoso2008cooperative |
arxiv-2960 | 0803.0610 | On the Approximate Eigenstructure of Time-Varying Channels | <|reference_start|>On the Approximate Eigenstructure of Time-Varying Channels: In this article we consider the approximate description of doubly--dispersive channels by its symbol. We focus on channel operators with compactly supported spreading, which are widely used to represent fast fading multipath communication ch... | arxiv | @article{jung2008on,
title={On the Approximate Eigenstructure of Time-Varying Channels},
author={Peter Jung},
journal={arXiv preprint arXiv:0803.0610},
year={2008},
archivePrefix={arXiv},
eprint={0803.0610},
primaryClass={cs.IT math.IT}
} | jung2008on |
arxiv-2961 | 0803.0632 | Network Coding for Distributed Storage Systems | <|reference_start|>Network Coding for Distributed Storage Systems: Distributed storage systems provide reliable access to data through redundancy spread over individually unreliable nodes. Application scenarios include data centers, peer-to-peer storage systems, and storage in wireless networks. Storing data using an e... | arxiv | @article{dimakis2008network,
title={Network Coding for Distributed Storage Systems},
author={Alexandros G. Dimakis, P. Brighten Godfrey, Yunnan Wu, Martin J.
Wainwright, Kannan Ramchandran},
journal={arXiv preprint arXiv:0803.0632},
year={2008},
number={EECS 14546},
archivePrefix={arXiv},
... | dimakis2008network |
arxiv-2962 | 0803.0653 | Aggregating and Deploying Network Access Control Policies | <|reference_start|>Aggregating and Deploying Network Access Control Policies: The existence of errors or inconsistencies in the configuration of security components, such as filtering routers and/or firewalls, may lead to weak access control policies -- potentially easy to be evaded by unauthorized parties. We present ... | arxiv | @article{garcia-alfaro2008aggregating,
title={Aggregating and Deploying Network Access Control Policies},
author={Joaquin Garcia-Alfaro, Frederic Cuppens, Nora Cuppens-Boulahia},
journal={Proc. 2007 International Symposium on Frontiers in Availability,
Reliability and Security (FARES), Vienna (Austria), 1... | garcia-alfaro2008aggregating |
arxiv-2963 | 0803.0661 | Towards an Optimal Separation of Space and Length in Resolution | <|reference_start|>Towards an Optimal Separation of Space and Length in Resolution: Most state-of-the-art satisfiability algorithms today are variants of the DPLL procedure augmented with clause learning. The main bottleneck for such algorithms, other than the obvious one of time, is the amount of memory used. In the f... | arxiv | @article{nordström2008towards,
title={Towards an Optimal Separation of Space and Length in Resolution},
author={Jakob Nordstr"om, Johan H{aa}stad},
journal={arXiv preprint arXiv:0803.0661},
year={2008},
archivePrefix={arXiv},
eprint={0803.0661},
primaryClass={cs.CC cs.LO}
} | nordström2008towards |
arxiv-2964 | 0803.0666 | An approach to control collaborative processes in PLM systems | <|reference_start|>An approach to control collaborative processes in PLM systems: Companies that collaborate within the product development processes need to implement an effective management of their collaborative activities. Despite the implementation of a PLM system, the collaborative activities are not efficient as... | arxiv | @article{kadiri2008an,
title={An approach to control collaborative processes in PLM systems},
author={Soumaya El Kadiri (LIESP), Philippe Pernelle (LIESP), Miguel Delattre
(LIESP), Abdelaziz Bouras (LIESP)},
journal={Dans Workshop on Extended Product and Process Analysis aNd Design
- Extended Product an... | kadiri2008an |
arxiv-2965 | 0803.0701 | Spanning directed trees with many leaves | <|reference_start|>Spanning directed trees with many leaves: The {\sc Directed Maximum Leaf Out-Branching} problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this paper, we obtain two combinatorial results on the number of leaves in out-br... | arxiv | @article{alon2008spanning,
title={Spanning directed trees with many leaves},
author={N Alon, F.V. Fomin, G. Gutin, M. Krivelevich and S. Saurabh},
journal={arXiv preprint arXiv:0803.0701},
year={2008},
archivePrefix={arXiv},
eprint={0803.0701},
primaryClass={cs.DS cs.DM}
} | alon2008spanning |
arxiv-2966 | 0803.0726 | A quadratic algorithm for road coloring | <|reference_start|>A quadratic algorithm for road coloring: The Road Coloring Theorem states that every aperiodic directed graph with constant out-degree has a synchronized coloring. This theorem had been conjectured during many years as the Road Coloring Problem before being settled by A. Trahtman. Trahtman's proof le... | arxiv | @article{béal2008a,
title={A quadratic algorithm for road coloring},
author={Marie-Pierre B'eal, Dominique Perrin},
journal={arXiv preprint arXiv:0803.0726},
year={2008},
archivePrefix={arXiv},
eprint={0803.0726},
primaryClass={cs.DS cs.DM}
} | béal2008a |
arxiv-2967 | 0803.0731 | Complexity Analysis of Reed-Solomon Decoding over GF(2^m) Without Using Syndromes | <|reference_start|>Complexity Analysis of Reed-Solomon Decoding over GF(2^m) Without Using Syndromes: For the majority of the applications of Reed-Solomon (RS) codes, hard decision decoding is based on syndromes. Recently, there has been renewed interest in decoding RS codes without using syndromes. In this paper, we i... | arxiv | @article{chen2008complexity,
title={Complexity Analysis of Reed-Solomon Decoding over GF(2^m) Without Using
Syndromes},
author={Ning Chen and Zhiyuan Yan},
journal={arXiv preprint arXiv:0803.0731},
year={2008},
archivePrefix={arXiv},
eprint={0803.0731},
primaryClass={cs.IT cs.CC cs.DS math... | chen2008complexity |
arxiv-2968 | 0803.0755 | Toeplitz Block Matrices in Compressed Sensing | <|reference_start|>Toeplitz Block Matrices in Compressed Sensing: Recent work in compressed sensing theory shows that $n\times N$ independent and identically distributed (IID) sensing matrices whose entries are drawn independently from certain probability distributions guarantee exact recovery of a sparse signal with h... | arxiv | @article{sebert2008toeplitz,
title={Toeplitz Block Matrices in Compressed Sensing},
author={Florian Sebert, Leslie Ying, and Yi Ming Zou},
journal={arXiv preprint arXiv:0803.0755},
year={2008},
archivePrefix={arXiv},
eprint={0803.0755},
primaryClass={cs.IT math.IT math.PR}
} | sebert2008toeplitz |
arxiv-2969 | 0803.0764 | Asymmetric and Symmetric Subsystem BCH Codes and Beyond | <|reference_start|>Asymmetric and Symmetric Subsystem BCH Codes and Beyond: Recently, the theory of quantum error control codes has been extended to subsystem codes over symmetric and asymmetric quantum channels -- qubit-flip and phase-shift errors may have equal or different probabilities. Previous work in constructin... | arxiv | @article{aly2008asymmetric,
title={Asymmetric and Symmetric Subsystem BCH Codes and Beyond},
author={Salah A. Aly},
journal={arXiv preprint arXiv:0803.0764},
year={2008},
archivePrefix={arXiv},
eprint={0803.0764},
primaryClass={quant-ph cs.IT math.IT}
} | aly2008asymmetric |
arxiv-2970 | 0803.0778 | Constant-Rank Codes | <|reference_start|>Constant-Rank Codes: Constant-dimension codes have recently received attention due to their significance to error control in noncoherent random network coding. In this paper, we show that constant-rank codes are closely related to constant-dimension codes and we study the properties of constant-rank ... | arxiv | @article{gadouleau2008constant-rank,
title={Constant-Rank Codes},
author={Maximilien Gadouleau and Zhiyuan Yan},
journal={arXiv preprint arXiv:0803.0778},
year={2008},
archivePrefix={arXiv},
eprint={0803.0778},
primaryClass={cs.IT math.IT}
} | gadouleau2008constant-rank |
arxiv-2971 | 0803.0792 | Incremental Topological Ordering and Strong Component Maintenance | <|reference_start|>Incremental Topological Ordering and Strong Component Maintenance: We present an on-line algorithm for maintaining a topological order of a directed acyclic graph as arcs are added, and detecting a cycle when one is created. Our algorithm takes O(m^{1/2}) amortized time per arc, where m is the total ... | arxiv | @article{haeupler2008incremental,
title={Incremental Topological Ordering and Strong Component Maintenance},
author={Bernhard Haeupler, Siddhartha Sen, and Robert E. Tarjan},
journal={arXiv preprint arXiv:0803.0792},
year={2008},
archivePrefix={arXiv},
eprint={0803.0792},
primaryClass={cs.DS... | haeupler2008incremental |
arxiv-2972 | 0803.0803 | Un Algorithme de Gestion des Adjacences bas\'e sur la Puissance du Signal | <|reference_start|>Un Algorithme de Gestion des Adjacences bas\'e sur la Puissance du Signal: In this proposition, we present a link management technique for pro-active routing protocols for ad-hoc networks. This new mechanism is based on signal strength hence cross layer approach is used. The hysteresis mechanism prov... | arxiv | @article{ali2008un,
title={Un Algorithme de Gestion des Adjacences bas\'e sur la Puissance du
Signal},
author={Husnain Mansoor Ali (IEF), Anthony Busson (IEF), Amina Meraihi Naimi
(IEF), Veronique Veque (IEF)},
journal={Colloque Francophone sur l'Ing\'enierie des Protocoles (CFIP), Les
Arcs : France (... | ali2008un |
arxiv-2973 | 0803.0811 | Subspace Pursuit for Compressive Sensing Signal Reconstruction | <|reference_start|>Subspace Pursuit for Compressive Sensing Signal Reconstruction: We propose a new method for reconstruction of sparse signals with and without noisy perturbations, termed the subspace pursuit algorithm. The algorithm has two important characteristics: low computational complexity, comparable to that o... | arxiv | @article{dai2008subspace,
title={Subspace Pursuit for Compressive Sensing Signal Reconstruction},
author={Wei Dai and Olgica Milenkovic},
journal={arXiv preprint arXiv:0803.0811},
year={2008},
archivePrefix={arXiv},
eprint={0803.0811},
primaryClass={cs.NA cs.IT math.IT}
} | dai2008subspace |
arxiv-2974 | 0803.0822 | Website Optimization through Mining User Navigational Pattern | <|reference_start|>Website Optimization through Mining User Navigational Pattern: With the World Wide Web's ubiquity increase and the rapid development of various online businesses, the complexity of web sites grow. The analysis of web user's navigational pattern within a web site can provide useful information for ser... | arxiv | @article{biswal2008website,
title={Website Optimization through Mining User Navigational Pattern},
author={Biswajit Biswal},
journal={arXiv preprint arXiv:0803.0822},
year={2008},
archivePrefix={arXiv},
eprint={0803.0822},
primaryClass={cs.IR}
} | biswal2008website |
arxiv-2975 | 0803.0845 | Knapsack cryptosystems built on NP-hard instance | <|reference_start|>Knapsack cryptosystems built on NP-hard instance: We construct three public key knapsack cryptosystems. Standard knapsack cryptosystems hide easy instances of the knapsack problem and have been broken. The systems considered in the article face this problem: They hide a random (possibly hard) instanc... | arxiv | @article{evain2008knapsack,
title={Knapsack cryptosystems built on NP-hard instance},
author={Laurent Evain},
journal={arXiv preprint arXiv:0803.0845},
year={2008},
archivePrefix={arXiv},
eprint={0803.0845},
primaryClass={cs.CR cs.CC cs.DM cs.DS}
} | evain2008knapsack |
arxiv-2976 | 0803.0858 | Untangling planar graphs from a specified vertex position - Hard cases | <|reference_start|>Untangling planar graphs from a specified vertex position - Hard cases: Given a planar graph $G$, we consider drawings of $G$ in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an injective embedding $\pi$ of the vertex set of... | arxiv | @article{kang2008untangling,
title={Untangling planar graphs from a specified vertex position - Hard cases},
author={Mihyun Kang, Oleg Pikhurko, Alexander Ravsky, Mathias Schacht, Oleg
Verbitsky},
journal={Discrete Applied Mathematics 159:8 (2011) 789-799},
year={2008},
doi={10.1016/j.dam.2011.01.... | kang2008untangling |
arxiv-2977 | 0803.0862 | xPerm: fast index canonicalization for tensor computer algebra | <|reference_start|>xPerm: fast index canonicalization for tensor computer algebra: We present a very fast implementation of the Butler-Portugal algorithm for index canonicalization with respect to permutation symmetries. It is called xPerm, and has been written as a combination of a Mathematica package and a C subrouti... | arxiv | @article{martin-garcia2008xperm:,
title={xPerm: fast index canonicalization for tensor computer algebra},
author={Jose M. Martin-Garcia},
journal={Comp. Phys. Commun. 179 (2008) 597-603},
year={2008},
doi={10.1016/j.cpc.2008.05.009},
archivePrefix={arXiv},
eprint={0803.0862},
primaryClas... | martin-garcia2008xperm: |
arxiv-2978 | 0803.0874 | A Method for Solving Cyclic Block Penta-diagonal Systems of Linear Equations | <|reference_start|>A Method for Solving Cyclic Block Penta-diagonal Systems of Linear Equations: A method for solving cyclic block three-diagonal systems of equations is generalized for solving a block cyclic penta-diagonal system of equations. Introducing a special form of two new variables the original system is spli... | arxiv | @article{batista2008a,
title={A Method for Solving Cyclic Block Penta-diagonal Systems of Linear
Equations},
author={Milan Batista},
journal={arXiv preprint arXiv:0803.0874},
year={2008},
archivePrefix={arXiv},
eprint={0803.0874},
primaryClass={cs.MS cs.NA}
} | batista2008a |
arxiv-2979 | 0803.0875 | Vandermonde Frequency Division Multiplexing for Cognitive Radio | <|reference_start|>Vandermonde Frequency Division Multiplexing for Cognitive Radio: We consider a cognitive radio scenario where a primary and a secondary user wish to communicate with their corresponding receivers simultaneously over frequency selective channels. Under realistic assumptions that the secondary transmit... | arxiv | @article{cardoso2008vandermonde,
title={Vandermonde Frequency Division Multiplexing for Cognitive Radio},
author={L. S. Cardoso, M. Kobayashi, M. Debbah, O. Ryan},
journal={arXiv preprint arXiv:0803.0875},
year={2008},
archivePrefix={arXiv},
eprint={0803.0875},
primaryClass={cs.IT math.IT}
} | cardoso2008vandermonde |
arxiv-2980 | 0803.0924 | What Can We Learn Privately? | <|reference_start|>What Can We Learn Privately?: Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept classes can be learned privately, namely, by an algorithm whose output does not depend too h... | arxiv | @article{kasiviswanathan2008what,
title={What Can We Learn Privately?},
author={Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya
Raskhodnikova, and Adam Smith},
journal={SIAM Journal of Computing 40(3) (2011) 793-826},
year={2008},
archivePrefix={arXiv},
eprint={0803.0924},
... | kasiviswanathan2008what |
arxiv-2981 | 0803.0929 | Graph Sparsification by Effective Resistances | <|reference_start|>Graph Sparsification by Effective Resistances: We present a nearly-linear time algorithm that produces high-quality sparsifiers of weighted graphs. Given as input a weighted graph $G=(V,E,w)$ and a parameter $\epsilon>0$, we produce a weighted subgraph $H=(V,\tilde{E},\tilde{w})$ of $G$ such that $|\... | arxiv | @article{spielman2008graph,
title={Graph Sparsification by Effective Resistances},
author={Daniel A. Spielman, Nikhil Srivastava},
journal={arXiv preprint arXiv:0803.0929},
year={2008},
archivePrefix={arXiv},
eprint={0803.0929},
primaryClass={cs.DS}
} | spielman2008graph |
arxiv-2982 | 0803.0952 | Femtocell Networks: A Survey | <|reference_start|>Femtocell Networks: A Survey: The surest way to increase the system capacity of a wireless link is by getting the transmitter and receiver closer to each other, which creates the dual benefits of higher quality links and more spatial reuse. In a network with nomadic users, this inevitably involves de... | arxiv | @article{chandrasekhar2008femtocell,
title={Femtocell Networks: A Survey},
author={Vikram Chandrasekhar, Jeffrey Andrews and Alan Gatherer},
journal={arXiv preprint arXiv:0803.0952},
year={2008},
doi={10.1109/MCOM.2008.4623708},
archivePrefix={arXiv},
eprint={0803.0952},
primaryClass={cs... | chandrasekhar2008femtocell |
arxiv-2983 | 0803.0954 | Selective association rule generation | <|reference_start|>Selective association rule generation: Mining association rules is a popular and well researched method for discovering interesting relations between variables in large databases. A practical problem is that at medium to low support values often a large number of frequent itemsets and an even larger ... | arxiv | @article{hahsler2008selective,
title={Selective association rule generation},
author={Michael Hahsler, Christian Buchta, and Kurt Hornik},
journal={Computational Statistics, 2007. Online First, Published: 25 July
2007},
year={2008},
doi={10.1007/s00180-007-0062-z},
archivePrefix={arXiv},
e... | hahsler2008selective |
arxiv-2984 | 0803.0956 | Characterizing path graphs by forbidden induced subgraphs | <|reference_start|>Characterizing path graphs by forbidden induced subgraphs: A graph is a path graph if it is the intersection graph of a family of subpaths of a tree. In 1970, Renz asked for a characterizaton of path graphs by forbidden induced subgraphs. Here we answer this question by listing all graphs that are no... | arxiv | @article{lévêque2008characterizing,
title={Characterizing path graphs by forbidden induced subgraphs},
author={Benjamin L'ev^eque (LGS), Fr'ed'eric Maffray (LGS), Myriam
Preissmann (LGS)},
journal={arXiv preprint arXiv:0803.0956},
year={2008},
archivePrefix={arXiv},
eprint={0803.0956},
pri... | lévêque2008characterizing |
arxiv-2985 | 0803.0966 | New probabilistic interest measures for association rules | <|reference_start|>New probabilistic interest measures for association rules: Mining association rules is an important technique for discovering meaningful patterns in transaction databases. Many different measures of interestingness have been proposed for association rules. However, these measures fail to take the pro... | arxiv | @article{hahsler2008new,
title={New probabilistic interest measures for association rules},
author={Michael Hahsler and Kurt Hornik},
journal={Intelligent Data Analysis, 11(5):437-455, 2007},
year={2008},
doi={10.3233/IDA-2007-11502},
archivePrefix={arXiv},
eprint={0803.0966},
primaryCla... | hahsler2008new |
arxiv-2986 | 0803.0988 | Faster Approximate Lossy Generalized Flow via Interior Point Algorithms | <|reference_start|>Faster Approximate Lossy Generalized Flow via Interior Point Algorithms: We present faster approximation algorithms for generalized network flow problems. A generalized flow is one in which the flow out of an edge differs from the flow into the edge by a constant factor. We limit ourselves to the los... | arxiv | @article{daitch2008faster,
title={Faster Approximate Lossy Generalized Flow via Interior Point Algorithms},
author={Samuel I. Daitch, Daniel A. Spielman},
journal={arXiv preprint arXiv:0803.0988},
year={2008},
archivePrefix={arXiv},
eprint={0803.0988},
primaryClass={cs.DS cs.NA}
} | daitch2008faster |
arxiv-2987 | 0803.1025 | Asymptotic Concentration Behaviors of Linear Combinations of Weight Distributions on Random Linear Code Ensemble | <|reference_start|>Asymptotic Concentration Behaviors of Linear Combinations of Weight Distributions on Random Linear Code Ensemble: Asymptotic concentration behaviors of linear combinations of weight distributions on the random linear code ensemble are presented. Many important properties of a binary linear code can b... | arxiv | @article{wadayama2008asymptotic,
title={Asymptotic Concentration Behaviors of Linear Combinations of Weight
Distributions on Random Linear Code Ensemble},
author={Tadashi Wadayama},
journal={arXiv preprint arXiv:0803.1025},
year={2008},
archivePrefix={arXiv},
eprint={0803.1025},
primaryCla... | wadayama2008asymptotic |
arxiv-2988 | 0803.1030 | Robust Stochastic Chemical Reaction Networks and Bounded Tau-Leaping | <|reference_start|>Robust Stochastic Chemical Reaction Networks and Bounded Tau-Leaping: The behavior of some stochastic chemical reaction networks is largely unaffected by slight inaccuracies in reaction rates. We formalize the robustness of state probabilities to reaction rate deviations, and describe a formal connec... | arxiv | @article{soloveichik2008robust,
title={Robust Stochastic Chemical Reaction Networks and Bounded Tau-Leaping},
author={David Soloveichik},
journal={arXiv preprint arXiv:0803.1030},
year={2008},
archivePrefix={arXiv},
eprint={0803.1030},
primaryClass={cs.CC}
} | soloveichik2008robust |
arxiv-2989 | 0803.1087 | The Future of Scientific Simulations: from Artificial Life to Artificial Cosmogenesis | <|reference_start|>The Future of Scientific Simulations: from Artificial Life to Artificial Cosmogenesis: This philosophical paper explores the relation between modern scientific simulations and the future of the universe. We argue that a simulation of an entire universe will result from future scientific activity. Thi... | arxiv | @article{vidal2008the,
title={The Future of Scientific Simulations: from Artificial Life to Artificial
Cosmogenesis},
author={Clement Vidal},
journal={arXiv preprint arXiv:0803.1087},
year={2008},
archivePrefix={arXiv},
eprint={0803.1087},
primaryClass={cs.AI}
} | vidal2008the |
arxiv-2990 | 0803.1090 | Self-Corrected Min-Sum decoding of LDPC codes | <|reference_start|>Self-Corrected Min-Sum decoding of LDPC codes: In this paper we propose a very simple but powerful self-correction method for the Min-Sum decoding of LPDC codes. Unlike other correction methods known in the literature, our method does not try to correct the check node processing approximation, but it... | arxiv | @article{savin2008self-corrected,
title={Self-Corrected Min-Sum decoding of LDPC codes},
author={Valentin Savin},
journal={arXiv preprint arXiv:0803.1090},
year={2008},
archivePrefix={arXiv},
eprint={0803.1090},
primaryClass={cs.IT math.IT}
} | savin2008self-corrected |
arxiv-2991 | 0803.1094 | Min-Max decoding for non binary LDPC codes | <|reference_start|>Min-Max decoding for non binary LDPC codes: Iterative decoding of non-binary LDPC codes is currently performed using either the Sum-Product or the Min-Sum algorithms or slightly different versions of them. In this paper, several low-complexity quasi-optimal iterative algorithms are proposed for decod... | arxiv | @article{savin2008min-max,
title={Min-Max decoding for non binary LDPC codes},
author={Valentin Savin},
journal={arXiv preprint arXiv:0803.1094},
year={2008},
archivePrefix={arXiv},
eprint={0803.1094},
primaryClass={cs.IT math.IT}
} | savin2008min-max |
arxiv-2992 | 0803.1096 | Algebraic-geometric codes from vector bundles and their decoding | <|reference_start|>Algebraic-geometric codes from vector bundles and their decoding: Algebraic-geometric codes can be constructed by evaluating a certain set of functions on a set of distinct rational points of an algebraic curve. The set of functions that are evaluated is the linear space of a given divisor or, equiva... | arxiv | @article{savin2008algebraic-geometric,
title={Algebraic-geometric codes from vector bundles and their decoding},
author={Valentin Savin},
journal={arXiv preprint arXiv:0803.1096},
year={2008},
archivePrefix={arXiv},
eprint={0803.1096},
primaryClass={cs.IT math.IT}
} | savin2008algebraic-geometric |
arxiv-2993 | 0803.1104 | Optimizing Web Sites for Customer Retention | <|reference_start|>Optimizing Web Sites for Customer Retention: With customer relationship management (CRM) companies move away from a mainly product-centered view to a customer-centered view. Resulting from this change, the effective management of how to keep contact with customers throughout different channels is one... | arxiv | @article{hahsler2008optimizing,
title={Optimizing Web Sites for Customer Retention},
author={Michael Hahsler},
journal={arXiv preprint arXiv:0803.1104},
year={2008},
archivePrefix={arXiv},
eprint={0803.1104},
primaryClass={cs.HC}
} | hahsler2008optimizing |
arxiv-2994 | 0803.1110 | On the Computation of the Topology of a Non-Reduced Implicit Space Curve | <|reference_start|>On the Computation of the Topology of a Non-Reduced Implicit Space Curve: An algorithm is presented for the computation of the topology of a non-reduced space curve defined as the intersection of two implicit algebraic surfaces. It computes a Piecewise Linear Structure (PLS) isotopic to the original ... | arxiv | @article{diatta2008on,
title={On the Computation of the Topology of a Non-Reduced Implicit Space Curve},
author={Daouda Niang Diatta (XLIM), Bernard Mourrain (INRIA Sophia Antipolis),
Olivier Ruatta (XLIM)},
journal={arXiv preprint arXiv:0803.1110},
year={2008},
archivePrefix={arXiv},
eprint={... | diatta2008on |
arxiv-2995 | 0803.1111 | Hierarchical Grid-Based Pairwise Key Pre-distribution in Wireless Sensor Networks | <|reference_start|>Hierarchical Grid-Based Pairwise Key Pre-distribution in Wireless Sensor Networks: The security of wireless sensor networks is an active topic of research where both symmetric and asymmetric key cryptography issues have been studied. Due to their computational feasibility on typical sensor nodes, sym... | arxiv | @article{mohaisen2008hierarchical,
title={Hierarchical Grid-Based Pairwise Key Pre-distribution in Wireless Sensor
Networks},
author={Abedelaziz Mohaisen, DaeHun Nyang, KyungHee Lee},
journal={arXiv preprint arXiv:0803.1111},
year={2008},
archivePrefix={arXiv},
eprint={0803.1111},
primaryC... | mohaisen2008hierarchical |
arxiv-2996 | 0803.1120 | The Rate Loss of Single-Letter Characterization: The "Dirty" Multiple Access Channel | <|reference_start|>The Rate Loss of Single-Letter Characterization: The "Dirty" Multiple Access Channel: For general memoryless systems, the typical information theoretic solution - when exists - has a "single-letter" form. This reflects the fact that optimum performance can be approached by a random code (or a random ... | arxiv | @article{philosof2008the,
title={The Rate Loss of Single-Letter Characterization: The "Dirty" Multiple
Access Channel},
author={Tal Philosof and Ram Zamir},
journal={arXiv preprint arXiv:0803.1120},
year={2008},
archivePrefix={arXiv},
eprint={0803.1120},
primaryClass={cs.IT math.IT}
} | philosof2008the |
arxiv-2997 | 0803.1144 | Asymptotic Capacity and Optimal Precoding Strategy of Multi-Level Precode & Forward in Correlated Channels | <|reference_start|>Asymptotic Capacity and Optimal Precoding Strategy of Multi-Level Precode & Forward in Correlated Channels: We analyze a multi-level MIMO relaying system where a multiple-antenna transmitter sends data to a multipleantenna receiver through several relay levels, also equipped with multiple antennas. A... | arxiv | @article{fawaz2008asymptotic,
title={Asymptotic Capacity and Optimal Precoding Strategy of Multi-Level
Precode & Forward in Correlated Channels},
author={Nadia Fawaz, Keyvan Zarifi, Merouane Debbah, David Gesbert},
journal={arXiv preprint arXiv:0803.1144},
year={2008},
doi={10.1109/ITW.2008.457865... | fawaz2008asymptotic |
arxiv-2998 | 0803.1189 | Infinite words containing squares at every position | <|reference_start|>Infinite words containing squares at every position: Richomme asked the following question: what is the infimum of the real numbers $\alpha$ > 2 such that there exists an infinite word that avoids $\alpha$-powers but contains arbitrarily large squares beginning at every position? We resolve this ques... | arxiv | @article{currie2008infinite,
title={Infinite words containing squares at every position},
author={James D. Currie, Narad Rampersad},
journal={arXiv preprint arXiv:0803.1189},
year={2008},
archivePrefix={arXiv},
eprint={0803.1189},
primaryClass={math.CO cs.FL}
} | currie2008infinite |
arxiv-2999 | 0803.1195 | Secure Lossless Compression with Side Information | <|reference_start|>Secure Lossless Compression with Side Information: Secure data compression in the presence of side information at both a legitimate receiver and an eavesdropper is explored. A noise-free, limited rate link between the source and the receiver, whose output can be perfectly observed by the eavesdropper... | arxiv | @article{gunduz2008secure,
title={Secure Lossless Compression with Side Information},
author={Deniz Gunduz, Elza Erkip, H. Vincent Poor},
journal={arXiv preprint arXiv:0803.1195},
year={2008},
doi={10.1109/ITW.2008.4578644},
archivePrefix={arXiv},
eprint={0803.1195},
primaryClass={cs.IT ... | gunduz2008secure |
arxiv-3000 | 0803.1207 | Serious Flaws in Korf et al's Analysis on Time Complexity of A* | <|reference_start|>Serious Flaws in Korf et al's Analysis on Time Complexity of A*: This paper has been withdrawn.<|reference_end|> | arxiv | @article{dinh2008serious,
title={Serious Flaws in Korf et al.'s Analysis on Time Complexity of A*},
author={Hang Dinh},
journal={arXiv preprint arXiv:0803.1207},
year={2008},
archivePrefix={arXiv},
eprint={0803.1207},
primaryClass={cs.AI}
} | dinh2008serious |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.