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-401 | 0705.2876 | An online algorithm for generating fractal hash chains applied to digital chains of custody | <|reference_start|>An online algorithm for generating fractal hash chains applied to digital chains of custody: This paper gives an online algorithm for generating Jakobsson's fractal hash chains. Our new algorithm compliments Jakobsson's fractal hash chain algorithm for preimage traversal since his algorithm assumes t... | arxiv | @article{bradford2007an,
title={An online algorithm for generating fractal hash chains applied to
digital chains of custody},
author={Phillip G. Bradford and Daniel A. Ray},
journal={arXiv preprint arXiv:0705.2876},
year={2007},
archivePrefix={arXiv},
eprint={0705.2876},
primaryClass={cs.C... | bradford2007an |
arxiv-402 | 0705.3013 | A stochastic non-cooperative game for energy efficiency in wireless data networks | <|reference_start|>A stochastic non-cooperative game for energy efficiency in wireless data networks: In this paper the issue of energy efficiency in CDMA wireless data networks is addressed through a game theoretic approach. Building on a recent paper by the first two authors, wherein a non-cooperative game for spread... | arxiv | @article{buzzi2007a,
title={A stochastic non-cooperative game for energy efficiency in wireless data
networks},
author={Stefano Buzzi, H. Vincent Poor, and Daniela Saturnino},
journal={arXiv preprint arXiv:0705.3013},
year={2007},
archivePrefix={arXiv},
eprint={0705.3013},
primaryClass={cs... | buzzi2007a |
arxiv-403 | 0705.3015 | An Extensible Timing Infrastructure for Adaptive Large-scale Applications | <|reference_start|>An Extensible Timing Infrastructure for Adaptive Large-scale Applications: Real-time access to accurate and reliable timing information is necessary to profile scientific applications, and crucial as simulations become increasingly complex, adaptive, and large-scale. The Cactus Framework provides fle... | arxiv | @article{stark2007an,
title={An Extensible Timing Infrastructure for Adaptive Large-scale
Applications},
author={Dylan Stark, Gabrielle Allen, Tom Goodale, Thomas Radke, Erik
Schnetter},
journal={In Roman Wyrzykowski et al., editors, Parallel Processing and
Applied Mathematics (PPAM), 2007, Gdansk, Po... | stark2007an |
arxiv-404 | 0705.3025 | Spectral Efficiency of Spectrum Pooling Systems | <|reference_start|>Spectral Efficiency of Spectrum Pooling Systems: In this contribution, we investigate the idea of using cognitive radio to reuse locally unused spectrum to increase the total system capacity. We consider a multiband/wideband system in which the primary and cognitive users wish to communicate to diffe... | arxiv | @article{haddad2007spectral,
title={Spectral Efficiency of Spectrum Pooling Systems},
author={Majed Haddad, Aawatif Menouni Hayar and Merouane Debbah},
journal={IET Special Issue on Cognitive Spectrum Access, Vol. 2, No. 6, pp.
733-741, July 2008},
year={2007},
archivePrefix={arXiv},
eprint={0... | haddad2007spectral |
arxiv-405 | 0705.3050 | A competitive multi-agent model of interbank payment systems | <|reference_start|>A competitive multi-agent model of interbank payment systems: We develop a dynamic multi-agent model of an interbank payment system where banks choose their level of available funds on the basis of private payoff maximisation. The model consists of the repetition of a simultaneous move stage game wit... | arxiv | @article{galbiati2007a,
title={A competitive multi-agent model of interbank payment systems},
author={Marco Galbiati and Kimmo Soramaki},
journal={arXiv preprint arXiv:0705.3050},
year={2007},
archivePrefix={arXiv},
eprint={0705.3050},
primaryClass={cs.MA}
} | galbiati2007a |
arxiv-406 | 0705.3058 | On the Shannon capacity and queueing stability of random access multicast | <|reference_start|>On the Shannon capacity and queueing stability of random access multicast: We study and compare the Shannon capacity region and the stable throughput region for a random access system in which source nodes multicast their messages to multiple destination nodes. Under an erasure channel model which ac... | arxiv | @article{shrader2007on,
title={On the Shannon capacity and queueing stability of random access
multicast},
author={Brooke Shrader and Anthony Ephremides},
journal={arXiv preprint arXiv:0705.3058},
year={2007},
archivePrefix={arXiv},
eprint={0705.3058},
primaryClass={cs.IT math.IT}
} | shrader2007on |
arxiv-407 | 0705.3061 | Measuring and Localing Homology Classes | <|reference_start|>Measuring and Localing Homology Classes: We develop a method for measuring and localizing homology classes. This involves two problems. First, we define relevant notions of size for both a homology class and a homology group basis, using ideas from relative homology. Second, we propose an algorithm t... | arxiv | @article{freedman2007measuring,
title={Measuring and Localing Homology Classes},
author={Daniel Freedman and Chao Chen},
journal={arXiv preprint arXiv:0705.3061},
year={2007},
archivePrefix={arXiv},
eprint={0705.3061},
primaryClass={cs.CG math.AT}
} | freedman2007measuring |
arxiv-408 | 0705.3099 | Distortion Minimization in Gaussian Layered Broadcast Coding with Successive Refinement | <|reference_start|>Distortion Minimization in Gaussian Layered Broadcast Coding with Successive Refinement: A transmitter without channel state information (CSI) wishes to send a delay-limited Gaussian source over a slowly fading channel. The source is coded in superimposed layers, with each layer successively refining... | arxiv | @article{ng2007distortion,
title={Distortion Minimization in Gaussian Layered Broadcast Coding with
Successive Refinement},
author={Chris T. K. Ng and Deniz Gunduz and Andrea Goldsmith and Elza Erkip},
journal={IEEE Trans. Inf. Theory, vol. 55, no. 11, pp. 5074-5086, Nov. 2009},
year={2007},
doi={... | ng2007distortion |
arxiv-409 | 0705.3227 | Computability of simple games: A characterization and application to the core | <|reference_start|>Computability of simple games: A characterization and application to the core: The class of algorithmically computable simple games (i) includes the class of games that have finite carriers and (ii) is included in the class of games that have finite winning coalitions. This paper characterizes comput... | arxiv | @article{kumabe2007computability,
title={Computability of simple games: A characterization and application to the
core},
author={Masahiro Kumabe, H. Reiju Mihara},
journal={Journal of Mathematical Economics, Volume 44, Issues 3-4, February
2008, Pages 348-366},
year={2007},
doi={10.1016/j.jmatec... | kumabe2007computability |
arxiv-410 | 0705.3261 | Recovering Multiplexing Loss Through Successive Relaying Using Repetition Coding | <|reference_start|>Recovering Multiplexing Loss Through Successive Relaying Using Repetition Coding: In this paper, a transmission protocol is studied for a two relay wireless network in which simple repetition coding is applied at the relays. Information-theoretic achievable rates for this transmission scheme are give... | arxiv | @article{fan2007recovering,
title={Recovering Multiplexing Loss Through Successive Relaying Using
Repetition Coding},
author={Yijia Fan, Chao Wang, John Thompson, H. Vincent Poor},
journal={arXiv preprint arXiv:0705.3261},
year={2007},
doi={10.1109/TWC.2007.060339},
archivePrefix={arXiv},
... | fan2007recovering |
arxiv-411 | 0705.3316 | Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence | <|reference_start|>Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence: In 1953, Kuhn showed that every sequential game has a Nash equilibrium by showing that a procedure, named ``backward induction'' in game theory, yields a Nash equilibrium. It actually yi... | arxiv | @article{roux2007acyclicity,
title={Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect
Equilibria: a Formal and Constructive Equivalence},
author={St'ephane Le Roux (LIP)},
journal={arXiv preprint arXiv:0705.3316},
year={2007},
archivePrefix={arXiv},
eprint={0705.3316},
primar... | roux2007acyclicity |
arxiv-412 | 0705.3343 | Optimal Separable Algorithms to Compute the Reverse Euclidean Distance Transformation and Discrete Medial Axis in Arbitrary Dimension | <|reference_start|>Optimal Separable Algorithms to Compute the Reverse Euclidean Distance Transformation and Discrete Medial Axis in Arbitrary Dimension: In binary images, the distance transformation (DT) and the geometrical skeleton extraction are classic tools for shape analysis. In this paper, we present time optima... | arxiv | @article{coeurjolly2007optimal,
title={Optimal Separable Algorithms to Compute the Reverse Euclidean Distance
Transformation and Discrete Medial Axis in Arbitrary Dimension},
author={David Coeurjolly (LIRIS), Annick Montanvert (GIPSA-lab)},
journal={IEEE Transactions on Pattern Analysis and Machine Intell... | coeurjolly2007optimal |
arxiv-413 | 0705.3344 | Multiuser detection in a dynamic environment Part I: User identification and data detection | <|reference_start|>Multiuser detection in a dynamic environment Part I: User identification and data detection: In random-access communication systems, the number of active users varies with time, and has considerable bearing on receiver's performance. Thus, techniques aimed at identifying not only the information tran... | arxiv | @article{biglieri2007multiuser,
title={Multiuser detection in a dynamic environment Part I: User identification
and data detection},
author={Ezio Biglieri, Marco Lops},
journal={arXiv preprint arXiv:0705.3344},
year={2007},
doi={10.1109/TIT.2007.903115},
archivePrefix={arXiv},
eprint={0705... | biglieri2007multiuser |
arxiv-414 | 0705.3360 | The Road to Quantum Artificial Intelligence | <|reference_start|>The Road to Quantum Artificial Intelligence: This paper overviews the basic principles and recent advances in the emerging field of Quantum Computation (QC), highlighting its potential application to Artificial Intelligence (AI). The paper provides a very brief introduction to basic QC issues like qu... | arxiv | @article{sgarbas2007the,
title={The Road to Quantum Artificial Intelligence},
author={Kyriakos N. Sgarbas},
journal={In: T.S.Papatheodorou, D.N.Christodoulakis and N.N.Karanikolas
(eds), "Current Trends in Informatics", Vol.A, pp.469-477, New Technologies
Publications, Athens, 2007 (SET 978-960-89784-0-... | sgarbas2007the |
arxiv-415 | 0705.3466 | Open Access Publishing in Particle Physics: A Brief Introduction for the non-Expert | <|reference_start|>Open Access Publishing in Particle Physics: A Brief Introduction for the non-Expert: Open Access to particle physics literature does not sound particularly new or exciting, since particle physicists have been reading preprints for decades, and arXiv.org for 15 years. However new movements in Europe a... | arxiv | @article{brooks2007open,
title={Open Access Publishing in Particle Physics: A Brief Introduction for the
non-Expert},
author={Travis C. Brooks},
journal={arXiv preprint arXiv:0705.3466},
year={2007},
number={SLAC-PUB-12507},
archivePrefix={arXiv},
eprint={0705.3466},
primaryClass={cs.D... | brooks2007open |
arxiv-416 | 0705.3468 | Linear Tabling Strategies and Optimizations | <|reference_start|>Linear Tabling Strategies and Optimizations: Recently, the iterative approach named linear tabling has received considerable attention because of its simplicity, ease of implementation, and good space efficiency. Linear tabling is a framework from which different methods can be derived based on the s... | arxiv | @article{zhou2007linear,
title={Linear Tabling Strategies and Optimizations},
author={Neng-Fa Zhou, Taisuke Sato, and Yi-Dong Shen},
journal={arXiv preprint arXiv:0705.3468},
year={2007},
archivePrefix={arXiv},
eprint={0705.3468},
primaryClass={cs.PL}
} | zhou2007linear |
arxiv-417 | 0705.3487 | Linearly bounded infinite graphs | <|reference_start|>Linearly bounded infinite graphs: Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural class of infinite automata representing their observable computational behavior, called linearly bounded graphs. These automata naturally accep... | arxiv | @article{carayol2007linearly,
title={Linearly bounded infinite graphs},
author={Arnaud Carayol (IRISA), Antoine Meyer (LIAFA)},
journal={Acta Informatica 43, 4 (25/08/2006) p. 265-292},
year={2007},
doi={10.1007/s00236-006-0022-z},
archivePrefix={arXiv},
eprint={0705.3487},
primaryClass=... | carayol2007linearly |
arxiv-418 | 0705.3503 | Making Random Choices Invisible to the Scheduler | <|reference_start|>Making Random Choices Invisible to the Scheduler: When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to solve the nondeterminism. It has been observed that for certain applications, notabl... | arxiv | @article{chatzikokolakis2007making,
title={Making Random Choices Invisible to the Scheduler},
author={Konstantinos Chatzikokolakis and Catuscia Palamidessi},
journal={arXiv preprint arXiv:0705.3503},
year={2007},
archivePrefix={arXiv},
eprint={0705.3503},
primaryClass={cs.CR cs.LO}
} | chatzikokolakis2007making |
arxiv-419 | 0705.3555 | Multidimensional Coded Modulation in Block-Fading Channnels | <|reference_start|>Multidimensional Coded Modulation in Block-Fading Channnels: We study the problem of constructing coded modulation schemes over multidimensional signal sets in Nakagami-$m$ block-fading channels. In particular, we consider the optimal diversity reliability exponent of the error probability when the m... | arxiv | @article{fabregas2007multidimensional,
title={Multidimensional Coded Modulation in Block-Fading Channnels},
author={Albert Guillen i Fabregas and Giuseppe Caire},
journal={arXiv preprint arXiv:0705.3555},
year={2007},
archivePrefix={arXiv},
eprint={0705.3555},
primaryClass={cs.IT math.IT}
} | fabregas2007multidimensional |
arxiv-420 | 0705.3561 | Generalizing Consistency and other Constraint Properties to Quantified Constraints | <|reference_start|>Generalizing Consistency and other Constraint Properties to Quantified Constraints: Quantified constraints and Quantified Boolean Formulae are typically much more difficult to reason with than classical constraints, because quantifier alternation makes the usual notion of solution inappropriate. As a... | arxiv | @article{bordeaux2007generalizing,
title={Generalizing Consistency and other Constraint Properties to Quantified
Constraints},
author={Lucas Bordeaux, Marco Cadoli, Toni Mancini},
journal={arXiv preprint arXiv:0705.3561},
year={2007},
archivePrefix={arXiv},
eprint={0705.3561},
primaryClass... | bordeaux2007generalizing |
arxiv-421 | 0705.3593 | MI image registration using prior knowledge | <|reference_start|>MI image registration using prior knowledge: Subtraction of aligned images is a means to assess changes in a wide variety of clinical applications. In this paper we explore the information theoretical origin of Mutual Information (MI), which is based on Shannon's entropy.However, the interpretation o... | arxiv | @article{jacquet2007mi,
title={MI image registration using prior knowledge},
author={W. Jacquet, P. de Groen},
journal={arXiv preprint arXiv:0705.3593},
year={2007},
archivePrefix={arXiv},
eprint={0705.3593},
primaryClass={cs.CV}
} | jacquet2007mi |
arxiv-422 | 0705.3610 | A Logic of Reachable Patterns in Linked Data-Structures | <|reference_start|>A Logic of Reachable Patterns in Linked Data-Structures: We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The main feature of this logic is the ability to limit the neighborho... | arxiv | @article{yorsh2007a,
title={A Logic of Reachable Patterns in Linked Data-Structures},
author={Greta Yorsh, Alexander Rabinovich, Mooly Sagiv, Antoine Meyer (LIAFA),
Ahmed Bouajjani (LIAFA)},
journal={Foundations of Software Science and Computation Structures
(29/03/2006) p. 94-110},
year={2007},
... | yorsh2007a |
arxiv-423 | 0705.3616 | On How Developers Test Open Source Software Systems | <|reference_start|>On How Developers Test Open Source Software Systems: Engineering software systems is a multidisciplinary activity, whereby a number of artifacts must be created - and maintained - synchronously. In this paper we investigate whether production code and the accompanying tests co-evolve by exploring a p... | arxiv | @article{zaidman2007on,
title={On How Developers Test Open Source Software Systems},
author={Andy Zaidman, Bart Van Rompaey, Serge Demeyer, Arie van Deursen},
journal={arXiv preprint arXiv:0705.3616},
year={2007},
number={TUD-SERG-2007-012},
archivePrefix={arXiv},
eprint={0705.3616},
pri... | zaidman2007on |
arxiv-424 | 0705.3631 | Triple-loop networks with arbitrarily many minimum distance diagrams | <|reference_start|>Triple-loop networks with arbitrarily many minimum distance diagrams: Minimum distance diagrams are a way to encode the diameter and routing information of multi-loop networks. For the widely studied case of double-loop networks, it is known that each network has at most two such diagrams and that th... | arxiv | @article{sabariego2007triple-loop,
title={Triple-loop networks with arbitrarily many minimum distance diagrams},
author={Pilar Sabariego, Francisco Santos},
journal={Discrete Mathematics, 309(6), April 2009, 1672-1684.},
year={2007},
doi={10.1016/j.disc.2008.02.047},
archivePrefix={arXiv},
e... | sabariego2007triple-loop |
arxiv-425 | 0705.3644 | Subjective Information Measure and Rate Fidelity Theory | <|reference_start|>Subjective Information Measure and Rate Fidelity Theory: Using fish-covering model, this paper intuitively explains how to extend Hartley's information formula to the generalized information formula step by step for measuring subjective information: metrical information (such as conveyed by thermomet... | arxiv | @article{lu2007subjective,
title={Subjective Information Measure and Rate Fidelity Theory},
author={Chenguang Lu},
journal={arXiv preprint arXiv:0705.3644},
year={2007},
archivePrefix={arXiv},
eprint={0705.3644},
primaryClass={cs.IT cs.HC math.IT}
} | lu2007subjective |
arxiv-426 | 0705.3669 | Structural Health Monitoring Using Neural Network Based Vibrational System Identification | <|reference_start|>Structural Health Monitoring Using Neural Network Based Vibrational System Identification: Composite fabrication technologies now provide the means for producing high-strength, low-weight panels, plates, spars and other structural components which use embedded fiber optic sensors and piezoelectric tr... | arxiv | @article{sofge2007structural,
title={Structural Health Monitoring Using Neural Network Based Vibrational
System Identification},
author={Donald A. Sofge},
journal={D. Sofge, "Structural Health Monitoring Using Neural Network Based
Vibrational System Identification," In Proceedings of the Australia-New
... | sofge2007structural |
arxiv-427 | 0705.3677 | Distributed Transmit Diversity in Relay Networks | <|reference_start|>Distributed Transmit Diversity in Relay Networks: We analyze fading relay networks, where a single-antenna source-destination terminal pair communicates through a set of half-duplex single-antenna relays using a two-hop protocol with linear processing at the relay level. A family of relaying schemes ... | arxiv | @article{akçaba2007distributed,
title={Distributed Transmit Diversity in Relay Networks},
author={Cemal Akc{c}aba, Patrick Kuppinger and Helmut B"olcskei},
journal={arXiv preprint arXiv:0705.3677},
year={2007},
archivePrefix={arXiv},
eprint={0705.3677},
primaryClass={cs.IT math.IT}
} | akçaba2007distributed |
arxiv-428 | 0705.3683 | Power-Efficient Direct-Voting Assurance for Data Fusion in Wireless Sensor Networks | <|reference_start|>Power-Efficient Direct-Voting Assurance for Data Fusion in Wireless Sensor Networks: Wireless sensor networks place sensors into an area to collect data and send them back to a base station. Data fusion, which fuses the collected data before they are sent to the base station, is usually implemented o... | arxiv | @article{pai2007power-efficient,
title={Power-Efficient Direct-Voting Assurance for Data Fusion in Wireless
Sensor Networks},
author={H.-T. Pai and Y. S. Han},
journal={arXiv preprint arXiv:0705.3683},
year={2007},
archivePrefix={arXiv},
eprint={0705.3683},
primaryClass={cs.CR cs.DC cs.NI}... | pai2007power-efficient |
arxiv-429 | 0705.3693 | Morphing Ensemble Kalman Filters | <|reference_start|>Morphing Ensemble Kalman Filters: A new type of ensemble filter is proposed, which combines an ensemble Kalman filter (EnKF) with the ideas of morphing and registration from image processing. This results in filters suitable for nonlinear problems whose solutions exhibit moving coherent features, suc... | arxiv | @article{beezley2007morphing,
title={Morphing Ensemble Kalman Filters},
author={Jonathan D. Beezley, Jan Mandel},
journal={arXiv preprint arXiv:0705.3693},
year={2007},
doi={10.1111/j.1600-0870.2007.00275.x},
number={UCDHSC CCM Report 240},
archivePrefix={arXiv},
eprint={0705.3693},
... | beezley2007morphing |
arxiv-430 | 0705.3740 | Optimal Iris Fuzzy Sketches | <|reference_start|>Optimal Iris Fuzzy Sketches: Fuzzy sketches, introduced as a link between biometry and cryptography, are a way of handling biometric data matching as an error correction issue. We focus here on iris biometrics and look for the best error-correcting code in that respect. We show that two-dimensional i... | arxiv | @article{bringer2007optimal,
title={Optimal Iris Fuzzy Sketches},
author={J. Bringer, H. Chabanne, G. Cohen, B. Kindarji, G. Z'emor},
journal={Biometrics: Theory, Applications, and Systems, 2007. BTAS 2007.
First IEEE International Conference on},
year={2007},
doi={10.1109/BTAS.2007.4401904},
... | bringer2007optimal |
arxiv-431 | 0705.3748 | On the Obfuscation Complexity of Planar Graphs | <|reference_start|>On the Obfuscation Complexity of Planar Graphs: Being motivated by John Tantalo's Planarity Game, we consider straight line plane drawings of a planar graph $G$ with edge crossings and wonder how obfuscated such drawings can be. We define $obf(G)$, the obfuscation complexity of $G$, to be the maximum... | arxiv | @article{verbitsky2007on,
title={On the Obfuscation Complexity of Planar Graphs},
author={Oleg Verbitsky},
journal={arXiv preprint arXiv:0705.3748},
year={2007},
archivePrefix={arXiv},
eprint={0705.3748},
primaryClass={cs.DM cs.CC}
} | verbitsky2007on |
arxiv-432 | 0705.3751 | On the expressive power of planar perfect matching and permanents of bounded treewidth matrices | <|reference_start|>On the expressive power of planar perfect matching and permanents of bounded treewidth matrices: Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and NP. They are defined us... | arxiv | @article{lyaudet2007on,
title={On the expressive power of planar perfect matching and permanents of
bounded treewidth matrices},
author={Laurent Lyaudet (LIP), Pascal Koiran (LIP), Uffe Flarup (IMADA)},
journal={arXiv preprint arXiv:0705.3751},
year={2007},
archivePrefix={arXiv},
eprint={0705.... | lyaudet2007on |
arxiv-433 | 0705.3766 | On complexity of optimized crossover for binary representations | <|reference_start|>On complexity of optimized crossover for binary representations: We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the class of Boolean linear programming problems, where the Boo... | arxiv | @article{eremeev2007on,
title={On complexity of optimized crossover for binary representations},
author={Anton Eremeev},
journal={arXiv preprint arXiv:0705.3766},
year={2007},
archivePrefix={arXiv},
eprint={0705.3766},
primaryClass={cs.NE cs.AI}
} | eremeev2007on |
arxiv-434 | 0705.3820 | Maximizing Maximal Angles for Plane Straight-Line Graphs | <|reference_start|>Maximizing Maximal Angles for Plane Straight-Line Graphs: Let $G=(S, E)$ be a plane straight-line graph on a finite point set $S\subset\R^2$ in general position. The incident angles of a vertex $p \in S$ of $G$ are the angles between any two edges of $G$ that appear consecutively in the circular orde... | arxiv | @article{aichholzer2007maximizing,
title={Maximizing Maximal Angles for Plane Straight-Line Graphs},
author={Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer,
Attila Por, Francisco Santos, Bettina Speckmann, Birgit Vogtenhuber},
journal={In "Algorithms and Data Structures, WADS 2007, Halif... | aichholzer2007maximizing |
arxiv-435 | 0705.3888 | Symbolic Reachability Analysis of Higher-Order Context-Free Processes | <|reference_start|>Symbolic Reachability Analysis of Higher-Order Context-Free Processes: We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA processes) where each process manipulates a data str... | arxiv | @article{bouajjani2007symbolic,
title={Symbolic Reachability Analysis of Higher-Order Context-Free Processes},
author={Ahmed Bouajjani (LIAFA), Antoine Meyer (LIAFA)},
journal={FSTTCS 2004: Foundations of Software Technology and Theoretical
Computer Science (24/11/2004) 135-147},
year={2007},
doi=... | bouajjani2007symbolic |
arxiv-436 | 0705.3895 | Towards Understanding the Origin of Genetic Languages | <|reference_start|>Towards Understanding the Origin of Genetic Languages: Molecular biology is a nanotechnology that works--it has worked for billions of years and in an amazing variety of circumstances. At its core is a system for acquiring, processing and communicating information that is universal, from viruses and ... | arxiv | @article{patel2007towards,
title={Towards Understanding the Origin of Genetic Languages},
author={Apoorva D. Patel},
journal={arXiv preprint arXiv:0705.3895},
year={2007},
doi={10.1142/9781848162556_0010},
archivePrefix={arXiv},
eprint={0705.3895},
primaryClass={q-bio.GN cs.IT math.IT ph... | patel2007towards |
arxiv-437 | 0705.3949 | Translating a first-order modal language to relational algebra | <|reference_start|>Translating a first-order modal language to relational algebra: This paper is about Kripke structures that are inside a relational database and queried with a modal language. At first the modal language that is used is introduced, followed by a definition of the database and relational algebra. Based... | arxiv | @article{havinga2007translating,
title={Translating a first-order modal language to relational algebra},
author={Yeb Havinga},
journal={arXiv preprint arXiv:0705.3949},
year={2007},
archivePrefix={arXiv},
eprint={0705.3949},
primaryClass={cs.LO cs.DB}
} | havinga2007translating |
arxiv-438 | 0705.3990 | Interior Point Decoding for Linear Vector Channels | <|reference_start|>Interior Point Decoding for Linear Vector Channels: In this paper, a novel decoding algorithm for low-density parity-check (LDPC) codes based on convex optimization is presented. The decoding algorithm, called interior point decoding, is designed for linear vector channels. The linear vector channels... | arxiv | @article{wadayama2007interior,
title={Interior Point Decoding for Linear Vector Channels},
author={Tadashi Wadayama},
journal={arXiv preprint arXiv:0705.3990},
year={2007},
doi={10.1088/1742-6596/95/1/012009},
archivePrefix={arXiv},
eprint={0705.3990},
primaryClass={cs.IT math.IT}
} | wadayama2007interior |
arxiv-439 | 0705.3992 | Average Stopping Set Weight Distribution of Redundant Random Matrix Ensembles | <|reference_start|>Average Stopping Set Weight Distribution of Redundant Random Matrix Ensembles: In this paper, redundant random matrix ensembles (abbreviated as redundant random ensembles) are defined and their stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binar... | arxiv | @article{wadayama2007average,
title={Average Stopping Set Weight Distribution of Redundant Random Matrix
Ensembles},
author={Tadashi Wadayama},
journal={arXiv preprint arXiv:0705.3992},
year={2007},
doi={10.1109/ISIT.2007.4557663},
archivePrefix={arXiv},
eprint={0705.3992},
primaryClas... | wadayama2007average |
arxiv-440 | 0705.3995 | On Undetected Error Probability of Binary Matrix Ensembles | <|reference_start|>On Undetected Error Probability of Binary Matrix Ensembles: In this paper, an analysis of the undetected error probability of ensembles of binary matrices is presented. The ensemble called the Bernoulli ensemble whose members are considered as matrices generated from i.i.d. Bernoulli source is mainly... | arxiv | @article{wadayama2007on,
title={On Undetected Error Probability of Binary Matrix Ensembles},
author={Tadashi Wadayama},
journal={arXiv preprint arXiv:0705.3995},
year={2007},
archivePrefix={arXiv},
eprint={0705.3995},
primaryClass={cs.IT math.IT}
} | wadayama2007on |
arxiv-441 | 0705.4045 | The use of the logarithm of the variate in the calculation of differential entropy among certain related statistical distributions | <|reference_start|>The use of the logarithm of the variate in the calculation of differential entropy among certain related statistical distributions: This paper demonstrates that basic statistics (mean, variance) of the logarithm of the variate itself can be used in the calculation of differential entropy among random... | arxiv | @article{eccardt2007the,
title={The use of the logarithm of the variate in the calculation of
differential entropy among certain related statistical distributions},
author={Thomas M. Eccardt},
journal={arXiv preprint arXiv:0705.4045},
year={2007},
archivePrefix={arXiv},
eprint={0705.4045},
... | eccardt2007the |
arxiv-442 | 0705.4064 | On Term Rewriting Systems Having a Rational Derivation | <|reference_start|>On Term Rewriting Systems Having a Rational Derivation: Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down systems, which generalize similar classes on words. Our aim is to study t... | arxiv | @article{meyer2007on,
title={On Term Rewriting Systems Having a Rational Derivation},
author={Antoine Meyer (LIAFA)},
journal={Foundations of Software Science and Computation Structures
(05/03/2004) 378-392},
year={2007},
doi={10.1007/b95995},
archivePrefix={arXiv},
eprint={0705.4064},
... | meyer2007on |
arxiv-443 | 0705.4085 | The Distance Geometry of Music | <|reference_start|>The Distance Geometry of Music: We demonstrate relationships between the classic Euclidean algorithm and many other fields of study, particularly in the context of music and distance geometry. Specifically, we show how the structure of the Euclidean algorithm defines a family of rhythms which encompa... | arxiv | @article{demaine2007the,
title={The Distance Geometry of Music},
author={Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport,
Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood},
journal={arXiv preprint arXiv:0705.4085},
year={2007},
archivePrefix={arXiv},
... | demaine2007the |
arxiv-444 | 0705.4094 | Efficiency and Nash Equilibria in a Scrip System for P2P Networks | <|reference_start|>Efficiency and Nash Equilibria in a Scrip System for P2P Networks: A model of providing service in a P2P network is analyzed. It is shown that by adding a scrip system, a mechanism that admits a reasonable Nash equilibrium that reduces free riding can be obtained. The effect of varying the total amou... | arxiv | @article{friedman2007efficiency,
title={Efficiency and Nash Equilibria in a Scrip System for P2P Networks},
author={Eric j. Friedman, Joseph Y. Halpern, Ian Kash},
journal={arXiv preprint arXiv:0705.4094},
year={2007},
archivePrefix={arXiv},
eprint={0705.4094},
primaryClass={cs.GT}
} | friedman2007efficiency |
arxiv-445 | 0705.4110 | Optimizing Scrip Systems: Efficiency, Crashes, Hoarders, and Altruists | <|reference_start|>Optimizing Scrip Systems: Efficiency, Crashes, Hoarders, and Altruists: We discuss the design of efficient scrip systems and develop tools for empirically analyzing them. For those interested in the empirical study of scrip systems, we demonstrate how characteristics of agents in a system can be infe... | arxiv | @article{kash2007optimizing,
title={Optimizing Scrip Systems: Efficiency, Crashes, Hoarders, and Altruists},
author={Ian A. Kash, Eric J. Friedman, Joseph Y. Halpern},
journal={arXiv preprint arXiv:0705.4110},
year={2007},
archivePrefix={arXiv},
eprint={0705.4110},
primaryClass={cs.GT}
} | kash2007optimizing |
arxiv-446 | 0705.4134 | The Battery-Discharge-Model: A Class of Stochastic Finite Automata to Simulate Multidimensional Continued Fraction Expansion | <|reference_start|>The Battery-Discharge-Model: A Class of Stochastic Finite Automata to Simulate Multidimensional Continued Fraction Expansion: We define an infinite stochastic state machine, the Battery-Discharge-Model (BDM), which simulates the behaviour of linear and jump complexity of the continued fraction expans... | arxiv | @article{vielhaber2007the,
title={The Battery-Discharge-Model: A Class of Stochastic Finite Automata to
Simulate Multidimensional Continued Fraction Expansion},
author={Michael Vielhaber and Monica del Pilar Canales},
journal={arXiv preprint arXiv:0705.4134},
year={2007},
archivePrefix={arXiv},
... | vielhaber2007the |
arxiv-447 | 0705.4138 | The Asymptotic Normalized Linear Complexity of Multisequences | <|reference_start|>The Asymptotic Normalized Linear Complexity of Multisequences: We show that the asymptotic linear complexity of a multisequence a in F_q^\infty that is I := liminf L_a(n)/n and S := limsup L_a(n)/n satisfy the inequalities M/(M+1) <= S <= 1 and M(1-S) <= I <= 1-S/M, if all M sequences have nonzero di... | arxiv | @article{vielhaber2007the,
title={The Asymptotic Normalized Linear Complexity of Multisequences},
author={Michael Vielhaber and Monica del Pilar Canales},
journal={arXiv preprint arXiv:0705.4138},
year={2007},
archivePrefix={arXiv},
eprint={0705.4138},
primaryClass={cs.IT cs.CC cs.CR math.IT... | vielhaber2007the |
arxiv-448 | 0705.4171 | Grover search algorithm | <|reference_start|>Grover search algorithm: A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum state transformation, operations them... | arxiv | @article{borbely2007grover,
title={Grover search algorithm},
author={Eva Borbely},
journal={arXiv preprint arXiv:0705.4171},
year={2007},
archivePrefix={arXiv},
eprint={0705.4171},
primaryClass={cs.DS}
} | borbely2007grover |
arxiv-449 | 0705.4185 | Secure Two-party Protocols for Point Inclusion Problem | <|reference_start|>Secure Two-party Protocols for Point Inclusion Problem: It is well known that, in theory, the general secure multi-party computation problem is solvable using circuit evaluation protocols. However, the communication complexity of the resulting protocols depend on the size of the circuit that expresse... | arxiv | @article{thomas2007secure,
title={Secure Two-party Protocols for Point Inclusion Problem},
author={Tony Thomas},
journal={arXiv preprint arXiv:0705.4185},
year={2007},
archivePrefix={arXiv},
eprint={0705.4185},
primaryClass={cs.CR}
} | thomas2007secure |
arxiv-450 | 0705.4226 | Second-Order Type Isomorphisms Through Game Semantics | <|reference_start|>Second-Order Type Isomorphisms Through Game Semantics: The characterization of second-order type isomorphisms is a purely syntactical problem that we propose to study under the enlightenment of game semantics. We study this question in the case of second-order λ$\mu$-calculus, which can be seen ... | arxiv | @article{de lataillade2007second-order,
title={Second-Order Type Isomorphisms Through Game Semantics},
author={Joachim De Lataillade (PPS)},
journal={arXiv preprint arXiv:0705.4226},
year={2007},
archivePrefix={arXiv},
eprint={0705.4226},
primaryClass={cs.LO}
} | de lataillade2007second-order |
arxiv-451 | 0705.4228 | Curry-style type Isomorphisms and Game Semantics | <|reference_start|>Curry-style type Isomorphisms and Game Semantics: Curry-style system F, ie. system F with no explicit types in terms, can be seen as a core presentation of polymorphism from the point of view of programming languages. This paper gives a characterisation of type isomorphisms for this language, by usin... | arxiv | @article{de lataillade2007curry-style,
title={Curry-style type Isomorphisms and Game Semantics},
author={Joachim De Lataillade (PPS)},
journal={arXiv preprint arXiv:0705.4228},
year={2007},
archivePrefix={arXiv},
eprint={0705.4228},
primaryClass={cs.LO}
} | de lataillade2007curry-style |
arxiv-452 | 0705.4302 | Truecluster matching | <|reference_start|>Truecluster matching: Cluster matching by permuting cluster labels is important in many clustering contexts such as cluster validation and cluster ensemble techniques. The classic approach is to minimize the euclidean distance between two cluster solutions which induces inappropriate stability in cer... | arxiv | @article{oehlschlägel2007truecluster,
title={Truecluster matching},
author={Jens Oehlschl"agel},
journal={arXiv preprint arXiv:0705.4302},
year={2007},
archivePrefix={arXiv},
eprint={0705.4302},
primaryClass={cs.AI}
} | oehlschlägel2007truecluster |
arxiv-453 | 0705.4320 | Defect-Tolerant CMOL Cell Assignment via Satisfiability | <|reference_start|>Defect-Tolerant CMOL Cell Assignment via Satisfiability: We present a CAD framework for CMOL, a hybrid CMOS/ molecular circuit architecture. Our framework first transforms any logically synthesized circuit based on AND/OR/NOT gates to a NOR gate circuit, and then maps the NOR gates to CMOL. We encode... | arxiv | @article{hung2007defect-tolerant,
title={Defect-Tolerant CMOL Cell Assignment via Satisfiability},
author={William N. N. Hung, Changjian Gao, Xiaoyu Song, Dan Hammerstrom},
journal={arXiv preprint arXiv:0705.4320},
year={2007},
archivePrefix={arXiv},
eprint={0705.4320},
primaryClass={cs.DM c... | hung2007defect-tolerant |
arxiv-454 | 0705.4369 | Computing Integer Powers in Floating-Point Arithmetic | <|reference_start|>Computing Integer Powers in Floating-Point Arithmetic: We introduce two algorithms for accurately evaluating powers to a positive integer in floating-point arithmetic, assuming a fused multiply-add (fma) instruction is available. We show that our log-time algorithm always produce faithfully-rounded r... | arxiv | @article{kornerup2007computing,
title={Computing Integer Powers in Floating-Point Arithmetic},
author={Peter Kornerup (IMADA), Vincent Lef`evre (LIP), Jean-Michel Muller
(LIP)},
journal={arXiv preprint arXiv:0705.4369},
year={2007},
archivePrefix={arXiv},
eprint={0705.4369},
primaryClass={... | kornerup2007computing |
arxiv-455 | 0705.4415 | PERCEVAL: a Computer-Driven System for Experimentation on Auditory and Visual Perception | <|reference_start|>PERCEVAL: a Computer-Driven System for Experimentation on Auditory and Visual Perception: Since perception tests are highly time-consuming, there is a need to automate as many operations as possible, such as stimulus generation, procedure control, perception testing, and data analysis. The computer-d... | arxiv | @article{andré2007perceval:,
title={PERCEVAL: a Computer-Driven System for Experimentation on Auditory and
Visual Perception},
author={Carine Andr'e (LPL), Alain Ghio (LPL), Christian Cav'e (LPL),
Bernard Teston (LPL)},
journal={Proceedings of International Congress of Phonetic Sciences (ICPhS)
(2003)... | andré2007perceval: |
arxiv-456 | 0705.4442 | World-set Decompositions: Expressiveness and Efficient Algorithms | <|reference_start|>World-set Decompositions: Expressiveness and Efficient Algorithms: Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage and processing is an important challenge in this conte... | arxiv | @article{olteanu2007world-set,
title={World-set Decompositions: Expressiveness and Efficient Algorithms},
author={Dan Olteanu and Christoph Koch and Lyublena Antova},
journal={arXiv preprint arXiv:0705.4442},
year={2007},
archivePrefix={arXiv},
eprint={0705.4442},
primaryClass={cs.DB}
} | olteanu2007world-set |
arxiv-457 | 0705.4485 | Mixed membership stochastic blockmodels | <|reference_start|>Mixed membership stochastic blockmodels: Observations consisting of measurements on relationships for pairs of objects arise in many settings, such as protein interaction and gene regulatory networks, collections of author-recipient email, and social networks. Analyzing such data with probabilisic mo... | arxiv | @article{airoldi2007mixed,
title={Mixed membership stochastic blockmodels},
author={Edoardo M Airoldi, David M Blei, Stephen E Fienberg, Eric P Xing},
journal={Journal of Machine Learning Research, 9, 1981-2014.},
year={2007},
archivePrefix={arXiv},
eprint={0705.4485},
primaryClass={stat.ME ... | airoldi2007mixed |
arxiv-458 | 0705.4566 | Loop corrections for message passing algorithms in continuous variable models | <|reference_start|>Loop corrections for message passing algorithms in continuous variable models: In this paper we derive the equations for Loop Corrected Belief Propagation on a continuous variable Gaussian model. Using the exactness of the averages for belief propagation for Gaussian models, a different way of obtain... | arxiv | @article{wemmenhove2007loop,
title={Loop corrections for message passing algorithms in continuous variable
models},
author={Bastian Wemmenhove and Bert Kappen},
journal={arXiv preprint arXiv:0705.4566},
year={2007},
archivePrefix={arXiv},
eprint={0705.4566},
primaryClass={cs.AI cs.LG}
} | wemmenhove2007loop |
arxiv-459 | 0705.4584 | Modeling Epidemic Spread in Synthetic Populations - Virtual Plagues in Massively Multiplayer Online Games | <|reference_start|>Modeling Epidemic Spread in Synthetic Populations - Virtual Plagues in Massively Multiplayer Online Games: A virtual plague is a process in which a behavior-affecting property spreads among characters in a Massively Multiplayer Online Game (MMOG). The MMOG individuals constitute a synthetic populatio... | arxiv | @article{boman2007modeling,
title={Modeling Epidemic Spread in Synthetic Populations - Virtual Plagues in
Massively Multiplayer Online Games},
author={Magnus Boman and Stefan J. Johansson},
journal={arXiv preprint arXiv:0705.4584},
year={2007},
archivePrefix={arXiv},
eprint={0705.4584},
pr... | boman2007modeling |
arxiv-460 | 0705.4604 | Temporal Runtime Verification using Monadic Difference Logic | <|reference_start|>Temporal Runtime Verification using Monadic Difference Logic: In this paper we present an algorithm for performing runtime verification of a bounded temporal logic over timed runs. The algorithm consists of three elements. First, the bounded temporal formula to be verified is translated into a monadi... | arxiv | @article{andersen2007temporal,
title={Temporal Runtime Verification using Monadic Difference Logic},
author={Henrik Reif Andersen and Kaare J. Kristoffersen},
journal={arXiv preprint arXiv:0705.4604},
year={2007},
archivePrefix={arXiv},
eprint={0705.4604},
primaryClass={cs.LO}
} | andersen2007temporal |
arxiv-461 | 0705.4606 | Dynamic User-Defined Similarity Searching in Semi-Structured Text Retrieval | <|reference_start|>Dynamic User-Defined Similarity Searching in Semi-Structured Text Retrieval: Modern text retrieval systems often provide a similarity search utility, that allows the user to find efficiently a fixed number k of documents in the data set that are most similar to a given query (here a query is either a... | arxiv | @article{geraci2007dynamic,
title={Dynamic User-Defined Similarity Searching in Semi-Structured Text
Retrieval},
author={Filippo Geraci and Marco Pellegrini},
journal={arXiv preprint arXiv:0705.4606},
year={2007},
number={IIT TR-07/2007},
archivePrefix={arXiv},
eprint={0705.4606},
prim... | geraci2007dynamic |
arxiv-462 | 0705.4618 | An Improved Tight Closure Algorithm for Integer Octagonal Constraints | <|reference_start|>An Improved Tight Closure Algorithm for Integer Octagonal Constraints: Integer octagonal constraints (a.k.a. ``Unit Two Variables Per Inequality'' or ``UTVPI integer constraints'') constitute an interesting class of constraints for the representation and solution of integer problems in the fields of ... | arxiv | @article{bagnara2007an,
title={An Improved Tight Closure Algorithm for Integer Octagonal Constraints},
author={Roberto Bagnara, Patricia M. Hill, Enea Zaffanella},
journal={arXiv preprint arXiv:0705.4618},
year={2007},
archivePrefix={arXiv},
eprint={0705.4618},
primaryClass={cs.DS cs.CG cs.L... | bagnara2007an |
arxiv-463 | 0705.4654 | Local Area Damage Detection in Composite Structures Using Piezoelectric Transducers | <|reference_start|>Local Area Damage Detection in Composite Structures Using Piezoelectric Transducers: An integrated and automated smart structures approach for structural health monitoring is presented, utilizing an array of piezoelectric transducers attached to or embedded within the structure for both actuation and... | arxiv | @article{lichtenwalner2007local,
title={Local Area Damage Detection in Composite Structures Using Piezoelectric
Transducers},
author={Peter F. Lichtenwalner and Donald A. Sofge},
journal={P.F. Lichtenwalner and D. Sofge, "Local Area Damage Detection in
Composite Structures Using Piezoelectric Transducer... | lichtenwalner2007local |
arxiv-464 | 0705.4658 | Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences | <|reference_start|>Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences: The randomness rate of an infinite binary sequence is characterized by the sequence of ratios between the Kolmogorov complexity and the length of the initial segments of the sequence. It is known that ther... | arxiv | @article{zimand2007two,
title={Two sources are better than one for increasing the Kolmogorov complexity
of infinite sequences},
author={Marius Zimand},
journal={arXiv preprint arXiv:0705.4658},
year={2007},
archivePrefix={arXiv},
eprint={0705.4658},
primaryClass={cs.IT cs.CC math.IT}
} | zimand2007two |
arxiv-465 | 0705.4673 | A randomized algorithm for the on-line weighted bipartite matching problem | <|reference_start|>A randomized algorithm for the on-line weighted bipartite matching problem: We study the on-line minimum weighted bipartite matching problem in arbitrary metric spaces. Here, $n$ not necessary disjoint points of a metric space $M$ are given, and are to be matched on-line with $n$ points of $M$ reveal... | arxiv | @article{csaba2007a,
title={A randomized algorithm for the on-line weighted bipartite matching
problem},
author={B'ela Csaba (Anal. and Stoch. Res. Group, HAS), Andr'as S. Pluh'ar
(Dept. of Comp. Sci., Univ. of Szeged)},
journal={arXiv preprint arXiv:0705.4673},
year={2007},
archivePrefix={arXiv... | csaba2007a |
arxiv-466 | 0705.4676 | Recursive n-gram hashing is pairwise independent, at best | <|reference_start|>Recursive n-gram hashing is pairwise independent, at best: Many applications use sequences of n consecutive symbols (n-grams). Hashing these n-grams can be a performance bottleneck. For more speed, recursive hash families compute hash values by updating previous values. We prove that recursive hash f... | arxiv | @article{lemire2007recursive,
title={Recursive n-gram hashing is pairwise independent, at best},
author={Daniel Lemire and Owen Kaser},
journal={Computer Speech & Language 24(4): 698-710 (2010)},
year={2007},
doi={10.1016/j.csl.2009.12.001},
archivePrefix={arXiv},
eprint={0705.4676},
pri... | lemire2007recursive |
arxiv-467 | 0706.0014 | Towards an exact adaptive algorithm for the determinant of a rational matrix | <|reference_start|>Towards an exact adaptive algorithm for the determinant of a rational matrix: In this paper we propose several strategies for the exact computation of the determinant of a rational matrix. First, we use the Chinese Remaindering Theorem and the rational reconstruction to recover the rational determina... | arxiv | @article{urbanska2007towards,
title={Towards an exact adaptive algorithm for the determinant of a rational
matrix},
author={Anna Urbanska (LJK)},
journal={arXiv preprint arXiv:0706.0014},
year={2007},
archivePrefix={arXiv},
eprint={0706.0014},
primaryClass={cs.SC}
} | urbanska2007towards |
arxiv-468 | 0706.0022 | Modeling Computations in a Semantic Network | <|reference_start|>Modeling Computations in a Semantic Network: Semantic network research has seen a resurgence from its early history in the cognitive sciences with the inception of the Semantic Web initiative. The Semantic Web effort has brought forth an array of technologies that support the encoding, storage, and q... | arxiv | @article{rodriguez2007modeling,
title={Modeling Computations in a Semantic Network},
author={Marko A. Rodriguez and Johan Bollen},
journal={arXiv preprint arXiv:0706.0022},
year={2007},
archivePrefix={arXiv},
eprint={0706.0022},
primaryClass={cs.AI}
} | rodriguez2007modeling |
arxiv-469 | 0706.0046 | Symmetry Partition Sort | <|reference_start|>Symmetry Partition Sort: In this paper, we propose a useful replacement for quicksort-style utility functions. The replacement is called Symmetry Partition Sort, which has essentially the same principle as Proportion Extend Sort. The maximal difference between them is that the new algorithm always pl... | arxiv | @article{chen2007symmetry,
title={Symmetry Partition Sort},
author={Jing-Chao Chen},
journal={arXiv preprint arXiv:0706.0046},
year={2007},
archivePrefix={arXiv},
eprint={0706.0046},
primaryClass={cs.DS}
} | chen2007symmetry |
arxiv-470 | 0706.0103 | Many concepts and two logics of algorithmic reduction | <|reference_start|>Many concepts and two logics of algorithmic reduction: Within the program of finding axiomatizations for various parts of computability logic, it was proved earlier that the logic of interactive Turing reduction is exactly the implicative fragment of Heyting's intuitionistic calculus. That sort of re... | arxiv | @article{japaridze2007many,
title={Many concepts and two logics of algorithmic reduction},
author={Giorgi Japaridze},
journal={Studia Logica 91 (2009), pp. 1-24},
year={2007},
doi={10.1007/s11225-009-9164-7},
archivePrefix={arXiv},
eprint={0706.0103},
primaryClass={cs.LO math.LO}
} | japaridze2007many |
arxiv-471 | 0706.0225 | On the End-to-End Distortion for a Buffered Transmission over Fading Channel | <|reference_start|>On the End-to-End Distortion for a Buffered Transmission over Fading Channel: In this paper, we study the end-to-end distortion/delay tradeoff for a analogue source transmitted over a fading channel. The analogue source is quantized and stored in a buffer until it is transmitted. There are two extrem... | arxiv | @article{li2007on,
title={On the End-to-End Distortion for a Buffered Transmission over Fading
Channel},
author={Qiang Li and C. N. Georghiades},
journal={arXiv preprint arXiv:0706.0225},
year={2007},
archivePrefix={arXiv},
eprint={0706.0225},
primaryClass={cs.IT math.IT}
} | li2007on |
arxiv-472 | 0706.0252 | Applying the Z-transform for the static analysis of floating-point numerical filters | <|reference_start|>Applying the Z-transform for the static analysis of floating-point numerical filters: Digital linear filters are used in a variety of applications (sound treatment, control/command, etc.), implemented in software, in hardware, or a combination thereof. For safety-critical applications, it is necessar... | arxiv | @article{monniaux2007applying,
title={Applying the Z-transform for the static analysis of floating-point
numerical filters},
author={David Monniaux (LIENS)},
journal={arXiv preprint arXiv:0706.0252},
year={2007},
archivePrefix={arXiv},
eprint={0706.0252},
primaryClass={cs.PL cs.NA}
} | monniaux2007applying |
arxiv-473 | 0706.0280 | Multi-Agent Modeling Using Intelligent Agents in the Game of Lerpa | <|reference_start|>Multi-Agent Modeling Using Intelligent Agents in the Game of Lerpa: Game theory has many limitations implicit in its application. By utilizing multiagent modeling, it is possible to solve a number of problems that are unsolvable using traditional game theory. In this paper reinforcement learning is a... | arxiv | @article{hurwitz2007multi-agent,
title={Multi-Agent Modeling Using Intelligent Agents in the Game of Lerpa},
author={Evan Hurwitz and Tshilidzi Marwala},
journal={arXiv preprint arXiv:0706.0280},
year={2007},
archivePrefix={arXiv},
eprint={0706.0280},
primaryClass={cs.MA cs.GT}
} | hurwitz2007multi-agent |
arxiv-474 | 0706.0300 | Automatic Detection of Pulmonary Embolism using Computational Intelligence | <|reference_start|>Automatic Detection of Pulmonary Embolism using Computational Intelligence: This article describes the implementation of a system designed to automatically detect the presence of pulmonary embolism in lung scans. These images are firstly segmented, before alignment and feature extraction using PCA. T... | arxiv | @article{scurrell2007automatic,
title={Automatic Detection of Pulmonary Embolism using Computational
Intelligence},
author={Simon Scurrell, Tshilidzi Marwala and David Rubin},
journal={arXiv preprint arXiv:0706.0300},
year={2007},
archivePrefix={arXiv},
eprint={0706.0300},
primaryClass={cs... | scurrell2007automatic |
arxiv-475 | 0706.0306 | Submission of content to a digital object repository using a configurable workflow system | <|reference_start|>Submission of content to a digital object repository using a configurable workflow system: The prototype of a workflow system for the submission of content to a digital object repository is here presented. It is based entirely on open-source standard components and features a service-oriented archite... | arxiv | @article{hense2007submission,
title={Submission of content to a digital object repository using a
configurable workflow system},
author={Andreas Hense, Johannes Mueller},
journal={arXiv preprint arXiv:0706.0306},
year={2007},
archivePrefix={arXiv},
eprint={0706.0306},
primaryClass={cs.DL}
... | hense2007submission |
arxiv-476 | 0706.0323 | Multiplication of free random variables and the S-transform: the case of vanishing mean | <|reference_start|>Multiplication of free random variables and the S-transform: the case of vanishing mean: This note extends Voiculescu's S-transform based analytical machinery for free multiplicative convolution to the case where the mean of the probability measures vanishes. We show that with the right interpretatio... | arxiv | @article{rao2007multiplication,
title={Multiplication of free random variables and the S-transform: the case of
vanishing mean},
author={N. Raj Rao and Roland Speicher},
journal={arXiv preprint arXiv:0706.0323},
year={2007},
archivePrefix={arXiv},
eprint={0706.0323},
primaryClass={math.OA ... | rao2007multiplication |
arxiv-477 | 0706.0427 | Watermark Embedding and Detection | <|reference_start|>Watermark Embedding and Detection: The embedder and the detector (or decoder) are the two most important components of the digital watermarking systems. Thus in this work, we discuss how to design a better embedder and detector (or decoder). I first give a summary of the prospective applications of w... | arxiv | @article{zhong2007watermark,
title={Watermark Embedding and Detection},
author={Jidong Zhong},
journal={arXiv preprint arXiv:0706.0427},
year={2007},
archivePrefix={arXiv},
eprint={0706.0427},
primaryClass={cs.MM cs.CR}
} | zhong2007watermark |
arxiv-478 | 0706.0430 | Anonymity in the Wild: Mixes on unstructured networks | <|reference_start|>Anonymity in the Wild: Mixes on unstructured networks: As decentralized computing scenarios get ever more popular, unstructured topologies are natural candidates to consider running mix networks upon. We consider mix network topologies where mixes are placed on the nodes of an unstructured network, s... | arxiv | @article{nagaraja2007anonymity,
title={Anonymity in the Wild: Mixes on unstructured networks},
author={Shishir Nagaraja},
journal={arXiv preprint arXiv:0706.0430},
year={2007},
archivePrefix={arXiv},
eprint={0706.0430},
primaryClass={cs.CR cs.NI}
} | nagaraja2007anonymity |
arxiv-479 | 0706.0431 | Abstract numeration systems on bounded languages and multiplication by a constant | <|reference_start|>Abstract numeration systems on bounded languages and multiplication by a constant: A set of integers is $S$-recognizable in an abstract numeration system $S$ if the language made up of the representations of its elements is accepted by a finite automaton. For abstract numeration systems built over bo... | arxiv | @article{charlier2007abstract,
title={Abstract numeration systems on bounded languages and multiplication by a
constant},
author={Emilie Charlier, Michel Rigo, Wolfgang Steiner (LIAFA)},
journal={Integers: Electronic Journal of Combinatorial Number Theory 8, 1
(2008) #35},
year={2007},
archivePr... | charlier2007abstract |
arxiv-480 | 0706.0447 | Non lin\'earit\'e des fonctions bool\'eennes donn\'ees par des traces de polyn\^omes de degr\'e binaire 3 | <|reference_start|>Non lin\'earit\'e des fonctions bool\'eennes donn\'ees par des traces de polyn\^omes de degr\'e binaire 3: Nous \'etudions la non lin\'earit\'e des fonctions d\'efinies sur F_{2^m} o\`u $m$ est un entier impair, associ\'ees aux polyn\^omes de degr\'e 7 ou \`a des polyn\^omes plus g\'en\'eraux. ----... | arxiv | @article{rodier2007non,
title={Non lin\'earit\'e des fonctions bool\'eennes donn\'ees par des traces de
polyn\^omes de degr\'e binaire 3},
author={Franc{c}ois Rodier (IML), Eric F'erard (GAATI)},
journal={arXiv preprint arXiv:0706.0447},
year={2007},
archivePrefix={arXiv},
eprint={0706.0447},
... | rodier2007non |
arxiv-481 | 0706.0457 | Challenges and Opportunities of Evolutionary Robotics | <|reference_start|>Challenges and Opportunities of Evolutionary Robotics: Robotic hardware designs are becoming more complex as the variety and number of on-board sensors increase and as greater computational power is provided in ever-smaller packages on-board robots. These advances in hardware, however, do not automat... | arxiv | @article{sofge2007challenges,
title={Challenges and Opportunities of Evolutionary Robotics},
author={D. A. Sofge, M. A. Potter, M. D. Bugajska, A. C. Schultz},
journal={D.A. Sofge, M.A. Potter, M.D. Bugajska, and A.C. Schultz,
"Challenges and Opportunities of Evolutionary Robotics." In Proc. 2nd Int'l
C... | sofge2007challenges |
arxiv-482 | 0706.0465 | Virtual Sensor Based Fault Detection and Classification on a Plasma Etch Reactor | <|reference_start|>Virtual Sensor Based Fault Detection and Classification on a Plasma Etch Reactor: The SEMATECH sponsored J-88-E project teaming Texas Instruments with NeuroDyne (et al.) focused on Fault Detection and Classification (FDC) on a Lam 9600 aluminum plasma etch reactor, used in the process of semiconducto... | arxiv | @article{sofge2007virtual,
title={Virtual Sensor Based Fault Detection and Classification on a Plasma Etch
Reactor},
author={D. A. Sofge},
journal={D. Sofge, "Virtual Sensor Based Fault Detection and Classification
on a Plasma Etch Reactor," The 2nd Joint Mexico-US Int'l. Workshop on Neural
Networks a... | sofge2007virtual |
arxiv-483 | 0706.0484 | Motivation, Design, and Ubiquity: A Discussion of Research Ethics and Computer Science | <|reference_start|>Motivation, Design, and Ubiquity: A Discussion of Research Ethics and Computer Science: Modern society is permeated with computers, and the software that controls them can have latent, long-term, and immediate effects that reach far beyond the actual users of these systems. This places researchers in... | arxiv | @article{wright2007motivation,,
title={Motivation, Design, and Ubiquity: A Discussion of Research Ethics and
Computer Science},
author={David R. Wright},
journal={arXiv preprint arXiv:0706.0484},
year={2007},
archivePrefix={arXiv},
eprint={0706.0484},
primaryClass={cs.GL}
} | wright2007motivation, |
arxiv-484 | 0706.0489 | Sampling Colourings of the Triangular Lattice | <|reference_start|>Sampling Colourings of the Triangular Lattice: We show that the Glauber dynamics on proper 9-colourings of the triangular lattice is rapidly mixing, which allows for efficient sampling. Consequently, there is a fully polynomial randomised approximation scheme (FPRAS) for counting proper 9-colourings ... | arxiv | @article{jalsenius2007sampling,
title={Sampling Colourings of the Triangular Lattice},
author={Markus Jalsenius},
journal={arXiv preprint arXiv:0706.0489},
year={2007},
archivePrefix={arXiv},
eprint={0706.0489},
primaryClass={math-ph cs.DM cs.DS math.MP}
} | jalsenius2007sampling |
arxiv-485 | 0706.0502 | Relating two standard notions of secrecy | <|reference_start|>Relating two standard notions of secrecy: Two styles of definitions are usually considered to express that a security protocol preserves the confidentiality of a data s. Reachability-based secrecy means that s should never be disclosed while equivalence-based secrecy states that two executions of a p... | arxiv | @article{cortier2007relating,
title={Relating two standard notions of secrecy},
author={Veronique Cortier, Michael Rusinovitch, Eugen Zalinescu},
journal={Logical Methods in Computer Science, Volume 3, Issue 3 (July 6,
2007) lmcs:1093},
year={2007},
doi={10.2168/LMCS-3(3:2)2007},
archivePrefix... | cortier2007relating |
arxiv-486 | 0706.0507 | A collaborative framework to exchange and share product information within a supply chain context | <|reference_start|>A collaborative framework to exchange and share product information within a supply chain context: The new requirement for "collaboration" between multidisciplinary collaborators induces to exchange and share adequate information on the product, processes throughout the products' lifecycle. Thus, eff... | arxiv | @article{geryville2007a,
title={A collaborative framework to exchange and share product information
within a supply chain context},
author={Hichem Geryville (LIESP), Yacine Ouzrout (LIESP), Abdelaziz Bouras
(LIESP), Nikolaos Sapidis},
journal={arXiv preprint arXiv:0706.0507},
year={2007},
archiv... | geryville2007a |
arxiv-487 | 0706.0523 | Interpolant-Based Transition Relation Approximation | <|reference_start|>Interpolant-Based Transition Relation Approximation: In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, software model checkers typically use a weak approximation of the image. This can... | arxiv | @article{jhala2007interpolant-based,
title={Interpolant-Based Transition Relation Approximation},
author={Ranjit Jhala, Kenneth L. McMillan},
journal={Logical Methods in Computer Science, Volume 3, Issue 4 (November
1, 2007) lmcs:1152},
year={2007},
doi={10.2168/LMCS-3(4:1)2007},
archivePrefix... | jhala2007interpolant-based |
arxiv-488 | 0706.0534 | Compressed Regression | <|reference_start|>Compressed Regression: Recent research has studied the role of sparsity in high dimensional regression and signal reconstruction, establishing theoretical limits for recovering sparse models from sparse data. This line of work shows that $\ell_1$-regularized least squares regression can accurately es... | arxiv | @article{zhou2007compressed,
title={Compressed Regression},
author={Shuheng Zhou, John Lafferty, Larry Wasserman},
journal={IEEE Transactions on Information Theory, Volume 55, No.2, pp
846--866, 2009},
year={2007},
archivePrefix={arXiv},
eprint={0706.0534},
primaryClass={stat.ML cs.IT math... | zhou2007compressed |
arxiv-489 | 0706.0564 | Tropical Implicitization and Mixed Fiber Polytopes | <|reference_start|>Tropical Implicitization and Mixed Fiber Polytopes: The software TrIm offers implementations of tropical implicitization and tropical elimination, as developed by Tevelev and the authors. Given a polynomial map with generic coefficients, TrIm computes the tropical variety of the image. When the image... | arxiv | @article{sturmfels2007tropical,
title={Tropical Implicitization and Mixed Fiber Polytopes},
author={Bernd Sturmfels and Josephine Yu},
journal={Software for algebraic geometry, 111--131, IMA Vol. Math. Appl.,
148, Springer, New York, 2008},
year={2007},
archivePrefix={arXiv},
eprint={0706.0564... | sturmfels2007tropical |
arxiv-490 | 0706.0580 | Efficient Batch Update of Unique Identifiers in a Distributed Hash Table for Resources in a Mobile Host | <|reference_start|>Efficient Batch Update of Unique Identifiers in a Distributed Hash Table for Resources in a Mobile Host: Resources in a distributed system can be identified using identifiers based on random numbers. When using a distributed hash table to resolve such identifiers to network locations, the straightfor... | arxiv | @article{chung2007efficient,
title={Efficient Batch Update of Unique Identifiers in a Distributed Hash Table
for Resources in a Mobile Host},
author={Yoo Chung},
journal={arXiv preprint arXiv:0706.0580},
year={2007},
doi={10.1109/ISPA.2010.73},
archivePrefix={arXiv},
eprint={0706.0580},
... | chung2007efficient |
arxiv-491 | 0706.0585 | A Novel Model of Working Set Selection for SMO Decomposition Methods | <|reference_start|>A Novel Model of Working Set Selection for SMO Decomposition Methods: In the process of training Support Vector Machines (SVMs) by decomposition methods, working set selection is an important technique, and some exciting schemes were employed into this field. To improve working set selection, we prop... | arxiv | @article{zhao2007a,
title={A Novel Model of Working Set Selection for SMO Decomposition Methods},
author={Zhendong Zhao, Lei Yuan, Yuxuan Wang, Forrest Sheng Bao, Shunyi Zhang
Yanfei Sun},
journal={arXiv preprint arXiv:0706.0585},
year={2007},
doi={10.1109/ICTAI.2007.99},
archivePrefix={arXiv}... | zhao2007a |
arxiv-492 | 0706.0682 | Code spectrum and reliability function: Gaussian channel | <|reference_start|>Code spectrum and reliability function: Gaussian channel: A new approach for upper bounding the channel reliability function using the code spectrum is described. It allows to treat both low and high rate cases in a unified way. In particular, the earlier known upper bounds are improved, and a new de... | arxiv | @article{burnashev2007code,
title={Code spectrum and reliability function: Gaussian channel},
author={Marat V. Burnashev},
journal={Problems of Information Transmission, vol. 43, no. 2, pp. 3-24,
2007},
year={2007},
archivePrefix={arXiv},
eprint={0706.0682},
primaryClass={cs.IT math.IT}
} | burnashev2007code |
arxiv-493 | 0706.0685 | Non-Parametric Field Estimation using Randomly Deployed, Noisy, Binary Sensors | <|reference_start|>Non-Parametric Field Estimation using Randomly Deployed, Noisy, Binary Sensors: The reconstruction of a deterministic data field from binary-quantized noisy observations of sensors which are randomly deployed over the field domain is studied. The study focuses on the extremes of lack of deterministic... | arxiv | @article{wang2007non-parametric,
title={Non-Parametric Field Estimation using Randomly Deployed, Noisy, Binary
Sensors},
author={Ye Wang, Prakash Ishwar},
journal={arXiv preprint arXiv:0706.0685},
year={2007},
archivePrefix={arXiv},
eprint={0706.0685},
primaryClass={cs.IT math.IT}
} | wang2007non-parametric |
arxiv-494 | 0706.0692 | Probabilistic Interval Temporal Logic and Duration Calculus with Infinite Intervals: Complete Proof Systems | <|reference_start|>Probabilistic Interval Temporal Logic and Duration Calculus with Infinite Intervals: Complete Proof Systems: The paper presents probabilistic extensions of interval temporal logic (ITL) and duration calculus (DC) with infinite intervals and complete Hilbert-style proof systems for them. The completen... | arxiv | @article{guelev2007probabilistic,
title={Probabilistic Interval Temporal Logic and Duration Calculus with
Infinite Intervals: Complete Proof Systems},
author={Dimitar P. Guelev},
journal={Logical Methods in Computer Science, Volume 3, Issue 3 (July 19,
2007) lmcs:947},
year={2007},
doi={10.2168/... | guelev2007probabilistic |
arxiv-495 | 0706.0720 | Universal Quantile Estimation with Feedback in the Communication-Constrained Setting | <|reference_start|>Universal Quantile Estimation with Feedback in the Communication-Constrained Setting: We consider the following problem of decentralized statistical inference: given i.i.d. samples from an unknown distribution, estimate an arbitrary quantile subject to limits on the number of bits exchanged. We analy... | arxiv | @article{rajagopal2007universal,
title={Universal Quantile Estimation with Feedback in the
Communication-Constrained Setting},
author={Ram Rajagopal, Martin J. Wainwright},
journal={arXiv preprint arXiv:0706.0720},
year={2007},
archivePrefix={arXiv},
eprint={0706.0720},
primaryClass={cs.IT... | rajagopal2007universal |
arxiv-496 | 0706.0869 | Position Coding | <|reference_start|>Position Coding: A position coding pattern is an array of symbols in which subarrays of a certain fixed size appear at most once. So, each subarray uniquely identifies a location in the larger array, which means there is a bijection of some sort from this set of subarrays to a set of coordinates. The... | arxiv | @article{aboufadel2007position,
title={Position Coding},
author={Edward Aboufadel, Timothy Armstrong, Elizabeth Smietana},
journal={arXiv preprint arXiv:0706.0869},
year={2007},
archivePrefix={arXiv},
eprint={0706.0869},
primaryClass={cs.IT math.CO math.IT}
} | aboufadel2007position |
arxiv-497 | 0706.0870 | Inferring the Composition of a Trader Population in a Financial Market | <|reference_start|>Inferring the Composition of a Trader Population in a Financial Market: We discuss a method for predicting financial movements and finding pockets of predictability in the price-series, which is built around inferring the heterogeneity of trading strategies in a multi-agent trader population. This wo... | arxiv | @article{gupta2007inferring,
title={Inferring the Composition of a Trader Population in a Financial Market},
author={Nachi Gupta, Raphael Hauser, and Neil F. Johnson},
journal={arXiv preprint arXiv:0706.0870},
year={2007},
doi={10.1007/978-88-470-0665-2_7},
archivePrefix={arXiv},
eprint={070... | gupta2007inferring |
arxiv-498 | 0706.0903 | Families of traveling impulses and fronts in some models with cross-diffusion | <|reference_start|>Families of traveling impulses and fronts in some models with cross-diffusion: An analysis of traveling wave solutions of partial differential equation (PDE) systems with cross-diffusion is presented. The systems under study fall in a general class of the classical Keller-Segel models to describe che... | arxiv | @article{berezovskaya2007families,
title={Families of traveling impulses and fronts in some models with
cross-diffusion},
author={Faina Berezovskaya, Artem Novozhilov, Georgy Karev},
journal={arXiv preprint arXiv:0706.0903},
year={2007},
archivePrefix={arXiv},
eprint={0706.0903},
primaryCl... | berezovskaya2007families |
arxiv-499 | 0706.1001 | Epistemic Analysis of Strategic Games with Arbitrary Strategy Sets | <|reference_start|>Epistemic Analysis of Strategic Games with Arbitrary Strategy Sets: We provide here an epistemic analysis of arbitrary strategic games based on the possibility correspondences. Such an analysis calls for the use of transfinite iterations of the corresponding operators. Our approach is based on Tarski... | arxiv | @article{apt2007epistemic,
title={Epistemic Analysis of Strategic Games with Arbitrary Strategy Sets},
author={Krzysztof R. Apt},
journal={arXiv preprint arXiv:0706.1001},
year={2007},
archivePrefix={arXiv},
eprint={0706.1001},
primaryClass={cs.GT cs.AI}
} | apt2007epistemic |
arxiv-500 | 0706.1002 | Moving Vertices to Make Drawings Plane | <|reference_start|>Moving Vertices to Make Drawings Plane: A straight-line drawing $\delta$ of a planar graph $G$ need not be plane, but can be made so by moving some of the vertices. Let shift$(G,\delta)$ denote the minimum number of vertices that need to be moved to turn $\delta$ into a plane drawing of $G$. We show ... | arxiv | @article{goaoc2007moving,
title={Moving Vertices to Make Drawings Plane},
author={Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto, Chan-Su Shin, Alexander
Wolff},
journal={arXiv preprint arXiv:0706.1002},
year={2007},
archivePrefix={arXiv},
eprint={0706.1002},
primaryClass={cs.CG cs.CC cs.DM}... | goaoc2007moving |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.