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-2201 | 0712.4015 | A Fast Hierarchical Multilevel Image Segmentation Method using Unbiased Estimators | <|reference_start|>A Fast Hierarchical Multilevel Image Segmentation Method using Unbiased Estimators: This paper proposes a novel method for segmentation of images by hierarchical multilevel thresholding. The method is global, agglomerative in nature and disregards pixel locations. It involves the optimization of the ... | arxiv | @article{goparaju2007a,
title={A Fast Hierarchical Multilevel Image Segmentation Method using Unbiased
Estimators},
author={Sreechakra Goparaju, Jayadev Acharya, Ajoy K. Ray, Jaideva C. Goswami},
journal={arXiv preprint arXiv:0712.4015},
year={2007},
archivePrefix={arXiv},
eprint={0712.4015},
... | goparaju2007a |
arxiv-2202 | 0712.4027 | Accurate and Efficient Expression Evaluation and Linear Algebra | <|reference_start|>Accurate and Efficient Expression Evaluation and Linear Algebra: We survey and unify recent results on the existence of accurate algorithms for evaluating multivariate polynomials, and more generally for accurate numerical linear algebra with structured matrices. By "accurate" we mean that the comput... | arxiv | @article{demmel2007accurate,
title={Accurate and Efficient Expression Evaluation and Linear Algebra},
author={James Demmel, Ioana Dumitriu, Olga Holtz, Plamen Koev},
journal={Acta Numerica, Volume 17, May 2008, pp 87-145},
year={2007},
doi={10.1017/S0962492906350015},
archivePrefix={arXiv},
... | demmel2007accurate |
arxiv-2203 | 0712.4046 | Faster polynomial multiplication via multipoint Kronecker substitution | <|reference_start|>Faster polynomial multiplication via multipoint Kronecker substitution: We give several new algorithms for dense polynomial multiplication based on the Kronecker substitution method. For moderately sized input polynomials, the new algorithms improve on the performance of the standard Kronecker substi... | arxiv | @article{harvey2007faster,
title={Faster polynomial multiplication via multipoint Kronecker substitution},
author={David Harvey},
journal={arXiv preprint arXiv:0712.4046},
year={2007},
archivePrefix={arXiv},
eprint={0712.4046},
primaryClass={cs.SC cs.DS}
} | harvey2007faster |
arxiv-2204 | 0712.4057 | On Compression of Cryptographic Keys | <|reference_start|>On Compression of Cryptographic Keys: Any secured system can be modeled as a capability-based access control system in which each user is given a set of secret keys of the resources he is granted access to. In some large systems with resource-constrained devices, such as sensor networks and RFID syst... | arxiv | @article{chan2007on,
title={On Compression of Cryptographic Keys},
author={Aldar C-F. Chan},
journal={Theoretical Computer Science, 2013},
year={2007},
doi={10.1016/j.tcs.2013.04.010},
archivePrefix={arXiv},
eprint={0712.4057},
primaryClass={cs.CR cs.NI}
} | chan2007on |
arxiv-2205 | 0712.4059 | On Distributed Computation in Noisy Random Planar Networks | <|reference_start|>On Distributed Computation in Noisy Random Planar Networks: We consider distributed computation of functions of distributed data in random planar networks with noisy wireless links. We present a new algorithm for computation of the maximum value which is order optimal in the number of transmissions a... | arxiv | @article{kanoria2007on,
title={On Distributed Computation in Noisy Random Planar Networks},
author={Y. Kanoria, D. Manjunath},
journal={Proceedings of IEEE International Symposium on Information Theory,
2007},
year={2007},
doi={10.1109/ISIT.2007.4557101},
archivePrefix={arXiv},
eprint={071... | kanoria2007on |
arxiv-2206 | 0712.4075 | Polytope Representations for Linear-Programming Decoding of Non-Binary Linear Codes | <|reference_start|>Polytope Representations for Linear-Programming Decoding of Non-Binary Linear Codes: In previous work, we demonstrated how decoding of a non-binary linear code could be formulated as a linear-programming problem. In this paper, we study different polytopes for use with linear-programming decoding, an... | arxiv | @article{skachek2007polytope,
title={Polytope Representations for Linear-Programming Decoding of Non-Binary
Linear Codes},
author={Vitaly Skachek, Mark F. Flanagan, Eimear Byrne, Marcus Greferath},
journal={arXiv preprint arXiv:0712.4075},
year={2007},
doi={10.1109/ISIT.2008.4595239},
archiveP... | skachek2007polytope |
arxiv-2207 | 0712.4096 | Error-Correction of Multidimensional Bursts | <|reference_start|>Error-Correction of Multidimensional Bursts: In this paper we present several constructions to generate codes for correcting a multidimensional cluster-error. The goal is to correct a cluster-error whose shape can be a box-error, a Lee sphere error, or an error with an arbitrary shape. Our codes have... | arxiv | @article{etzion2007error-correction,
title={Error-Correction of Multidimensional Bursts},
author={Tuvi Etzion, and Eitan Yaakobi},
journal={arXiv preprint arXiv:0712.4096},
year={2007},
archivePrefix={arXiv},
eprint={0712.4096},
primaryClass={cs.IT math.IT}
} | etzion2007error-correction |
arxiv-2208 | 0712.4099 | Digital Ecosystems: Optimisation by a Distributed Intelligence | <|reference_start|>Digital Ecosystems: Optimisation by a Distributed Intelligence: Can intelligence optimise Digital Ecosystems? How could a distributed intelligence interact with the ecosystem dynamics? Can the software components that are part of genetic selection be intelligent in themselves, as in an adaptive techn... | arxiv | @article{briscoe2007digital,
title={Digital Ecosystems: Optimisation by a Distributed Intelligence},
author={G. Briscoe, P. De Wilde},
journal={arXiv preprint arXiv:0712.4099},
year={2007},
archivePrefix={arXiv},
eprint={0712.4099},
primaryClass={cs.NE}
} | briscoe2007digital |
arxiv-2209 | 0712.4101 | Digital Ecosystems: Stability of Evolving Agent Populations | <|reference_start|>Digital Ecosystems: Stability of Evolving Agent Populations: Stability is perhaps one of the most desirable features of any engineered system, given the importance of being able to predict its response to various environmental conditions prior to actual deployment. Engineered systems are becoming eve... | arxiv | @article{de wilde2007digital,
title={Digital Ecosystems: Stability of Evolving Agent Populations},
author={P. De Wilde, G. Briscoe},
journal={arXiv preprint arXiv:0712.4101},
year={2007},
archivePrefix={arXiv},
eprint={0712.4101},
primaryClass={cs.NE}
} | de wilde2007digital |
arxiv-2210 | 0712.4102 | Digital Ecosystems: Evolving Service-Oriented Architectures | <|reference_start|>Digital Ecosystems: Evolving Service-Oriented Architectures: We view Digital Ecosystems to be the digital counterparts of biological ecosystems, exploiting the self-organising properties of biological ecosystems, which are considered to be robust, self-organising and scalable architectures that can a... | arxiv | @article{briscoe2007digital,
title={Digital Ecosystems: Evolving Service-Oriented Architectures},
author={G. Briscoe, P. De Wilde},
journal={In IEEE First International Conference on Bio Inspired mOdels of
NETwork, Information and Computing Systems (BIONETICS) (2006)},
year={2007},
archivePrefix={... | briscoe2007digital |
arxiv-2211 | 0712.4103 | On the Monotonicity of the Generalized Marcum and Nuttall Q-Functions | <|reference_start|>On the Monotonicity of the Generalized Marcum and Nuttall Q-Functions: Monotonicity criteria are established for the generalized Marcum Q-function, $\emph{Q}_{M}$, the standard Nuttall Q-function, $\emph{Q}_{M,N}$, and the normalized Nuttall Q-function, $\mathcal{Q}_{M,N}$, with respect to their real... | arxiv | @article{kapinas2007on,
title={On the Monotonicity of the Generalized Marcum and Nuttall Q-Functions},
author={Vasilios M. Kapinas, Sotirios K. Mihos and George K. Karagiannidis},
journal={IEEE Trans. Inf. Theory, vol. 55, no. 8, pp. 3701-3710, Aug. 2009},
year={2007},
doi={10.1109/TIT.2009.2023710}... | kapinas2007on |
arxiv-2212 | 0712.4115 | A Class of Quantum LDPC Codes Constructed From Finite Geometries | <|reference_start|>A Class of Quantum LDPC Codes Constructed From Finite Geometries: Low-density parity check (LDPC) codes are a significant class of classical codes with many applications. Several good LDPC codes have been constructed using random, algebraic, and finite geometries approaches, with containing cycles of... | arxiv | @article{aly2007a,
title={A Class of Quantum LDPC Codes Constructed From Finite Geometries},
author={Salah A. Aly},
journal={Proc. of IEEE Globecom 08, New Orleans, LA 2008},
year={2007},
doi={10.1109/GLOCOM.2008.ECP.217},
archivePrefix={arXiv},
eprint={0712.4115},
primaryClass={quant-ph... | aly2007a |
arxiv-2213 | 0712.4124 | Introduction to the Galois Theory of Linear Differential Equations | <|reference_start|>Introduction to the Galois Theory of Linear Differential Equations: This is an expanded version of the 10 lectures given as the 2006 London Mathematical Society Invited Lecture Series at the Heriot-Watt University 31 July - 4 August 2006.<|reference_end|> | arxiv | @article{singer2007introduction,
title={Introduction to the Galois Theory of Linear Differential Equations},
author={Michael F. Singer},
journal={arXiv preprint arXiv:0712.4124},
year={2007},
archivePrefix={arXiv},
eprint={0712.4124},
primaryClass={math.CA cs.SC}
} | singer2007introduction |
arxiv-2214 | 0712.4126 | TRUST-TECH based Methods for Optimization and Learning | <|reference_start|>TRUST-TECH based Methods for Optimization and Learning: Many problems that arise in machine learning domain deal with nonlinearity and quite often demand users to obtain global optimal solutions rather than local optimal ones. Optimization problems are inherent in machine learning algorithms and henc... | arxiv | @article{reddy2007trust-tech,
title={TRUST-TECH based Methods for Optimization and Learning},
author={Chandan K. Reddy},
journal={Chandan K. Reddy, TRUST-TECH based Methods for Optimization and
Learning, PHD Thesis, Cornell University, February 2007},
year={2007},
archivePrefix={arXiv},
eprint... | reddy2007trust-tech |
arxiv-2215 | 0712.4135 | On the Throughput of Secure Hybrid-ARQ Protocols for Gaussian Block-Fading Channels | <|reference_start|>On the Throughput of Secure Hybrid-ARQ Protocols for Gaussian Block-Fading Channels: The focus of this paper is an information-theoretic study of retransmission protocols for reliable packet communication under a secrecy constraint. The hybrid automatic retransmission request (HARQ) protocol is revis... | arxiv | @article{tang2007on,
title={On the Throughput of Secure Hybrid-ARQ Protocols for Gaussian
Block-Fading Channels},
author={Xiaojun Tang, Ruoheng Liu, Predrag Spasojevic, H. Vincent Poor},
journal={arXiv preprint arXiv:0712.4135},
year={2007},
doi={10.1109/TIT.2009.2013043},
archivePrefix={arXiv... | tang2007on |
arxiv-2216 | 0712.4148 | Lower bounds for the greatest possible number of colors in interval edge colorings of bipartite cylinders and bipartite tori | <|reference_start|>Lower bounds for the greatest possible number of colors in interval edge colorings of bipartite cylinders and bipartite tori: An interval edge t-coloring of a graph G is a proper edge coloring of G with colors 1,2...,t such that at least one edge of G is colored by color i,i=1,2...,t, and the edges i... | arxiv | @article{petrosyan2007lower,
title={Lower bounds for the greatest possible number of colors in interval edge
colorings of bipartite cylinders and bipartite tori},
author={Petros A. Petrosyan and Gagik H. Karapetyan},
journal={Proceedings of the CSIT Conference, Yerevan, 2007, 86-88},
year={2007},
... | petrosyan2007lower |
arxiv-2217 | 0712.4153 | Biology of Applied Digital Ecosystems | <|reference_start|>Biology of Applied Digital Ecosystems: 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 complex, dynamic problems. Howe... | arxiv | @article{briscoe2007biology,
title={Biology of Applied Digital Ecosystems},
author={G. Briscoe, S. Sadedin, G. Paperin},
journal={In IEEE First International Conference on Digital Ecosystems and
Technologies, 2007},
year={2007},
doi={10.1109/DEST.2007.372015},
archivePrefix={arXiv},
eprint... | briscoe2007biology |
arxiv-2218 | 0712.4159 | Creating a Digital Ecosystem: Service-Oriented Architectures with Distributed Evolutionary Computing | <|reference_start|>Creating a Digital Ecosystem: Service-Oriented Architectures with Distributed Evolutionary Computing: We start with a discussion of the relevant literature, including Nature Inspired Computing as a framework in which to understand this work, and the process of biomimicry to be used in mimicking the n... | arxiv | @article{briscoe2007creating,
title={Creating a Digital Ecosystem: Service-Oriented Architectures with
Distributed Evolutionary Computing},
author={G Briscoe},
journal={In JavaOne Conference, 2006, BOF-0759},
year={2007},
archivePrefix={arXiv},
eprint={0712.4159},
primaryClass={cs.NE}
} | briscoe2007creating |
arxiv-2219 | 0712.4168 | A Framework for Providing E-Services to the Rural Areas using Wireless Ad Hoc and Sensor Networks | <|reference_start|>A Framework for Providing E-Services to the Rural Areas using Wireless Ad Hoc and Sensor Networks: In recent years, the proliferation of mobile computing devices has driven a revolutionary change in the computing world. The nature of ubiquitous devices makes wireless networks the easiest solution for... | arxiv | @article{pathan2007a,
title={A Framework for Providing E-Services to the Rural Areas using Wireless
Ad Hoc and Sensor Networks},
author={Al-Sakib Khan Pathan, Humayun Kadir Islam, Sabit Anjum Sayeed, Farruk
Ahmed, Choong Seon Hong},
journal={Proceedings of IEEE ICNEWS 2006, January 2-4, Dhaka, Banglades... | pathan2007a |
arxiv-2220 | 0712.4169 | Security in Wireless Sensor Networks: Issues and Challenges | <|reference_start|>Security in Wireless Sensor Networks: Issues and Challenges: Wireless Sensor Network (WSN) is an emerging technology that shows great promise for various futuristic applications both for mass public and military. The sensing technology combined with processing power and wireless communication makes i... | arxiv | @article{pathan2007security,
title={Security in Wireless Sensor Networks: Issues and Challenges},
author={Al-Sakib Khan Pathan, Hyung-Woo Lee, Choong Seon Hong},
journal={Proceedings of 8th IEEE ICACT 2006, Volume II, February 20-22,
Phoenix Park, Korea, 2006, pp. 1043-1048},
year={2007},
doi={10.... | pathan2007security |
arxiv-2221 | 0712.4170 | Smartening the Environment using Wireless Sensor Networks in a Developing Country | <|reference_start|>Smartening the Environment using Wireless Sensor Networks in a Developing Country: The miniaturization process of various sensing devices has become a reality by enormous research and advancements accomplished in Micro Electro-Mechanical Systems (MEMS) and Very Large Scale Integration (VLSI) lithogra... | arxiv | @article{pathan2007smartening,
title={Smartening the Environment using Wireless Sensor Networks in a
Developing Country},
author={Al-Sakib Khan Pathan, Choong Seon Hong, Hyung-Woo Lee},
journal={Proceedings of 8th IEEE ICACT 2006, Volume I, February 20-22,
Phoenix Park, Korea, 2006, pp. 705-709},
ye... | pathan2007smartening |
arxiv-2222 | 0712.4172 | Developing an Efficient DMCIS with Next-Generation Wireless Networks | <|reference_start|>Developing an Efficient DMCIS with Next-Generation Wireless Networks: The impact of extreme events across the globe is extraordinary which continues to handicap the advancement of the struggling developing societies and threatens most of the industrialized countries in the globe. Various fields of In... | arxiv | @article{pathan2007developing,
title={Developing an Efficient DMCIS with Next-Generation Wireless Networks},
author={Al-Sakib Khan Pathan, Choong Seon Hong},
journal={IEEE Military Communications Conference (IEEE MILCOM 2006),
October 23-25, Washington, DC, USA},
year={2007},
doi={10.1109/MILCOM.2... | pathan2007developing |
arxiv-2223 | 0712.4173 | Secure Clustering in DSN with Key Predistribution and WCDS | <|reference_start|>Secure Clustering in DSN with Key Predistribution and WCDS: This paper proposes an efficient approach of secure clustering in distributed sensor networks. The clusters or groups in the network are formed based on offline rank assignment and predistribution of secret keys. Our approach uses the concep... | arxiv | @article{pathan2007secure,
title={Secure Clustering in DSN with Key Predistribution and WCDS},
author={Al-Sakib Khan Pathan, Choong Seon Hong},
journal={IEEE Military Communications Conference (IEEE MILCOM 2006),
October 23-25, Washington, DC, USA},
year={2007},
doi={10.1109/MILCOM.2006.302183},
... | pathan2007secure |
arxiv-2224 | 0712.4174 | A Novel and Efficient Bilateral Remote User Authentication Scheme Using Smart Cards | <|reference_start|>A Novel and Efficient Bilateral Remote User Authentication Scheme Using Smart Cards: This paper proposes a novel remote user authentication scheme using smart cards which allows both the authentication server (AS) and the user to verify authenticity of each other. Our scheme is efficient enough to re... | arxiv | @article{pathan2007a,
title={A Novel and Efficient Bilateral Remote User Authentication Scheme Using
Smart Cards},
author={Al-Sakib Khan Pathan, Choong Seon Hong, Tatsuya Suda},
journal={Proceedings of the 2007 IEEE International Conference on Consumer
Electronics (IEEE ICCE 2007), January 10-14, Las Ve... | pathan2007a |
arxiv-2225 | 0712.4176 | An Improved Timestamp-Based Password Authentication Scheme Using Smart Cards | <|reference_start|>An Improved Timestamp-Based Password Authentication Scheme Using Smart Cards: With the recent proliferation of distributed systems and networking, remote authentication has become a crucial task in many networking applications. Various schemes have been proposed so far for the two-party remote authen... | arxiv | @article{pathan2007an,
title={An Improved Timestamp-Based Password Authentication Scheme Using Smart
Cards},
author={Al-Sakib Khan Pathan, Choong Seon Hong},
journal={Proceedings of the 9th IEEE ICACT 2007, Volume I, February 12-14,
2007, Phoenix Park, Korea, pp. 804-809},
year={2007},
doi={10.1... | pathan2007an |
arxiv-2226 | 0712.4177 | A Secure Lightweight Approach of Node Membership Verification in Dense HDSN | <|reference_start|>A Secure Lightweight Approach of Node Membership Verification in Dense HDSN: In this paper, we consider a particular type of deployment scenario of a distributed sensor network (DSN), where sensors of different types and categories are densely deployed in the same target area. In this network, the se... | arxiv | @article{pathan2007a,
title={A Secure Lightweight Approach of Node Membership Verification in Dense
HDSN},
author={Al-Sakib Khan Pathan, Gihyuk Heo, Choong Seon Hong},
journal={IEEE Military Communications Conference (IEEE MILCOM 2007),
October 29-31, Orlando, Florida, USA},
year={2007},
doi={10... | pathan2007a |
arxiv-2227 | 0712.4178 | An Efficient PKC-Based Security Architecture for Wireless Sensor Networks | <|reference_start|>An Efficient PKC-Based Security Architecture for Wireless Sensor Networks: In spite of previous widely held belief of the incompatibility of public key cryptography (PKC) schemes for wireless sensor networks (WSNs), some recent works have shown that, PKC based schemes could be implemented for such ne... | arxiv | @article{haque2007an,
title={An Efficient PKC-Based Security Architecture for Wireless Sensor
Networks},
author={Md. Mokammel Haque, Al-Sakib Khan Pathan, Byung Goo Choi, Choong Seon
Hong},
journal={IEEE Military Communications Conference (IEEE MILCOM 2007),
October 29-31, Orlando, Florida, USA},
... | haque2007an |
arxiv-2228 | 0712.4183 | Probabilistic Visual Secret Sharing Schemes for Gray-scale images and Color images | <|reference_start|>Probabilistic Visual Secret Sharing Schemes for Gray-scale images and Color images: Visual secrete sharing (VSS) is an encryption technique that utilizes human visual system in the recovering of the secret image and it does not require any complex calculation. Pixel expansion has been a major issue o... | arxiv | @article{wang2007probabilistic,
title={Probabilistic Visual Secret Sharing Schemes for Gray-scale images and
Color images},
author={Dao-Shun Wang, Feng Yi and Xiaobo Li},
journal={arXiv preprint arXiv:0712.4183},
year={2007},
archivePrefix={arXiv},
eprint={0712.4183},
primaryClass={cs.CR c... | wang2007probabilistic |
arxiv-2229 | 0712.4209 | The Generalized Random Energy Model and its Application to the Statistical Physics of Ensembles of Hierarchical Codes | <|reference_start|>The Generalized Random Energy Model and its Application to the Statistical Physics of Ensembles of Hierarchical Codes: In an earlier work, the statistical physics associated with finite--temperature decoding of code ensembles, along with the relation to their random coding error exponents, were explo... | arxiv | @article{merhav2007the,
title={The Generalized Random Energy Model and its Application to the
Statistical Physics of Ensembles of Hierarchical Codes},
author={Neri Merhav},
journal={arXiv preprint arXiv:0712.4209},
year={2007},
doi={10.1109/TIT.2008.2011445},
archivePrefix={arXiv},
eprint=... | merhav2007the |
arxiv-2230 | 0712.4213 | Exact Quantum Algorithms for the Leader Election Problem | <|reference_start|>Exact Quantum Algorithms for the Leader Election Problem: This paper gives the first separation of quantum and classical pure (i.e., non-cryptographic) computing abilities with no restriction on the amount of available computing resources, by considering the exact solvability of a celebrated unsolvab... | arxiv | @article{tani2007exact,
title={Exact Quantum Algorithms for the Leader Election Problem},
author={Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumoto},
journal={ACM TOCT 4 (2012): Article 1; IEEE TPDS 23 (2012): 255 - 262},
year={2007},
archivePrefix={arXiv},
eprint={0712.4213},
primaryClass... | tani2007exact |
arxiv-2231 | 0712.4215 | Cyberspace security: How to develop a security strategy | <|reference_start|>Cyberspace security: How to develop a security strategy: Despite all visible dividers, the Internet is getting us closer and closer, but with a great price. Our security is the price. The international community is fully aware of the urgent need to secure the cyberspace as you see the multiplication ... | arxiv | @article{raggad2007cyberspace,
title={Cyberspace security: How to develop a security strategy},
author={Bel G. Raggad (PU - Seidenberg School of CS & IS), Sahbi Sidhom
(LORIA)},
journal={Dans V. International conference Cyberspace 2007 (2007)},
year={2007},
archivePrefix={arXiv},
eprint={0712.... | raggad2007cyberspace |
arxiv-2232 | 0712.4222 | Weak Affine Light Typing: Polytime intensional expressivity, soundness and completeness | <|reference_start|>Weak Affine Light Typing: Polytime intensional expressivity, soundness and completeness: Weak affine light typing (WALT) assigns light affine linear formulae as types to a subset of lambda-terms in System F. WALT is poly-time sound: if a lambda-term M has type in WALT, M can be evaluated with a polyn... | arxiv | @article{roversi2007weak,
title={Weak Affine Light Typing: Polytime intensional expressivity, soundness
and completeness},
author={Luca Roversi},
journal={arXiv preprint arXiv:0712.4222},
year={2007},
archivePrefix={arXiv},
eprint={0712.4222},
primaryClass={cs.LO}
} | roversi2007weak |
arxiv-2233 | 0712.4248 | Computer algebra in systems biology | <|reference_start|>Computer algebra in systems biology: Systems biology focuses on the study of entire biological systems rather than on their individual components. With the emergence of high-throughput data generation technologies for molecular biology and the development of advanced mathematical modeling techniques,... | arxiv | @article{laubenbacher2007computer,
title={Computer algebra in systems biology},
author={Reinhard Laubenbacher and Bernd Sturmfels},
journal={arXiv preprint arXiv:0712.4248},
year={2007},
archivePrefix={arXiv},
eprint={0712.4248},
primaryClass={cs.SC q-bio.MN q-bio.QM}
} | laubenbacher2007computer |
arxiv-2234 | 0712.4273 | Online EM Algorithm for Latent Data Models | <|reference_start|>Online EM Algorithm for Latent Data Models: In this contribution, we propose a generic online (also sometimes called adaptive or recursive) version of the Expectation-Maximisation (EM) algorithm applicable to latent variable models of independent observations. Compared to the algorithm of Titteringto... | arxiv | @article{cappé2007online,
title={Online EM Algorithm for Latent Data Models},
author={Olivier Capp'e (LTCI), Eric Moulines (LTCI)},
journal={Journal of the Royal Statistical Society: Series B, Royal
Statistical Society, 2009, 71 (3), pp.593-613},
year={2007},
doi={10.1111/j.1467-9868.2009.00698.x}... | cappé2007online |
arxiv-2235 | 0712.4279 | Disjointness is hard in the multi-party number on the forehead model | <|reference_start|>Disjointness is hard in the multi-party number on the forehead model: We show that disjointness requires randomized communication Omega(n^{1/(k+1)}/2^{2^k}) in the general k-party number-on-the-forehead model of complexity. The previous best lower bound for k >= 3 was log(n)/(k-1). Our results give a... | arxiv | @article{lee2007disjointness,
title={Disjointness is hard in the multi-party number on the forehead model},
author={Troy Lee, Adi Shraibman},
journal={arXiv preprint arXiv:0712.4279},
year={2007},
archivePrefix={arXiv},
eprint={0712.4279},
primaryClass={cs.CC}
} | lee2007disjointness |
arxiv-2236 | 0712.4318 | Convergence of Expected Utilities with Algorithmic Probability Distributions | <|reference_start|>Convergence of Expected Utilities with Algorithmic Probability Distributions: We consider an agent interacting with an unknown environment. The environment is a function which maps natural numbers to natural numbers; the agent's set of hypotheses about the environment contains all such functions whic... | arxiv | @article{de blanc2007convergence,
title={Convergence of Expected Utilities with Algorithmic Probability
Distributions},
author={Peter de Blanc},
journal={arXiv preprint arXiv:0712.4318},
year={2007},
archivePrefix={arXiv},
eprint={0712.4318},
primaryClass={cs.AI}
} | de blanc2007convergence |
arxiv-2237 | 0712.4321 | Subsystem Code Constructions | <|reference_start|>Subsystem Code Constructions: Subsystem codes are the most versatile class of quantum error-correcting codes known to date that combine the best features of all known passive and active error-control schemes. The subsystem code is a subspace of the quantum state space that is decomposed into a tensor... | arxiv | @article{aly2007subsystem,
title={Subsystem Code Constructions},
author={Salah A. Aly and Andreas Klappenecker},
journal={Proc. of IEEE ISIT 08, Toronto, CA, 2008},
year={2007},
archivePrefix={arXiv},
eprint={0712.4321},
primaryClass={quant-ph cs.IT math.IT}
} | aly2007subsystem |
arxiv-2238 | 0712.4341 | Finite Automata Based on Quantum Logic and Their Determinization | <|reference_start|>Finite Automata Based on Quantum Logic and Their Determinization: We give the quantum subset construction of orthomodular lattice-valued finite automata, then we show the equivalence between orthomodular lattice-valued finite automata, orthomodular lattice-valued deterministic finite automata and ort... | arxiv | @article{li2007finite,
title={Finite Automata Based on Quantum Logic and Their Determinization},
author={Yongming Li},
journal={arXiv preprint arXiv:0712.4341},
year={2007},
archivePrefix={arXiv},
eprint={0712.4341},
primaryClass={cs.LO}
} | li2007finite |
arxiv-2239 | 0712.4402 | Judgment | <|reference_start|>Judgment: The concept of a judgment as a logical action which introduces new information into a deductive system is examined. This leads to a way of mathematically representing implication which is distinct from the familiar material implication, according to which "If A then B" is considered to be e... | arxiv | @article{o'flanagan2007judgment,
title={Judgment},
author={Ruadhan O'Flanagan},
journal={arXiv preprint arXiv:0712.4402},
year={2007},
archivePrefix={arXiv},
eprint={0712.4402},
primaryClass={math.PR cs.AI math.LO}
} | o'flanagan2007judgment |
arxiv-2240 | 0801.0061 | Security for Wiretap Networks via Rank-Metric Codes | <|reference_start|>Security for Wiretap Networks via Rank-Metric Codes: The problem of securing a network coding communication system against a wiretapper adversary is considered. The network implements linear network coding to deliver $n$ packets from source to each receiver, and the wiretapper can eavesdrop on $\mu$ ... | arxiv | @article{silva2007security,
title={Security for Wiretap Networks via Rank-Metric Codes},
author={Danilo Silva, Frank R. Kschischang},
journal={arXiv preprint arXiv:0801.0061},
year={2007},
doi={10.1109/ISIT.2008.4594971},
archivePrefix={arXiv},
eprint={0801.0061},
primaryClass={cs.IT cs.... | silva2007security |
arxiv-2241 | 0801.0092 | Nash bargaining with a nondeterministic threat | <|reference_start|>Nash bargaining with a nondeterministic threat: We consider bargaining problems which involve two participants, with a nonempty closed, bounded convex bargaining set of points in the real plane representing all realizable bargains. We also assume that there is no definite threat or disagreement point... | arxiv | @article{soileau2007nash,
title={Nash bargaining with a nondeterministic threat},
author={Kerry Michael Soileau},
journal={arXiv preprint arXiv:0801.0092},
year={2007},
archivePrefix={arXiv},
eprint={0801.0092},
primaryClass={cs.GT}
} | soileau2007nash |
arxiv-2242 | 0801.0102 | Reserved-Length Prefix Coding | <|reference_start|>Reserved-Length Prefix Coding: Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all codewords have lengths that lie in a user-specified set of lengths (or, equivalently, no code... | arxiv | @article{baer2007reserved-length,
title={Reserved-Length Prefix Coding},
author={Michael B. Baer},
journal={arXiv preprint arXiv:0801.0102},
year={2007},
archivePrefix={arXiv},
eprint={0801.0102},
primaryClass={cs.IT cs.DS math.IT}
} | baer2007reserved-length |
arxiv-2243 | 0801.0131 | Two-Level Concept-Oriented Data Model | <|reference_start|>Two-Level Concept-Oriented Data Model: In this paper we describe a new approach to data modelling called the concept-oriented model (CoM). This model is based on the formalism of nested ordered sets which uses inclusion relation to produce hierarchical structure of sets and ordering relation to produ... | arxiv | @article{savinov2007two-level,
title={Two-Level Concept-Oriented Data Model},
author={Alexandr Savinov},
journal={Institute of Mathematics and Computer Science, Academy of Sciences
of Moldova, Technical Report RT0006, 2007},
year={2007},
number={Technical Report RT0006},
archivePrefix={arXiv},... | savinov2007two-level |
arxiv-2244 | 0801.0133 | An Approach to Programming Based on Concepts | <|reference_start|>An Approach to Programming Based on Concepts: In this paper we describe a new approach to programming which generalizes object-oriented programming. It is based on using a new programming construct, called concept, which generalizes classes. Concept is defined as a pair of two classes: one reference ... | arxiv | @article{savinov2007an,
title={An Approach to Programming Based on Concepts},
author={Alexandr Savinov},
journal={Institute of Mathematics and Computer Science, Academy of Sciences
of Moldova, Technical Report RT0005, 2007},
year={2007},
number={Technical Report RT0005},
archivePrefix={arXiv},... | savinov2007an |
arxiv-2245 | 0801.0135 | Concepts and their Use for Modelling Objects and References in Programming Languages | <|reference_start|>Concepts and their Use for Modelling Objects and References in Programming Languages: In the paper a new programming construct, called concept, is introduced. Concept is pair of two classes: a reference class and an object class. Instances of the reference classes are passed-by-value and are intended... | arxiv | @article{savinov2007concepts,
title={Concepts and their Use for Modelling Objects and References in
Programming Languages},
author={Alexandr Savinov},
journal={Institute of Mathematics and Computer Science, Academy of Sciences
of Moldova, Technical Report RT0004, 2007},
year={2007},
number={Tech... | savinov2007concepts |
arxiv-2246 | 0801.0136 | Indirect Object Representation and Access by Means of Concepts | <|reference_start|>Indirect Object Representation and Access by Means of Concepts: The paper describes a mechanism for indirect object representation and access (ORA) in programming languages. The mechanism is based on using a new programming construct which is referred to as concept. Concept consists of one object cla... | arxiv | @article{savinov2007indirect,
title={Indirect Object Representation and Access by Means of Concepts},
author={Alexandr Savinov},
journal={Institute of Mathematics and Computer Science, Academy of Sciences
of Moldova, Technical Report, 2006},
year={2007},
archivePrefix={arXiv},
eprint={0801.013... | savinov2007indirect |
arxiv-2247 | 0801.0139 | Principles of the Concept-Oriented Data Model | <|reference_start|>Principles of the Concept-Oriented Data Model: In the paper a new approach to data representation and manipulation is described, which is called the concept-oriented data model (CODM). It is supposed that items represent data units, which are stored in concepts. A concept is a combination of supercon... | arxiv | @article{savinov2007principles,
title={Principles of the Concept-Oriented Data Model},
author={Alexandr Savinov},
journal={Institute of Mathematics and Computer Science, Academy of Sciences
of Moldova, Technical Report, 2004},
year={2007},
archivePrefix={arXiv},
eprint={0801.0139},
primary... | savinov2007principles |
arxiv-2248 | 0801.0159 | Interval Edge Colorings of Mobius Ladders | <|reference_start|>Interval Edge Colorings of Mobius Ladders: An interval edge t-coloring of a graph G is a proper edge coloring of G with colors 1,2...,t such that at least one edge of G is colored by color i,i=1,2...,t, and the edges incident with each vertex x are colored by d_{G}(x) consecutive colors, where d_{G}(... | arxiv | @article{petrosyan2007interval,
title={Interval Edge Colorings of Mobius Ladders},
author={P.A. Petrosyan},
journal={Proceedings of the CSIT Conference, Yerevan, 2005, 146-149},
year={2007},
archivePrefix={arXiv},
eprint={0801.0159},
primaryClass={cs.DM}
} | petrosyan2007interval |
arxiv-2249 | 0801.0184 | The Existence of Strongly-MDS Convolutional Codes | <|reference_start|>The Existence of Strongly-MDS Convolutional Codes: It is known that maximum distance separable and maximum distance profile convolutional codes exist over large enough finite fields of any characteristic for all parameters $(n,k,\delta)$. It has been conjectured that the same is true for convolutiona... | arxiv | @article{hutchinson2007the,
title={The Existence of Strongly-MDS Convolutional Codes},
author={Ryan Hutchinson},
journal={arXiv preprint arXiv:0801.0184},
year={2007},
archivePrefix={arXiv},
eprint={0801.0184},
primaryClass={math.OC cs.IT math.IT}
} | hutchinson2007the |
arxiv-2250 | 0801.0209 | Effective symbolic dynamics, random points, statistical behavior, complexity and entropy | <|reference_start|>Effective symbolic dynamics, random points, statistical behavior, complexity and entropy: We consider the dynamical behavior of Martin-L\"of random points in dynamical systems over metric spaces with a computable dynamics and a computable invariant measure. We use computable partitions to define a so... | arxiv | @article{galatolo2007effective,
title={Effective symbolic dynamics, random points, statistical behavior,
complexity and entropy},
author={Stefano Galatolo, Mathieu Hoyrup and Cristobal Rojas},
journal={arXiv preprint arXiv:0801.0209},
year={2007},
archivePrefix={arXiv},
eprint={0801.0209},
... | galatolo2007effective |
arxiv-2251 | 0801.0232 | Does intelligence imply contradiction? | <|reference_start|>Does intelligence imply contradiction?: Contradiction is often seen as a defect of intelligent systems and a dangerous limitation on efficiency. In this paper we raise the question of whether, on the contrary, it could be considered a key tool in increasing intelligence in biological structures. A po... | arxiv | @article{frosini2007does,
title={Does intelligence imply contradiction?},
author={Patrizio Frosini},
journal={arXiv preprint arXiv:0801.0232},
year={2007},
archivePrefix={arXiv},
eprint={0801.0232},
primaryClass={cs.AI cs.LO}
} | frosini2007does |
arxiv-2252 | 0801.0249 | A mathematical formalism for agent-based modeling | <|reference_start|>A mathematical formalism for agent-based modeling: Many complex systems can be modeled as multiagent systems in which the constituent entities (agents) interact with each other. The global dynamics of such a system is determined by the nature of the local interactions among the agents. Since it is di... | arxiv | @article{laubenbacher2007a,
title={A mathematical formalism for agent-based modeling},
author={Reinhard Laubenbacher, Abdul S. Jarrah, Henning Mortveit, and S.S.
Ravi},
journal={arXiv preprint arXiv:0801.0249},
year={2007},
archivePrefix={arXiv},
eprint={0801.0249},
primaryClass={cs.MA cs.... | laubenbacher2007a |
arxiv-2253 | 0801.0253 | Toward a statistical mechanics of four letter words | <|reference_start|>Toward a statistical mechanics of four letter words: We consider words as a network of interacting letters, and approximate the probability distribution of states taken on by this network. Despite the intuition that the rules of English spelling are highly combinatorial (and arbitrary), we find that ... | arxiv | @article{stephens2007toward,
title={Toward a statistical mechanics of four letter words},
author={Greg J. Stephens and William Bialek},
journal={arXiv preprint arXiv:0801.0253},
year={2007},
doi={10.1103/PhysRevE.81.066119},
archivePrefix={arXiv},
eprint={0801.0253},
primaryClass={q-bio.... | stephens2007toward |
arxiv-2254 | 0801.0258 | On the Maximum Span of Fixed-Angle Chains | <|reference_start|>On the Maximum Span of Fixed-Angle Chains: Soss proved that it is NP-hard to find the maximum 2D span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These fixed-angle chains can serve as models of protein backbones. The corresponding pro... | arxiv | @article{benbernou2008on,
title={On the Maximum Span of Fixed-Angle Chains},
author={Nadia Benbernou, Joseph O'Rourke},
journal={arXiv preprint arXiv:0801.0258},
year={2008},
number={Smith Computer Science 088},
archivePrefix={arXiv},
eprint={0801.0258},
primaryClass={cs.CG}
} | benbernou2008on |
arxiv-2255 | 0801.0275 | Estimating Signals with Finite Rate of Innovation from Noisy Samples: A Stochastic Algorithm | <|reference_start|>Estimating Signals with Finite Rate of Innovation from Noisy Samples: A Stochastic Algorithm: As an example of the recently-introduced concept of rate of innovation, signals that are linear combinations of a finite number of Diracs per unit time can be acquired by linear filtering followed by uniform... | arxiv | @article{tan2008estimating,
title={Estimating Signals with Finite Rate of Innovation from Noisy Samples: A
Stochastic Algorithm},
author={Vincent Y. F. Tan, Vivek K. Goyal},
journal={IEEE Trans. on Signal Processing, vol. 56, no. 10, pp. 5135-5146,
October 2008},
year={2008},
doi={10.1109/TSP.20... | tan2008estimating |
arxiv-2256 | 0801.0289 | Is Randomness "Native" to Computer Science? | <|reference_start|>Is Randomness "Native" to Computer Science?: We survey the Kolmogorov's approach to the notion of randomness through the Kolmogorov complexity theory. The original motivation of Kolmogorov was to give up a quantitative definition of information. In this theory, an object is randomness in the sense th... | arxiv | @article{ferbus-zanda2008is,
title={Is Randomness "Native" to Computer Science?},
author={Marie Ferbus-Zanda (LIAFA), Serge Grigorieff (LIAFA)},
journal={Current Trends in Theoretical Computer Science. Vol2, World
Scientific (Ed.) (2004) 141-180},
year={2008},
archivePrefix={arXiv},
eprint={08... | ferbus-zanda2008is |
arxiv-2257 | 0801.0337 | The Physical World as a Virtual Reality | <|reference_start|>The Physical World as a Virtual Reality: This paper explores the idea that the universe is a virtual reality created by information processing, and relates this strange idea to the findings of modern physics about the physical world. The virtual reality concept is familiar to us from online worlds, b... | arxiv | @article{whitworth2008the,
title={The Physical World as a Virtual Reality},
author={Brian Whitworth},
journal={arXiv preprint arXiv:0801.0337},
year={2008},
number={CDMTCS0316},
archivePrefix={arXiv},
eprint={0801.0337},
primaryClass={cs.OH}
} | whitworth2008the |
arxiv-2258 | 0801.0340 | Sum Rate Maximization using Linear Precoding and Decoding in the Multiuser MIMO Downlink | <|reference_start|>Sum Rate Maximization using Linear Precoding and Decoding in the Multiuser MIMO Downlink: We propose an algorithm to maximize the instantaneous sum data rate transmitted by a base station in the downlink of a multiuser multiple-input, multiple-output system. The transmitter and the receivers may each... | arxiv | @article{tenenbaum2008sum,
title={Sum Rate Maximization using Linear Precoding and Decoding in the
Multiuser MIMO Downlink},
author={Adam J. Tenenbaum and Raviraj S. Adve},
journal={arXiv preprint arXiv:0801.0340},
year={2008},
archivePrefix={arXiv},
eprint={0801.0340},
primaryClass={cs.IT... | tenenbaum2008sum |
arxiv-2259 | 0801.0341 | Exactness of Belief Propagation for Some Graphical Models with Loops | <|reference_start|>Exactness of Belief Propagation for Some Graphical Models with Loops: It is well known that an arbitrary graphical model of statistical inference defined on a tree, i.e. on a graph without loops, is solved exactly and efficiently by an iterative Belief Propagation (BP) algorithm convergent to unique ... | arxiv | @article{chertkov2008exactness,
title={Exactness of Belief Propagation for Some Graphical Models with Loops},
author={Michael Chertkov (Los Alamos)},
journal={J. Stat. Mech. (2008) P10016},
year={2008},
doi={10.1088/1742-5468/2008/10/P10016},
number={LANL LA-UR-07-8441},
archivePrefix={arXiv... | chertkov2008exactness |
arxiv-2260 | 0801.0349 | Church, Cardinal and Ordinal Representations of Integers and Kolmogorov complexity | <|reference_start|>Church, Cardinal and Ordinal Representations of Integers and Kolmogorov complexity: We consider classical representations of integers: Church's function iterators, cardinal equivalence classes of sets, ordinal equivalence classes of totally ordered sets. Since programs do not work on abstract entitie... | arxiv | @article{ferbus-zanda2008church,,
title={Church, Cardinal and Ordinal Representations of Integers and Kolmogorov
complexity},
author={Marie Ferbus-Zanda (LIAFA), Serge Grigorieff (LIAFA)},
journal={Dans Denis Richard's 60th Biirthday Conference - Denis Richard's
60th Biirthday Conference, France (2002)}... | ferbus-zanda2008church, |
arxiv-2261 | 0801.0350 | Refinment of the "up to a constant" ordering using contructive co-immunity and alike Application to the Min/Max hierarchy of Kolmogorov complexities | <|reference_start|>Refinment of the "up to a constant" ordering using contructive co-immunity and alike Application to the Min/Max hierarchy of Kolmogorov complexities: We introduce orderings between total functions f,g: N -> N which refine the pointwise "up to a constant" ordering <=cte and also insure that f(x) is of... | arxiv | @article{ferbus-zanda2008refinment,
title={Refinment of the "up to a constant" ordering using contructive
co-immunity and alike. Application to the Min/Max hierarchy of Kolmogorov
complexities},
author={Marie Ferbus-Zanda (LIAFA), Serge Grigorieff (LIAFA)},
journal={arXiv preprint arXiv:0801.0350},
... | ferbus-zanda2008refinment |
arxiv-2262 | 0801.0351 | Kolmogorov complexities Kmax, Kmin on computable partially ordered sets | <|reference_start|>Kolmogorov complexities Kmax, Kmin on computable partially ordered sets: We introduce a machine free mathematical framework to get a natural formalization of some general notions of infinite computation in the context of Kolmogorov complexity. Namely, the classes Max^{X\to D}_{PR} and Max^{X\to D}_{R... | arxiv | @article{ferbus-zanda2008kolmogorov,
title={Kolmogorov complexities Kmax, Kmin on computable partially ordered sets},
author={Marie Ferbus-Zanda (LIAFA), Serge Grigorieff (LIAFA)},
journal={Theoretical Computer Science 352 (2006) 159-180},
year={2008},
archivePrefix={arXiv},
eprint={0801.0351},
... | ferbus-zanda2008kolmogorov |
arxiv-2263 | 0801.0352 | The price of certainty: "waterslide curves" and the gap to capacity | <|reference_start|>The price of certainty: "waterslide curves" and the gap to capacity: The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. Traditional information-theoretic analysis uses `wate... | arxiv | @article{sahai2008the,
title={The price of certainty: "waterslide curves" and the gap to capacity},
author={Anant Sahai and Pulkit Grover},
journal={arXiv preprint arXiv:0801.0352},
year={2008},
number={UCB/EECS-2008-1},
archivePrefix={arXiv},
eprint={0801.0352},
primaryClass={cs.IT math... | sahai2008the |
arxiv-2264 | 0801.0353 | Set theoretical Representations of Integers, I | <|reference_start|>Set theoretical Representations of Integers, I: We reconsider some classical natural semantics of integers (namely iterators of functions, cardinals of sets, index of equivalence relations), in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple representation of ... | arxiv | @article{ferbus-zanda2008set,
title={Set theoretical Representations of Integers, I},
author={Marie Ferbus-Zanda (LIAFA), Serge Grigorieff (LIAFA)},
journal={Mathematical Logic Quaterly 52, Number 4 (2006) 375-403},
year={2008},
doi={10.1002/malq.200510040},
archivePrefix={arXiv},
eprint={08... | ferbus-zanda2008set |
arxiv-2265 | 0801.0354 | Kolmogorov complexity in perspective | <|reference_start|>Kolmogorov complexity in perspective: We survey the diverse approaches to the notion of information content: from Shannon entropy to Kolmogorov complexity. The main applications of Kolmogorov complexity are presented namely, the mathematical notion of randomness (which goes back to the 60's with the ... | arxiv | @article{ferbus-zanda2008kolmogorov,
title={Kolmogorov complexity in perspective},
author={Marie Ferbus-Zanda (LIAFA), Serge Grigorieff (LIAFA)},
journal={arXiv preprint arXiv:0801.0354},
year={2008},
archivePrefix={arXiv},
eprint={0801.0354},
primaryClass={math.LO cs.CC cs.IT math.IT}
} | ferbus-zanda2008kolmogorov |
arxiv-2266 | 0801.0386 | Spam: It's Not Just for Inboxes and Search Engines! Making Hirsch h-index Robust to Scientospam | <|reference_start|>Spam: It's Not Just for Inboxes and Search Engines! Making Hirsch h-index Robust to Scientospam: What is the 'level of excellence' of a scientist and the real impact of his/her work upon the scientific thinking and practising? How can we design a fair, an unbiased metric -- and most importantly -- a ... | arxiv | @article{katsaros2008spam:,
title={Spam: It's Not Just for Inboxes and Search Engines! Making Hirsch
h-index Robust to Scientospam},
author={Dimitrios Katsaros, Leonidas Akritidis, Panayiotis Bozanis},
journal={arXiv preprint arXiv:0801.0386},
year={2008},
archivePrefix={arXiv},
eprint={0801.0... | katsaros2008spam: |
arxiv-2267 | 0801.0390 | Staring at Economic Aggregators through Information Lenses | <|reference_start|>Staring at Economic Aggregators through Information Lenses: It is hard to exaggerate the role of economic aggregators -- functions that summarize numerous and / or heterogeneous data -- in economic models since the early XX$^{th}$ century. In many cases, as witnessed by the pioneering works of Cobb a... | arxiv | @article{nock2008staring,
title={Staring at Economic Aggregators through Information Lenses},
author={Richard Nock, Nicolas Sanz, Fred Celimene, Frank Nielsen},
journal={arXiv preprint arXiv:0801.0390},
year={2008},
archivePrefix={arXiv},
eprint={0801.0390},
primaryClass={cs.IT cs.LG math.IT... | nock2008staring |
arxiv-2268 | 0801.0398 | On the graph isomorphism problem | <|reference_start|>On the graph isomorphism problem: We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.<|reference_end|> | arxiv | @article{friedland2008on,
title={On the graph isomorphism problem},
author={Shmuel Friedland},
journal={arXiv preprint arXiv:0801.0398},
year={2008},
archivePrefix={arXiv},
eprint={0801.0398},
primaryClass={cs.CC cs.DM}
} | friedland2008on |
arxiv-2269 | 0801.0426 | On the Relationship between Transmission Power and Capacity of an Underwater Acoustic Communication Channel | <|reference_start|>On the Relationship between Transmission Power and Capacity of an Underwater Acoustic Communication Channel: The underwater acoustic channel is characterized by a path loss that depends not only on the transmission distance, but also on the signal frequency. As a consequence, transmission bandwidth d... | arxiv | @article{lucani2008on,
title={On the Relationship between Transmission Power and Capacity of an
Underwater Acoustic Communication Channel},
author={Daniel E. Lucani, Milica Stojanovic, Muriel M'edard},
journal={arXiv preprint arXiv:0801.0426},
year={2008},
doi={10.1109/OCEANSKOBE.2008.4531073},
... | lucani2008on |
arxiv-2270 | 0801.0452 | Sum Capacity of the Gaussian Interference Channel in the Low Interference Regime | <|reference_start|>Sum Capacity of the Gaussian Interference Channel in the Low Interference Regime: New upper bounds on the sum capacity of the two-user Gaussian interference channel are derived. Using these bounds, it is shown that treating interference as noise achieves the sum capacity if the interference levels ar... | arxiv | @article{annapureddy2008sum,
title={Sum Capacity of the Gaussian Interference Channel in the Low
Interference Regime},
author={V. Sreekanth Annapureddy and Venugopal V. Veeravalli},
journal={arXiv preprint arXiv:0801.0452},
year={2008},
archivePrefix={arXiv},
eprint={0801.0452},
primaryCla... | annapureddy2008sum |
arxiv-2271 | 0801.0455 | A System Theoretic Approach to Bandwidth Estimation | <|reference_start|>A System Theoretic Approach to Bandwidth Estimation: It is shown that bandwidth estimation in packet networks can be viewed in terms of min-plus linear system theory. The available bandwidth of a link or complete path is expressed in terms of a {\em service curve}, which is a function that appears in... | arxiv | @article{liebeherr2008a,
title={A System Theoretic Approach to Bandwidth Estimation},
author={Jorg Liebeherr, Markus Fidler, Shahrokh Valaee},
journal={arXiv preprint arXiv:0801.0455},
year={2008},
archivePrefix={arXiv},
eprint={0801.0455},
primaryClass={cs.NI cs.PF}
} | liebeherr2008a |
arxiv-2272 | 0801.0474 | Analysis and Counterexamples Regarding Yatsenko's Polynomial-Time Algorithm for Solving the Traveling Salesman Problem | <|reference_start|>Analysis and Counterexamples Regarding Yatsenko's Polynomial-Time Algorithm for Solving the Traveling Salesman Problem: Yatsenko gives a polynomial-time algorithm for solving the traveling salesman problem. We examine the correctness of the algorithm and its construction. We also comment on Yatsenko'... | arxiv | @article{clingerman2008analysis,
title={Analysis and Counterexamples Regarding Yatsenko's Polynomial-Time
Algorithm for Solving the Traveling Salesman Problem},
author={Christopher Clingerman, Jeremiah Hemphill, Corey Proscia},
journal={arXiv preprint arXiv:0801.0474},
year={2008},
archivePrefix={... | clingerman2008analysis |
arxiv-2273 | 0801.0514 | New results on Noncommutative and Commutative Polynomial Identity Testing | <|reference_start|>New results on Noncommutative and Commutative Polynomial Identity Testing: Using ideas from automata theory we design a new efficient (deterministic) identity test for the \emph{noncommutative} polynomial identity testing problem (first introduced and studied in \cite{RS05,BW05}). We also apply this ... | arxiv | @article{arvind2008new,
title={New results on Noncommutative and Commutative Polynomial Identity
Testing},
author={V. Arvind, Partha Mukhopadhyay, and Srikanth Srinivasan},
journal={arXiv preprint arXiv:0801.0514},
year={2008},
archivePrefix={arXiv},
eprint={0801.0514},
primaryClass={cs.CC... | arvind2008new |
arxiv-2274 | 0801.0523 | Certifying floating-point implementations using Gappa | <|reference_start|>Certifying floating-point implementations using Gappa: High confidence in floating-point programs requires proving numerical properties of final and intermediate values. One may need to guarantee that a value stays within some range, or that the error relative to some ideal value is well bounded. Suc... | arxiv | @article{de dinechin2008certifying,
title={Certifying floating-point implementations using Gappa},
author={Florent De Dinechin (LIP), Christoph Quirin Lauter (LIP), Guillaume
Melquiond (LIP)},
journal={arXiv preprint arXiv:0801.0523},
year={2008},
archivePrefix={arXiv},
eprint={0801.0523},
... | de dinechin2008certifying |
arxiv-2275 | 0801.0533 | Topology and Ambiguity in Omega Context Free Languages | <|reference_start|>Topology and Ambiguity in Omega Context Free Languages: We study the links between the topological complexity of an omega context free language and its degree of ambiguity. In particular, using known facts from classical descriptive set theory, we prove that non Borel omega context free languages whi... | arxiv | @article{finkel2008topology,
title={Topology and Ambiguity in Omega Context Free Languages},
author={Olivier Finkel (ELM), Pierre Simonnet (SPE)},
journal={Bulletin of the Belgian Mathematical Society 10 (5) (2003) 707-722},
year={2008},
archivePrefix={arXiv},
eprint={0801.0533},
primaryClas... | finkel2008topology |
arxiv-2276 | 0801.0534 | On the Length of the Wadge Hierarchy of Omega Context Free Languages | <|reference_start|>On the Length of the Wadge Hierarchy of Omega Context Free Languages: We prove in this paper that the length of the Wadge hierarchy of omega context free languages is greater than the Cantor ordinal epsilon_omega, which is the omega-th fixed point of the ordinal exponentiation of base omega. The same... | arxiv | @article{finkel2008on,
title={On the Length of the Wadge Hierarchy of Omega Context Free Languages},
author={Olivier Finkel (ELM)},
journal={Journal of Automata, Languages and Combinatorics 10 (4) (2005)
439-464},
year={2008},
archivePrefix={arXiv},
eprint={0801.0534},
primaryClass={cs.LO ... | finkel2008on |
arxiv-2277 | 0801.0535 | An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank | <|reference_start|>An omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank: Omega-powers of finitary languages are omega languages in the form V^omega, where V is a finitary language over a finite alphabet X. Since the set of infinite words over X can be equipped with the usual Cantor topology, the ... | arxiv | @article{finkel2008an,
title={An omega-Power of a Finitary Language Which is a Borel Set of Infinite
Rank},
author={Olivier Finkel (ELM)},
journal={Fundamenta Informaticae 62 (3-4) (2004) 333-342},
year={2008},
archivePrefix={arXiv},
eprint={0801.0535},
primaryClass={cs.LO math.LO}
} | finkel2008an |
arxiv-2278 | 0801.0537 | On Infinite Real Trace Rational Languages of Maximum Topological Complexity | <|reference_start|>On Infinite Real Trace Rational Languages of Maximum Topological Complexity: We consider the set of infinite real traces, over a dependence alphabet (Gamma, D) with no isolated letter, equipped with the topology induced by the prefix metric. We then prove that all rational languages of infinite real ... | arxiv | @article{finkel2008on,
title={On Infinite Real Trace Rational Languages of Maximum Topological
Complexity},
author={Olivier Finkel (ELM), Jean-Pierre Ressayre (ELM), Pierre Simonnet
(SPE)},
journal={Zapiski Nauchnyh Seminarov POMI 316 (2004) 205-223},
year={2008},
archivePrefix={arXiv},
epri... | finkel2008on |
arxiv-2279 | 0801.0540 | Blind decoding of Linear Gaussian channels with ISI, capacity, error exponent, universality | <|reference_start|>Blind decoding of Linear Gaussian channels with ISI, capacity, error exponent, universality: A new straightforward universal blind detection algorithm for linear Gaussian channel with ISI is given. A new error exponent is derived, which is better than Gallager's random coding error exponent.<|referen... | arxiv | @article{farkas2008blind,
title={Blind decoding of Linear Gaussian channels with ISI, capacity, error
exponent, universality},
author={L'or'ant Farkas},
journal={arXiv preprint arXiv:0801.0540},
year={2008},
archivePrefix={arXiv},
eprint={0801.0540},
primaryClass={cs.IT math.IT}
} | farkas2008blind |
arxiv-2280 | 0801.0558 | Words and morphisms with Sturmian erasures | <|reference_start|>Words and morphisms with Sturmian erasures: We say $x \in \{0,1,2 \}^{\NN}$ is a word with Sturmian erasures if for any $a\in \{0,1,2 \}$ the word obtained erasing all $a$ in $x$ is a Sturmian word. A large family of such words is given coding trajectories of balls in the game of billiards in the cub... | arxiv | @article{durand2008words,
title={Words and morphisms with Sturmian erasures},
author={Fabien Durand (LAMFA), Adel Guerziz (LAMFA), Michel Koskas (LAMFA)},
journal={Bulletin of the Belgian Mathematical Society 11, 4 (2004) 575-588},
year={2008},
archivePrefix={arXiv},
eprint={0801.0558},
prim... | durand2008words |
arxiv-2281 | 0801.0575 | A Flexible and Secure Remote Systems Authentication Scheme Using Smart Cards | <|reference_start|>A Flexible and Secure Remote Systems Authentication Scheme Using Smart Cards: The paper presents an authentication scheme for remote systems using smart card. The scheme prevents the scenario of many logged in users with the same login identity, and does not require password/verifier table to validat... | arxiv | @article{das2008a,
title={A Flexible and Secure Remote Systems Authentication Scheme Using Smart
Cards},
author={Manik Lal Das},
journal={Published in the Transactions on Electronics, Computer and
Communication, 1(2):78-82, 2006},
year={2008},
archivePrefix={arXiv},
eprint={0801.0575},
p... | das2008a |
arxiv-2282 | 0801.0581 | Capacity of The Discrete-Time Non-Coherent Memoryless Rayleigh Fading Channels at Low SNR | <|reference_start|>Capacity of The Discrete-Time Non-Coherent Memoryless Rayleigh Fading Channels at Low SNR: The capacity of a discrete-time memoryless channel, in which successive symbols fade independently, and where the channel state information (CSI) is neither available at the transmitter nor at the receiver, is ... | arxiv | @article{rezki2008capacity,
title={Capacity of The Discrete-Time Non-Coherent Memoryless Rayleigh Fading
Channels at Low SNR},
author={Z. Rezki, David Haccoun and Franc{c}ois Gagnon},
journal={arXiv preprint arXiv:0801.0581},
year={2008},
archivePrefix={arXiv},
eprint={0801.0581},
primaryC... | rezki2008capacity |
arxiv-2283 | 0801.0586 | On sign conditions over real multivariate polynomials | <|reference_start|>On sign conditions over real multivariate polynomials: We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a family of real polynomials defining regular hypersurfaces that intersec... | arxiv | @article{jeronimo2008on,
title={On sign conditions over real multivariate polynomials},
author={Gabriela Jeronimo, Daniel Perrucci, Juan Sabia},
journal={arXiv preprint arXiv:0801.0586},
year={2008},
archivePrefix={arXiv},
eprint={0801.0586},
primaryClass={math.AG cs.CG cs.SC}
} | jeronimo2008on |
arxiv-2284 | 0801.0590 | An algorithm for finding the Independence Number of a graph | <|reference_start|>An algorithm for finding the Independence Number of a graph: In this paper, we prove that for every connected graph G, there exists a split graph H with the same independence number and the same order. Then we propose a first algorithm for finding this graph, given the degree sequence of the input gr... | arxiv | @article{kettani2008an,
title={An algorithm for finding the Independence Number of a graph},
author={Omar Kettani},
journal={arXiv preprint arXiv:0801.0590},
year={2008},
archivePrefix={arXiv},
eprint={0801.0590},
primaryClass={cs.DM cs.DS}
} | kettani2008an |
arxiv-2285 | 0801.0597 | Distributed Power Allocation Strategies for Parallel Relay Networks | <|reference_start|>Distributed Power Allocation Strategies for Parallel Relay Networks: We consider a source-destination pair assisted by parallel regenerative decode-and-forward relays operating in orthogonal channels. We investigate distributed power allocation strategies for this system with limited channel state in... | arxiv | @article{chen2008distributed,
title={Distributed Power Allocation Strategies for Parallel Relay Networks},
author={Min Chen, Semih Serbetli and Aylin Yener},
journal={arXiv preprint arXiv:0801.0597},
year={2008},
archivePrefix={arXiv},
eprint={0801.0597},
primaryClass={cs.IT math.IT}
} | chen2008distributed |
arxiv-2286 | 0801.0609 | Applying the CobiT Control Framework to Spreadsheet Developments | <|reference_start|>Applying the CobiT Control Framework to Spreadsheet Developments: One of the problems reported by researchers and auditors in the field of spreadsheet risks is that of getting and keeping managements attention to the problem. Since 1996, the Information Systems Audit & Control Foundation and the IT G... | arxiv | @article{butler2008applying,
title={Applying the CobiT Control Framework to Spreadsheet Developments},
author={Raymond J. Butler},
journal={Proc. European Spreadsheet Risks Int. Grp. 2001 7-13 ISBN:1 86166
179 7},
year={2008},
archivePrefix={arXiv},
eprint={0801.0609},
primaryClass={cs.SE ... | butler2008applying |
arxiv-2287 | 0801.0625 | On the Robustness of the Delay-Based Fingerprint Embedding Scheme | <|reference_start|>On the Robustness of the Delay-Based Fingerprint Embedding Scheme: The delay-based fingerprint embedding was recently proposed to support more users in secure media distribution scenario. In this embedding scheme, some users are assigned the same fingerprint code with only different embedding delay. ... | arxiv | @article{lian2008on,
title={On the Robustness of the Delay-Based Fingerprint Embedding Scheme},
author={Shiguo Lian},
journal={arXiv preprint arXiv:0801.0625},
year={2008},
archivePrefix={arXiv},
eprint={0801.0625},
primaryClass={cs.MM cs.SD}
} | lian2008on |
arxiv-2288 | 0801.0649 | A logical analysis of entanglement and separability in quantum higher-order functions | <|reference_start|>A logical analysis of entanglement and separability in quantum higher-order functions: We present a logical separability analysis for a functional quantum computation language. This logic is inspired by previous works on logical analysis of aliasing for imperative functional programs. Both analyses s... | arxiv | @article{prost2008a,
title={A logical analysis of entanglement and separability in quantum
higher-order functions},
author={F. Prost and C. Zerrari},
journal={arXiv preprint arXiv:0801.0649},
year={2008},
doi={10.1007/978-3-642-03745-0_25},
archivePrefix={arXiv},
eprint={0801.0649},
pr... | prost2008a |
arxiv-2289 | 0801.0665 | A theorem of Cobham for non-primitive substitutions | <|reference_start|>A theorem of Cobham for non-primitive substitutions: In this article we generalize Cobham theorem to a large class of substitutions including non primitive and non constant length substitutions.<|reference_end|> | arxiv | @article{durand2008a,
title={A theorem of Cobham for non-primitive substitutions},
author={Fabien Durand (LAMFA)},
journal={Acta Arithmetica 104, 3 (2002) 225-241},
year={2008},
archivePrefix={arXiv},
eprint={0801.0665},
primaryClass={math.CO cs.DM}
} | durand2008a |
arxiv-2290 | 0801.0672 | On Multipath Fading Channels at High SNR | <|reference_start|>On Multipath Fading Channels at High SNR: This paper studies the capacity of discrete-time multipath fading channels. It is assumed that the number of paths is finite, i.e., that the channel output is influenced by the present and by the L previous channel inputs. A noncoherent channel model is consi... | arxiv | @article{koch2008on,
title={On Multipath Fading Channels at High SNR},
author={Tobias Koch and Amos Lapidoth},
journal={arXiv preprint arXiv:0801.0672},
year={2008},
archivePrefix={arXiv},
eprint={0801.0672},
primaryClass={cs.IT math.IT}
} | koch2008on |
arxiv-2291 | 0801.0677 | Finite-state concurrent programs can be expressed pairwise | <|reference_start|>Finite-state concurrent programs can be expressed pairwise: We present a \emph{pairwise normal form} for finite-state shared memory concurrent programs: all variables are shared between exactly two processes, and the guards on transitions are conjunctions of conditions over this pairwise shared state... | arxiv | @article{attie2008finite-state,
title={Finite-state concurrent programs can be expressed pairwise},
author={Paul C. Attie},
journal={arXiv preprint arXiv:0801.0677},
year={2008},
archivePrefix={arXiv},
eprint={0801.0677},
primaryClass={cs.LO}
} | attie2008finite-state |
arxiv-2292 | 0801.0678 | Implementation of perception and action at nanoscale | <|reference_start|>Implementation of perception and action at nanoscale: Real time combination of nanosensors and nanoactuators with virtual reality environment and multisensorial interfaces enable us to efficiently act and perceive at nanoscale. Advanced manipulation of nanoobjects and new strategies for scientific ed... | arxiv | @article{marlière2008implementation,
title={Implementation of perception and action at nanoscale},
author={Sylvain Marli`ere (ICA), Jean Loup Florens (ICA), Florence Marchi
(ESRF, NEEL), Annie Luciani (ICA), Joel Chevrier (ESRF, NEEL)},
journal={arXiv preprint arXiv:0801.0678},
year={2008},
archiv... | marlière2008implementation |
arxiv-2293 | 0801.0701 | Adversarial Models and Resilient Schemes for Network Coding | <|reference_start|>Adversarial Models and Resilient Schemes for Network Coding: In a recent paper, Jaggi et al. (INFOCOM 2007), presented a distributed polynomial-time rate-optimal network-coding scheme that works in the presence of Byzantine faults. We revisit their adversarial models and augment them with three, argu... | arxiv | @article{nutman2008adversarial,
title={Adversarial Models and Resilient Schemes for Network Coding},
author={Leah Nutman and Michael Langberg},
journal={arXiv preprint arXiv:0801.0701},
year={2008},
archivePrefix={arXiv},
eprint={0801.0701},
primaryClass={cs.IT cs.DC cs.NI math.IT}
} | nutman2008adversarial |
arxiv-2294 | 0801.0714 | Regular Expression Subtyping for XML Query and Update Languages | <|reference_start|>Regular Expression Subtyping for XML Query and Update Languages: XML database query languages such as XQuery employ regular expression types with structural subtyping. Subtyping systems typically have two presentations, which should be equivalent: a declarative version in which the subsumption rule m... | arxiv | @article{cheney2008regular,
title={Regular Expression Subtyping for XML Query and Update Languages},
author={James Cheney},
journal={arXiv preprint arXiv:0801.0714},
year={2008},
archivePrefix={arXiv},
eprint={0801.0714},
primaryClass={cs.PL cs.DB}
} | cheney2008regular |
arxiv-2295 | 0801.0715 | Impact of Errors in Operational Spreadsheets | <|reference_start|>Impact of Errors in Operational Spreadsheets: All users of spreadsheets struggle with the problem of errors. Errors are thought to be prevalent in spreadsheets, and in some instances they have cost organizations millions of dollars. In a previous study of 50 operational spreadsheets we found errors i... | arxiv | @article{powell2008impact,
title={Impact of Errors in Operational Spreadsheets},
author={Stephen G. Powell, Barry Lawson, and Kenneth R. Baker},
journal={Proc. European Spreadsheet Risks Int. Grp. 2007 57-68 ISBN
978-905617-58-6},
year={2008},
archivePrefix={arXiv},
eprint={0801.0715},
pri... | powell2008impact |
arxiv-2296 | 0801.0756 | Distributed Source Coding for Interactive Function Computation | <|reference_start|>Distributed Source Coding for Interactive Function Computation: A two-terminal interactive distributed source coding problem with alternating messages for function computation at both locations is studied. For any number of messages, a computable characterization of the rate region is provided in ter... | arxiv | @article{ma2008distributed,
title={Distributed Source Coding for Interactive Function Computation},
author={Nan Ma, Prakash Ishwar},
journal={arXiv preprint arXiv:0801.0756},
year={2008},
archivePrefix={arXiv},
eprint={0801.0756},
primaryClass={cs.IT math.IT}
} | ma2008distributed |
arxiv-2297 | 0801.0813 | A linear-non-linear model for a computational call-by-value lambda calculus (extended abstract) | <|reference_start|>A linear-non-linear model for a computational call-by-value lambda calculus (extended abstract): We give a categorical semantics for a call-by-value linear lambda calculus. Such a lambda calculus was used by Selinger and Valiron as the backbone of a functional programming language for quantum computa... | arxiv | @article{selinger2008a,
title={A linear-non-linear model for a computational call-by-value lambda
calculus (extended abstract)},
author={Peter Selinger (1), Beno^it Valiron (2) ((1) Dalhousie University,
(2) University of Ottawa)},
journal={arXiv preprint arXiv:0801.0813},
year={2008},
archivePr... | selinger2008a |
arxiv-2298 | 0801.0815 | Joint Wyner-Ziv/Dirty Paper coding by modulo-lattice modulation | <|reference_start|>Joint Wyner-Ziv/Dirty Paper coding by modulo-lattice modulation: The combination of source coding with decoder side-information (Wyner-Ziv problem) and channel coding with encoder side-information (Gel'fand-Pinsker problem) can be optimally solved using the separation principle. In this work we show ... | arxiv | @article{kochman2008joint,
title={Joint Wyner-Ziv/Dirty Paper coding by modulo-lattice modulation},
author={Yuval Kochman and Ram Zamir},
journal={arXiv preprint arXiv:0801.0815},
year={2008},
archivePrefix={arXiv},
eprint={0801.0815},
primaryClass={cs.IT math.IT}
} | kochman2008joint |
arxiv-2299 | 0801.0821 | Unified Quantum Convolutional Coding | <|reference_start|>Unified Quantum Convolutional Coding: We outline a quantum convolutional coding technique for protecting a stream of classical bits and qubits. Our goal is to provide a framework for designing codes that approach the ``grandfather'' capacity of an entanglement-assisted quantum channel for sending cla... | arxiv | @article{wilde2008unified,
title={Unified Quantum Convolutional Coding},
author={Mark M. Wilde and Todd A. Brun},
journal={Proceedings of the 2008 International Symposium on Information
Theory, pp. 359-363, Toronto, Ontario, Canada, July 2008.},
year={2008},
doi={10.1109/ISIT.2008.4595008},
nu... | wilde2008unified |
arxiv-2300 | 0801.0830 | Evolution of central pattern generators for the control of a five-link bipedal walking mechanism | <|reference_start|>Evolution of central pattern generators for the control of a five-link bipedal walking mechanism: Central pattern generators (CPGs), with a basis is neurophysiological studies, are a type of neural network for the generation of rhythmic motion. While CPGs are being increasingly used in robot control,... | arxiv | @article{baydin2008evolution,
title={Evolution of central pattern generators for the control of a five-link
bipedal walking mechanism},
author={Atilim Gunes Baydin},
journal={Paladyn. Journal of Behavioral Robotics 3(1), 45-53 (2012)},
year={2008},
doi={10.2478/s13230-012-0019-y},
archivePrefi... | baydin2008evolution |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.