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-2101 | 0712.2449 | Reducing semantic complexity in distributed Digital Libraries: treatment of term vagueness and document re-ranking | <|reference_start|>Reducing semantic complexity in distributed Digital Libraries: treatment of term vagueness and document re-ranking: The purpose of the paper is to propose models to reduce the semantic complexity in heterogeneous DLs. The aim is to introduce value-added services (treatment of term vagueness and docum... | arxiv | @article{mayr2007reducing,
title={Reducing semantic complexity in distributed Digital Libraries: treatment
of term vagueness and document re-ranking},
author={Philipp Mayr, Peter Mutschke, Vivien Petras},
journal={arXiv preprint arXiv:0712.2449},
year={2007},
doi={10.1108/00242530810865484},
a... | mayr2007reducing |
arxiv-2102 | 0712.2467 | Rethinking Information Theory for Mobile Ad Hoc Networks | <|reference_start|>Rethinking Information Theory for Mobile Ad Hoc Networks: The subject of this paper is the long-standing open problem of developing a general capacity theory for wireless networks, particularly a theory capable of describing the fundamental performance limits of mobile ad hoc networks (MANETs). A MAN... | arxiv | @article{andrews2007rethinking,
title={Rethinking Information Theory for Mobile Ad Hoc Networks},
author={Jeff Andrews, Nihar Jindal, Martin Haenggi, Randy Berry, Syed Jafar,
Dongning Guo, Sanjay Shakkottai, Robert Heath, Michael Neely, Steven Weber,
Aylin Yener},
journal={arXiv preprint arXiv:0712.2467... | andrews2007rethinking |
arxiv-2103 | 0712.2469 | Directed Percolation in Wireless Networks with Interference and Noise | <|reference_start|>Directed Percolation in Wireless Networks with Interference and Noise: Previous studies of connectivity in wireless networks have focused on undirected geometric graphs. More sophisticated models such as Signal-to-Interference-and-Noise-Ratio (SINR) model, however, usually leads to directed graphs. I... | arxiv | @article{kong2007directed,
title={Directed Percolation in Wireless Networks with Interference and Noise},
author={Zhenning Kong and Edmund M. Yeh},
journal={arXiv preprint arXiv:0712.2469},
year={2007},
archivePrefix={arXiv},
eprint={0712.2469},
primaryClass={cs.IT cs.NI math.IT math.PR}
} | kong2007directed |
arxiv-2104 | 0712.2497 | A New Theoretic Foundation for Cross-Layer Optimization | <|reference_start|>A New Theoretic Foundation for Cross-Layer Optimization: Cross-layer optimization solutions have been proposed in recent years to improve the performance of network users operating in a time-varying, error-prone wireless environment. However, these solutions often rely on ad-hoc optimization approach... | arxiv | @article{fu2007a,
title={A New Theoretic Foundation for Cross-Layer Optimization},
author={Fangwen Fu and Mihaela van der Schaar},
journal={arXiv preprint arXiv:0712.2497},
year={2007},
archivePrefix={arXiv},
eprint={0712.2497},
primaryClass={cs.NI cs.LG}
} | fu2007a |
arxiv-2105 | 0712.2501 | Cell mapping description for digital control system with quantization effect | <|reference_start|>Cell mapping description for digital control system with quantization effect: Quantization problem in digital control system have attracted more and more attention in these years. Normally, a quantized variable is regarded as a perturbed copy of the unquantized variable in the research of quantizatio... | arxiv | @article{liang2007cell,
title={Cell mapping description for digital control system with quantization
effect},
author={Wang Liang, Wang Bing-wen, Guo Yi-Ping},
journal={arXiv preprint arXiv:0712.2501},
year={2007},
archivePrefix={arXiv},
eprint={0712.2501},
primaryClass={cs.OH}
} | liang2007cell |
arxiv-2106 | 0712.2552 | The PBD-Closure of Constant-Composition Codes | <|reference_start|>The PBD-Closure of Constant-Composition Codes: We show an interesting PBD-closure result for the set of lengths of constant-composition codes whose distance and size meet certain conditions. A consequence of this PBD-closure result is that the size of optimal constant-composition codes can be determi... | arxiv | @article{chee2007the,
title={The PBD-Closure of Constant-Composition Codes},
author={Yeow Meng Chee, Alan C. H. Ling, San Ling, and Hao Shen},
journal={IEEE Transactions on Information Theory, vol. 53, No. 8, August
2007, pp. 2685-2692},
year={2007},
doi={10.1109/TIT.2007.901175},
archivePrefi... | chee2007the |
arxiv-2107 | 0712.2553 | Constructions for Difference Triangle Sets | <|reference_start|>Constructions for Difference Triangle Sets: Difference triangle sets are useful in many practical problems of information transmission. This correspondence studies combinatorial and computational constructions for difference triangle sets having small scopes. Our algorithms have been used to produce ... | arxiv | @article{chee2007constructions,
title={Constructions for Difference Triangle Sets},
author={Yeow Meng Chee and Charles J. Colbourn},
journal={IEEE Transactions on Information Theory, vol. 43, No. 4, July
1997, pp. 1346-1349},
year={2007},
archivePrefix={arXiv},
eprint={0712.2553},
primaryC... | chee2007constructions |
arxiv-2108 | 0712.2559 | Cycle time of stochastic max-plus linear systems | <|reference_start|>Cycle time of stochastic max-plus linear systems: We analyze the asymptotic behavior of sequences of random variables defined by an initial condition, a stationary and ergodic sequence of random matrices, and an induction formula involving multiplication is the so-called max-plus algebra. This type o... | arxiv | @article{merlet2007cycle,
title={Cycle time of stochastic max-plus linear systems},
author={Glenn Merlet (LIAFA)},
journal={Electronic Journal of Probability 13 (2008) (2008) Paper 12,
322-340},
year={2007},
archivePrefix={arXiv},
eprint={0712.2559},
primaryClass={math.PR cs.DM}
} | merlet2007cycle |
arxiv-2109 | 0712.2567 | On Lower Bound for W(K_2n) | <|reference_start|>On Lower Bound for W(K_2n): The lower bound W(K_{2n})>=3n-2 is proved for the greatest possible number of colors in an interval edge coloring of the complete graph K_{2n}.<|reference_end|> | arxiv | @article{kamalian2007on,
title={On Lower Bound for W(K_{2n})},
author={Rafael R. Kamalian and Petros A. Petrosyan},
journal={Mathematical Problems of Computer Science 23, 2004, 127--129},
year={2007},
archivePrefix={arXiv},
eprint={0712.2567},
primaryClass={cs.DM}
} | kamalian2007on |
arxiv-2110 | 0712.2577 | Is the injectivity of the global function of a cellular automaton in the hyperbolic plane undecidable? | <|reference_start|>Is the injectivity of the global function of a cellular automaton in the hyperbolic plane undecidable?: In this paper, we look at the following question. We consider cellular automata in the hyperbolic plane and we consider the global function defined on all possible configurations. Is the injectivit... | arxiv | @article{maurice2007is,
title={Is the injectivity of the global function of a cellular automaton in the
hyperbolic plane undecidable?},
author={Margenstern Maurice},
journal={arXiv preprint arXiv:0712.2577},
year={2007},
archivePrefix={arXiv},
eprint={0712.2577},
primaryClass={cs.DM cs.LO}... | maurice2007is |
arxiv-2111 | 0712.2579 | On the Information of the Second Moments Between Random Variables Using Mutually Unbiased Bases | <|reference_start|>On the Information of the Second Moments Between Random Variables Using Mutually Unbiased Bases: The notation of mutually unbiased bases(MUB) was first introduced by Ivanovic to reconstruct density matrixes\cite{Ivanovic}. The subject about how to use MUB to analyze, process, and utilize the informat... | arxiv | @article{yao2007on,
title={On the Information of the Second Moments Between Random Variables Using
Mutually Unbiased Bases},
author={Hongyi Yao},
journal={arXiv preprint arXiv:0712.2579},
year={2007},
archivePrefix={arXiv},
eprint={0712.2579},
primaryClass={cs.IT math.IT}
} | yao2007on |
arxiv-2112 | 0712.2585 | Interval Edge Colourings of Complete Graphs and n-cubes | <|reference_start|>Interval Edge Colourings of Complete Graphs and n-cubes: For complete graphs and n-cubes bounds are found for the possible number of colours in an interval edge colourings.<|reference_end|> | arxiv | @article{petrosyan2007interval,
title={Interval Edge Colourings of Complete Graphs and n-cubes},
author={Petros A. Petrosyan},
journal={Mathematical Problems of Computer Science 25, 2006, 5--8},
year={2007},
archivePrefix={arXiv},
eprint={0712.2585},
primaryClass={cs.DM}
} | petrosyan2007interval |
arxiv-2113 | 0712.2587 | Maximum-Likelihood Priority-First Search Decodable Codes for Combined Channel Estimation and Error Protection | <|reference_start|>Maximum-Likelihood Priority-First Search Decodable Codes for Combined Channel Estimation and Error Protection: The code that combines channel estimation and error protection has received general attention recently, and has been considered a promising methodology to compensate multi-path fading effect... | arxiv | @article{wu2007maximum-likelihood,
title={Maximum-Likelihood Priority-First Search Decodable Codes for Combined
Channel Estimation and Error Protection},
author={Chia-Lung Wu, Po-Ning Chen, Yunghsiang S. Han, Ming-Hsin Kuo},
journal={arXiv preprint arXiv:0712.2587},
year={2007},
archivePrefix={arX... | wu2007maximum-likelihood |
arxiv-2114 | 0712.2591 | A Typical Model Audit Approach: Spreadsheet Audit Methodologies in the City of London | <|reference_start|>A Typical Model Audit Approach: Spreadsheet Audit Methodologies in the City of London: Spreadsheet audit and review procedures are an essential part of almost all City of London financial transactions. Structured processes are used to discover errors in large financial spreadsheets underpinning major... | arxiv | @article{croll2007a,
title={A Typical Model Audit Approach: Spreadsheet Audit Methodologies in the
City of London},
author={Grenville J. Croll},
journal={IFIP, Integrity and Internal Control in Information Systems, Vol
124, pp. 213-219, Kluwer, 2003},
year={2007},
archivePrefix={arXiv},
epri... | croll2007a |
arxiv-2115 | 0712.2592 | Strongly consistent nonparametric forecasting and regression for stationary ergodic sequences | <|reference_start|>Strongly consistent nonparametric forecasting and regression for stationary ergodic sequences: Let $\{(X_i,Y_i)\}$ be a stationary ergodic time series with $(X,Y)$ values in the product space $\R^d\bigotimes \R .$ This study offers what is believed to be the first strongly consistent (with respect to... | arxiv | @article{yakowitz2007strongly,
title={Strongly consistent nonparametric forecasting and regression for
stationary ergodic sequences},
author={S. Yakowitz, L. Gyorfi, J. Kieffer, G. Morvai},
journal={J. Multivariate Anal. 71 (1999), no. 1, 24--41},
year={2007},
archivePrefix={arXiv},
eprint={07... | yakowitz2007strongly |
arxiv-2116 | 0712.2594 | Stop That Subversive Spreadsheet! | <|reference_start|>Stop That Subversive Spreadsheet!: This paper documents the formation of the European Spreadsheet Risks Interest Group (EuSpRIG www.eusprig.org) and outlines some of the research undertaken and reported upon by interested parties in EuSpRIG publications<|reference_end|> | arxiv | @article{chadwick2007stop,
title={Stop That Subversive Spreadsheet!},
author={David Chadwick},
journal={IFIP, Integrity and Internal Control in Information Systems, Vol
24, pp. 205-211, Kluwer, 2003},
year={2007},
archivePrefix={arXiv},
eprint={0712.2594},
primaryClass={cs.GL}
} | chadwick2007stop |
arxiv-2117 | 0712.2595 | Distinguishing Short Quantum Computations | <|reference_start|>Distinguishing Short Quantum Computations: Distinguishing logarithmic depth quantum circuits on mixed states is shown to be complete for QIP, the class of problems having quantum interactive proof systems. Circuits in this model can represent arbitrary quantum processes, and thus this result has impl... | arxiv | @article{rosgen2007distinguishing,
title={Distinguishing Short Quantum Computations},
author={Bill Rosgen},
journal={arXiv preprint arXiv:0712.2595},
year={2007},
doi={10.4230/LIPIcs.STACS.2008.1322},
archivePrefix={arXiv},
eprint={0712.2595},
primaryClass={quant-ph cs.CC}
} | rosgen2007distinguishing |
arxiv-2118 | 0712.2605 | Some A Priori Torah Decryption Principles | <|reference_start|>Some A Priori Torah Decryption Principles: The author proposes, a priori, a simple set of principles that can be developed into a range of algorithms by which means the Torah might be decoded. It is assumed that the Torah is some form of transposition cipher with the unusual property that the plain t... | arxiv | @article{croll2007some,
title={Some A Priori Torah Decryption Principles},
author={Grenville J. Croll},
journal={Proc. ANPA Cambridge, UK, 2007},
year={2007},
archivePrefix={arXiv},
eprint={0712.2605},
primaryClass={cs.CR}
} | croll2007some |
arxiv-2119 | 0712.2606 | Algorithmic Permutation of part of the Torah | <|reference_start|>Algorithmic Permutation of part of the Torah: A small part of the Torah is arranged into a two dimensional array. The characters are then permuted using a simple recursive deterministic algorithm. The various permutations are then passed through three stochastic filters and one deterministic filter t... | arxiv | @article{croll2007algorithmic,
title={Algorithmic Permutation of part of the Torah},
author={Grenville J. Croll},
journal={Proc. ANPA 27, Wesley College, Cambridge, UK, September 2005},
year={2007},
archivePrefix={arXiv},
eprint={0712.2606},
primaryClass={cs.CR}
} | croll2007algorithmic |
arxiv-2120 | 0712.2619 | A New Lower Bound for A(17,6,6) | <|reference_start|>A New Lower Bound for A(17,6,6): We construct a record-breaking binary code of length 17, minimal distance 6, constant weight 6, and containing 113 codewords.<|reference_end|> | arxiv | @article{chee2007a,
title={A New Lower Bound for A(17,6,6)},
author={Yeow Meng Chee},
journal={Ars Combinatoria, Vol. 83, pp. 361-363, 2007},
year={2007},
archivePrefix={arXiv},
eprint={0712.2619},
primaryClass={cs.IT cs.DM math.CO math.IT}
} | chee2007a |
arxiv-2121 | 0712.2629 | Approximation Algorithms for the Highway Problem under the Coupon Model | <|reference_start|>Approximation Algorithms for the Highway Problem under the Coupon Model: When a store sells items to customers, the store wishes to determine the prices of the items to maximize its profit. Intuitively, if the store sells the items with low (resp. high) prices, the customers buy more (resp. less) ite... | arxiv | @article{hamane2007approximation,
title={Approximation Algorithms for the Highway Problem under the Coupon Model},
author={Ryoso Hamane, Toshiya Itoh, and Kouhei Tomita},
journal={IEICE Trans. on Fundamentals, E92-A(8), pp.1779-1786, 2009},
year={2007},
doi={10.1587/transfun.E92.A.1779},
archive... | hamane2007approximation |
arxiv-2122 | 0712.2630 | Evolving XSLT stylesheets | <|reference_start|>Evolving XSLT stylesheets: This paper introduces a procedure based on genetic programming to evolve XSLT programs (usually called stylesheets or logicsheets). XSLT is a general purpose, document-oriented functional language, generally used to transform XML documents (or, in general, solve any problem... | arxiv | @article{zorzano2007evolving,
title={Evolving XSLT stylesheets},
author={Nestor Zorzano, Daniel Merino, J.L.J. Laredo, J.P. Sevilla, Pablo
Garcia, J.J. Merelo},
journal={arXiv preprint arXiv:0712.2630},
year={2007},
archivePrefix={arXiv},
eprint={0712.2630},
primaryClass={cs.NE cs.PL}
} | zorzano2007evolving |
arxiv-2123 | 0712.2638 | Towards Persistence-Based Reconstruction in Euclidean Spaces | <|reference_start|>Towards Persistence-Based Reconstruction in Euclidean Spaces: Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recently, significant improvements were made in higher dimensions, leading to new methods to reconstruct large classes ... | arxiv | @article{chazal2007towards,
title={Towards Persistence-Based Reconstruction in Euclidean Spaces},
author={Fr'ed'eric Chazal (INRIA Sophia Antipolis), Steve Oudot (INRIA
Sophia Antipolis)},
journal={arXiv preprint arXiv:0712.2638},
year={2007},
archivePrefix={arXiv},
eprint={0712.2638},
pri... | chazal2007towards |
arxiv-2124 | 0712.2640 | Optimal Memoryless Encoding for Low Power Off-Chip Data Buses | <|reference_start|>Optimal Memoryless Encoding for Low Power Off-Chip Data Buses: Off-chip buses account for a significant portion of the total system power consumed in embedded systems. Bus encoding schemes have been proposed to minimize power dissipation, but none has been demonstrated to be optimal with respect to a... | arxiv | @article{chee2007optimal,
title={Optimal Memoryless Encoding for Low Power Off-Chip Data Buses},
author={Yeow Meng Chee, Charles J. Colbourn, and Alan C. H. Ling},
journal={arXiv preprint arXiv:0712.2640},
year={2007},
doi={10.1145/1233501.1233575},
archivePrefix={arXiv},
eprint={0712.2640},... | chee2007optimal |
arxiv-2125 | 0712.2643 | Changing Levels of Description in a Fluid Flow Simulation | <|reference_start|>Changing Levels of Description in a Fluid Flow Simulation: We describe here our perception of complex systems, of how we feel the different layers of description are important part of a correct complex system simulation. We describe a rough models categorization between rules based and law based, of ... | arxiv | @article{tranouez2007changing,
title={Changing Levels of Description in a Fluid Flow Simulation},
author={Pierrick Tranouez (LITIS), Cyrille Bertelle (LITIS), Damien Olivier
(LITIS)},
journal={Emergent Properties in Natural and Artificial Dynamical Systems,
Springer (Ed.) (2006) 87-99},
year={2007},... | tranouez2007changing |
arxiv-2126 | 0712.2644 | Automata-based Adaptive Behavior for Economical Modelling Using Game Theory | <|reference_start|>Automata-based Adaptive Behavior for Economical Modelling Using Game Theory: In this chapter, we deal with some specific domains of applications to game theory. This is one of the major class of models in the new approaches of modelling in the economic domain. For that, we use genetic automata which ... | arxiv | @article{ghnemat2007automata-based,
title={Automata-based Adaptive Behavior for Economical Modelling Using Game
Theory},
author={Rawan Ghnemat (LITIS), Saleh Oqeili (IT), Cyrille Bertelle (LITIS),
G'erard Henry Edmond Duchamp (LIPN)},
journal={Emergent Properties in Natural and Artificial Dynamical Syst... | ghnemat2007automata-based |
arxiv-2127 | 0712.2661 | Algorithms for Generating Convex Sets in Acyclic Digraphs | <|reference_start|>Algorithms for Generating Convex Sets in Acyclic Digraphs: A set $X$ of vertices of an acyclic digraph $D$ is convex if $X\neq \emptyset$ and there is no directed path between vertices of $X$ which contains a vertex not in $X$. A set $X$ is connected if $X\neq \emptyset$ and the underlying undirected... | arxiv | @article{balister2007algorithms,
title={Algorithms for Generating Convex Sets in Acyclic Digraphs},
author={P. Balister, S. Gerke, G. Gutin, A. Johnstone, J. Reddington, E.
Scott, A. Soleimanfallah, A. Yeo},
journal={arXiv preprint arXiv:0712.2661},
year={2007},
archivePrefix={arXiv},
eprint={... | balister2007algorithms |
arxiv-2128 | 0712.2671 | On the equations of the moving curve ideal of a rational algebraic plane curve | <|reference_start|>On the equations of the moving curve ideal of a rational algebraic plane curve: Given a parametrization of a rational plane algebraic curve C, some explicit adjoint pencils on C are described in terms of determinants. Moreover, some generators of the Rees algebra associated to this parametrization ar... | arxiv | @article{busé2007on,
title={On the equations of the moving curve ideal of a rational algebraic plane
curve},
author={Laurent Bus'e (INRIA Sophia Antipolis)},
journal={arXiv preprint arXiv:0712.2671},
year={2007},
archivePrefix={arXiv},
eprint={0712.2671},
primaryClass={math.AG cs.SC math.A... | busé2007on |
arxiv-2129 | 0712.2678 | Convex sets in acyclic digraphs | <|reference_start|>Convex sets in acyclic digraphs: A non-empty set $X$ of vertices of an acyclic digraph is called connected if the underlying undirected graph induced by $X$ is connected and it is called convex if no two vertices of $X$ are connected by a directed path in which some vertices are not in $X$. The set o... | arxiv | @article{balister2007convex,
title={Convex sets in acyclic digraphs},
author={P. Balister, S. Gerke, G. Gutin},
journal={arXiv preprint arXiv:0712.2678},
year={2007},
archivePrefix={arXiv},
eprint={0712.2678},
primaryClass={cs.DM}
} | balister2007convex |
arxiv-2130 | 0712.2682 | An Approximation Ratio for Biclustering | <|reference_start|>An Approximation Ratio for Biclustering: The problem of biclustering consists of the simultaneous clustering of rows and columns of a matrix such that each of the submatrices induced by a pair of row and column clusters is as uniform as possible. In this paper we approximate the optimal biclustering ... | arxiv | @article{puolamäki2007an,
title={An Approximation Ratio for Biclustering},
author={Kai Puolam"aki, Sami Hanhij"arvi, Gemma C. Garriga},
journal={Information Processing Letters 108 (2008) 45-49},
year={2007},
doi={10.1016/j.ipl.2008.03.013},
number={Publications in Computer and Information Scienc... | puolamäki2007an |
arxiv-2131 | 0712.2684 | An Economic Model of Coupled Exponential Maps | <|reference_start|>An Economic Model of Coupled Exponential Maps: In this work, an ensemble of economic interacting agents is considered. The agents are arranged in a linear array where only local couplings are allowed. The deterministic dynamics of each agent is given by a map. This map is expressed by two factors. Th... | arxiv | @article{lopez-ruiz2007an,
title={An Economic Model of Coupled Exponential Maps},
author={R. Lopez-Ruiz, J. Gonzalez-Estevez, M.G. Cosenza, and J.R. Sanchez},
journal={arXiv preprint arXiv:0712.2684},
year={2007},
archivePrefix={arXiv},
eprint={0712.2684},
primaryClass={q-fin.GN cs.MA nlin.A... | lopez-ruiz2007an |
arxiv-2132 | 0712.2737 | Experiments with a Convex Polyhedral Analysis Tool for Logic Programs | <|reference_start|>Experiments with a Convex Polyhedral Analysis Tool for Logic Programs: Convex polyhedral abstractions of logic programs have been found very useful in deriving numeric relationships between program arguments in order to prove program properties and in other areas such as termination and complexity an... | arxiv | @article{henriksen2007experiments,
title={Experiments with a Convex Polyhedral Analysis Tool for Logic Programs},
author={Kim Henriksen, Gourinath Banda, John Gallagher},
journal={arXiv preprint arXiv:0712.2737},
year={2007},
archivePrefix={arXiv},
eprint={0712.2737},
primaryClass={cs.PL cs.... | henriksen2007experiments |
arxiv-2133 | 0712.2773 | Middleware-based Database Replication: The Gaps between Theory and Practice | <|reference_start|>Middleware-based Database Replication: The Gaps between Theory and Practice: The need for high availability and performance in data management systems has been fueling a long running interest in database replication from both academia and industry. However, academic groups often attack replication pr... | arxiv | @article{cecchet2007middleware-based,
title={Middleware-based Database Replication: The Gaps between Theory and
Practice},
author={Emmanuel Cecchet, George Candea, Anastasia Ailamaki},
journal={arXiv preprint arXiv:0712.2773},
year={2007},
number={EPFL technical report DSLAB-REPORT-2007-001},
... | cecchet2007middleware-based |
arxiv-2134 | 0712.2789 | Trading in Risk Dimensions (TRD) | <|reference_start|>Trading in Risk Dimensions (TRD): Previous work, mostly published, developed two-shell recursive trading systems. An inner-shell of Canonical Momenta Indicators (CMI) is adaptively fit to incoming market data. A parameterized trading-rule outer-shell uses the global optimization code Adaptive Simulat... | arxiv | @article{ingber2007trading,
title={Trading in Risk Dimensions (TRD)},
author={Lester Ingber},
journal={arXiv preprint arXiv:0712.2789},
year={2007},
archivePrefix={arXiv},
eprint={0712.2789},
primaryClass={cs.CE cs.NA}
} | ingber2007trading |
arxiv-2135 | 0712.2857 | Single-Exclusion Number and the Stopping Redundancy of MDS Codes | <|reference_start|>Single-Exclusion Number and the Stopping Redundancy of MDS Codes: For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smaller than the minimum distance of C. Schwartz and Vardy conj... | arxiv | @article{han2007single-exclusion,
title={Single-Exclusion Number and the Stopping Redundancy of MDS Codes},
author={Junsheng Han, Paul H. Siegel and Ron M. Roth},
journal={arXiv preprint arXiv:0712.2857},
year={2007},
doi={10.1109/TIT.2009.2025578},
archivePrefix={arXiv},
eprint={0712.2857},... | han2007single-exclusion |
arxiv-2136 | 0712.2869 | Density estimation in linear time | <|reference_start|>Density estimation in linear time: We consider the problem of choosing a density estimate from a set of distributions F, minimizing the L1-distance to an unknown distribution (Devroye, Lugosi 2001). Devroye and Lugosi analyze two algorithms for the problem: Scheffe tournament winner and minimum dista... | arxiv | @article{mahalanabis2007density,
title={Density estimation in linear time},
author={Satyaki Mahalanabis, Daniel Stefankovic},
journal={arXiv preprint arXiv:0712.2869},
year={2007},
archivePrefix={arXiv},
eprint={0712.2869},
primaryClass={cs.LG}
} | mahalanabis2007density |
arxiv-2137 | 0712.2870 | The source coding game with a cheating switcher | <|reference_start|>The source coding game with a cheating switcher: Motivated by the lossy compression of an active-vision video stream, we consider the problem of finding the rate-distortion function of an arbitrarily varying source (AVS) composed of a finite number of subsources with known distributions. Berger's pap... | arxiv | @article{palaiyanur2007the,
title={The source coding game with a cheating switcher},
author={Hari Palaiyanur, Cheng Chang and Anant Sahai},
journal={arXiv preprint arXiv:0712.2870},
year={2007},
number={EECS-2007-155},
archivePrefix={arXiv},
eprint={0712.2870},
primaryClass={cs.IT cs.CV ... | palaiyanur2007the |
arxiv-2138 | 0712.2872 | Low SNR Capacity of Noncoherent Fading Channels | <|reference_start|>Low SNR Capacity of Noncoherent Fading Channels: Discrete-time Rayleigh fading single-input single-output (SISO) and multiple-input multiple-output (MIMO) channels are considered, with no channel state information at the transmitter or the receiver. The fading is assumed to be stationary and correlat... | arxiv | @article{sethuraman2007low,
title={Low SNR Capacity of Noncoherent Fading Channels},
author={Vignesh Sethuraman, Ligong Wang, Bruce Hajek and Amos Lapidoth},
journal={arXiv preprint arXiv:0712.2872},
year={2007},
doi={10.1109/TIT.2009.2012995},
archivePrefix={arXiv},
eprint={0712.2872},
... | sethuraman2007low |
arxiv-2139 | 0712.2923 | A Class of LULU Operators on Multi-Dimensional Arrays | <|reference_start|>A Class of LULU Operators on Multi-Dimensional Arrays: The LULU operators for sequences are extended to multi-dimensional arrays via the morphological concept of connection in a way which preserves their essential properties, e.g. they are separators and form a four element fully ordered semi-group. ... | arxiv | @article{anguelov2007a,
title={A Class of LULU Operators on Multi-Dimensional Arrays},
author={Roumen Anguelov, Inger Plaskitt},
journal={arXiv preprint arXiv:0712.2923},
year={2007},
archivePrefix={arXiv},
eprint={0712.2923},
primaryClass={cs.CV}
} | anguelov2007a |
arxiv-2140 | 0712.2943 | Software (Re-)Engineering with PSF | <|reference_start|>Software (Re-)Engineering with PSF: This paper investigates the usefulness of PSF in software engineering and reengineering. PSF is based on ACP (Algebra of Communicating Processes) and as some architectural description languages are based on process algebra, we investigate whether PSF can be used at... | arxiv | @article{diertens2007software,
title={Software (Re-)Engineering with PSF},
author={Bob Diertens},
journal={arXiv preprint arXiv:0712.2943},
year={2007},
number={PRG0505},
archivePrefix={arXiv},
eprint={0712.2943},
primaryClass={cs.SE}
} | diertens2007software |
arxiv-2141 | 0712.2952 | Partial Conway and iteration semirings | <|reference_start|>Partial Conway and iteration semirings: A Conway semiring is a semiring $S$ equipped with a unary operation $^*:S \to S$, always called 'star', satisfying the sum star and product star identities. It is known that these identities imply a Kleene type theorem. Some computationally important semirings,... | arxiv | @article{bloom2007partial,
title={Partial Conway and iteration semirings},
author={S. L. Bloom, Z. Esik, W. Kuich},
journal={arXiv preprint arXiv:0712.2952},
year={2007},
archivePrefix={arXiv},
eprint={0712.2952},
primaryClass={cs.DM cs.LO}
} | bloom2007partial |
arxiv-2142 | 0712.2958 | Power-Aware Real-Time Scheduling upon Identical Multiprocessor Platforms | <|reference_start|>Power-Aware Real-Time Scheduling upon Identical Multiprocessor Platforms: In this paper, we address the power-aware scheduling of sporadic constrained-deadline hard real-time tasks using dynamic voltage scaling upon multiprocessor platforms. We propose two distinct algorithms. Our first algorithm is ... | arxiv | @article{nélis2007power-aware,
title={Power-Aware Real-Time Scheduling upon Identical Multiprocessor Platforms},
author={Vincent N'elis, Jo"el Goossens, Nicolas Navet, Raymond Devillers and
Dragomir Milojevic},
journal={arXiv preprint arXiv:0712.2958},
year={2007},
archivePrefix={arXiv},
eprin... | nélis2007power-aware |
arxiv-2143 | 0712.2959 | Joint Source-Channel Coding Revisited: Information-Spectrum Approach | <|reference_start|>Joint Source-Channel Coding Revisited: Information-Spectrum Approach: Given a general source with countably infinite source alphabet and a general channel with arbitrary abstract channel input/channel output alphabets, we study the joint source-channel coding problem from the information-spectrum poi... | arxiv | @article{han2007joint,
title={Joint Source-Channel Coding Revisited: Information-Spectrum Approach},
author={Te Sun Han},
journal={arXiv preprint arXiv:0712.2959},
year={2007},
archivePrefix={arXiv},
eprint={0712.2959},
primaryClass={cs.IT math.IT}
} | han2007joint |
arxiv-2144 | 0712.3037 | Comments on "Improved Efficient Remote User Authentication Schemes" | <|reference_start|>Comments on "Improved Efficient Remote User Authentication Schemes": Recently, Tian et al presented an article, in which they discussed some security weaknesses of Yoon et al's scheme and subsequently proposed two ``improved'' schemes. In this paper, we show that the Tian et al's schemes are insecure... | arxiv | @article{das2007comments,
title={Comments on "Improved Efficient Remote User Authentication Schemes"},
author={Manik Lal Das},
journal={International Journal of Network Security, Vol. 6, No. 3, pp.
282-284, 2008},
year={2007},
archivePrefix={arXiv},
eprint={0712.3037},
primaryClass={cs.CR}... | das2007comments |
arxiv-2145 | 0712.3084 | Proxy Signature Scheme with Effective Revocation Using Bilinear Pairings | <|reference_start|>Proxy Signature Scheme with Effective Revocation Using Bilinear Pairings: We present a proxy signature scheme using bilinear pairings that provides effective proxy revocation. The scheme uses a binding-blinding technique to avoid secure channel requirements in the key issuance stage. With this techni... | arxiv | @article{das2007proxy,
title={Proxy Signature Scheme with Effective Revocation Using Bilinear Pairings},
author={Manik Lal Das, Ashutosh Saxena, Deepak B Phatak},
journal={International Journal of Network Security, Vol. 4, No.3,
pp.312-317, 2007},
year={2007},
archivePrefix={arXiv},
eprint={07... | das2007proxy |
arxiv-2146 | 0712.3088 | Clones and Genoids in Lambda Calculus and First Order Logic | <|reference_start|>Clones and Genoids in Lambda Calculus and First Order Logic: A genoid is a category of two objects such that one is the product of itself with the other. A genoid may be viewed as an abstract substitution algebra. It is a remarkable fact that such a simple concept can be applied to present a unified ... | arxiv | @article{luo2007clones,
title={Clones and Genoids in Lambda Calculus and First Order Logic},
author={Zhaohua Luo},
journal={arXiv preprint arXiv:0712.3088},
year={2007},
archivePrefix={arXiv},
eprint={0712.3088},
primaryClass={cs.LO cs.PL}
} | luo2007clones |
arxiv-2147 | 0712.3113 | Optimizing Queries in a Logic-based Information Integration System | <|reference_start|>Optimizing Queries in a Logic-based Information Integration System: The SINTAGMA information integration system is an infrastructure for accessing several different information sources together. Besides providing a uniform interface to the information sources (databases, web services, web sites, RDF ... | arxiv | @article{békés2007optimizing,
title={Optimizing Queries in a Logic-based Information Integration System},
author={Andr'as Gyorgy B'ek'es, P'eter Szeredi},
journal={arXiv preprint arXiv:0712.3113},
year={2007},
archivePrefix={arXiv},
eprint={0712.3113},
primaryClass={cs.PL cs.SE}
} | békés2007optimizing |
arxiv-2148 | 0712.3115 | Software (Re-)Engineering with PSF II: from architecture to implementation | <|reference_start|>Software (Re-)Engineering with PSF II: from architecture to implementation: This paper presents ongoing research on the application of PSF in the field of software engineering and reengineering. We build a new implementation for the simulator of the PSF Toolkit starting from the specification in PSF ... | arxiv | @article{diertens2007software,
title={Software (Re-)Engineering with PSF II: from architecture to
implementation},
author={Bob Diertens},
journal={arXiv preprint arXiv:0712.3115},
year={2007},
number={prg0609},
archivePrefix={arXiv},
eprint={0712.3115},
primaryClass={cs.SE}
} | diertens2007software |
arxiv-2149 | 0712.3116 | Proceedings of the 17th Workshop on Logic-based methods in Programming Environments (WLPE 2007) | <|reference_start|>Proceedings of the 17th Workshop on Logic-based methods in Programming Environments (WLPE 2007): This volume contains the papers presented at WLPE 2007: the 17th Workshop on Logic-based Methods in Programming Environments on 13th September, 2007 in Porto, Portugal. It was held as a satellite workshop... | arxiv | @article{hill2007proceedings,
title={Proceedings of the 17th Workshop on Logic-based methods in Programming
Environments (WLPE 2007)},
author={Patricia Hill, Wim Vanhoof},
journal={arXiv preprint arXiv:0712.3116},
year={2007},
archivePrefix={arXiv},
eprint={0712.3116},
primaryClass={cs.PL ... | hill2007proceedings |
arxiv-2150 | 0712.3128 | Software (Re-)Engineering with PSF III: an IDE for PSF | <|reference_start|>Software (Re-)Engineering with PSF III: an IDE for PSF: We describe the design of an integrated development environment (IDE) for PSF. In the software engineering process we used process algebra in the form of PSF for the specification of the architecture of the IDE. This specification is refined to ... | arxiv | @article{diertens2007software,
title={Software (Re-)Engineering with PSF III: an IDE for PSF},
author={Bob Diertens},
journal={arXiv preprint arXiv:0712.3128},
year={2007},
number={prg0708},
archivePrefix={arXiv},
eprint={0712.3128},
primaryClass={cs.SE}
} | diertens2007software |
arxiv-2151 | 0712.3137 | Phase transition and computational complexity in a stochastic prime number generator | <|reference_start|>Phase transition and computational complexity in a stochastic prime number generator: We introduce a prime number generator in the form of a stochastic algorithm. The character of such algorithm gives rise to a continuous phase transition which distinguishes a phase where the algorithm is able to red... | arxiv | @article{lacasa2007phase,
title={Phase transition and computational complexity in a stochastic prime
number generator},
author={Lucas Lacasa, Bartolo Luque, Octavio Miramontes},
journal={New Journal of Physics 10 (2008) 023009},
year={2007},
doi={10.1088/1367-2630/10/2/023009},
archivePrefix={... | lacasa2007phase |
arxiv-2152 | 0712.3146 | Dynamic Logic of Common Knowledge in a Proof Assistant | <|reference_start|>Dynamic Logic of Common Knowledge in a Proof Assistant: Common Knowledge Logic is meant to describe situations of the real world where a group of agents is involved. These agents share knowledge and make strong statements on the knowledge of the other agents (the so called \emph{common knowledge}). B... | arxiv | @article{lescanne2007dynamic,
title={Dynamic Logic of Common Knowledge in a Proof Assistant},
author={Pierre Lescanne (LIP), J'er^ome Puiss'egur (LIP)},
journal={arXiv preprint arXiv:0712.3146},
year={2007},
archivePrefix={arXiv},
eprint={0712.3146},
primaryClass={cs.GT}
} | lescanne2007dynamic |
arxiv-2153 | 0712.3147 | Common knowledge logic in a higher order proof assistant? | <|reference_start|>Common knowledge logic in a higher order proof assistant?: This paper presents experiments on common knowledge logic, conducted with the help of the proof assistant Coq. The main feature of common knowledge logic is the eponymous modality that says that a group of agents shares a knowledge about a ce... | arxiv | @article{lescanne2007common,
title={Common knowledge logic in a higher order proof assistant?},
author={Pierre Lescanne (LIP)},
journal={arXiv preprint arXiv:0712.3147},
year={2007},
archivePrefix={arXiv},
eprint={0712.3147},
primaryClass={cs.AI cs.LO}
} | lescanne2007common |
arxiv-2154 | 0712.3150 | Interval Colourings of Some Regular Graphs | <|reference_start|>Interval Colourings of Some Regular Graphs: A lower bound is obtained for the greatest possible number of colors in an interval colourings of some regular graphs.<|reference_end|> | arxiv | @article{kamalian2007interval,
title={Interval Colourings of Some Regular Graphs},
author={Rafael R. Kamalian and Petros A. Petrosyan},
journal={Mathematical Problems of Computer Science 25, 2006, 53--56},
year={2007},
archivePrefix={arXiv},
eprint={0712.3150},
primaryClass={cs.DM}
} | kamalian2007interval |
arxiv-2155 | 0712.3155 | On Interval Colorings of Complete k-partite Graphs K_n^k | <|reference_start|>On Interval Colorings of Complete k-partite Graphs K_n^k: Problems of existence, construction and estimation of parameters of interval colorings of complete k-partite graphs K_{n}^{k} are investigated.<|reference_end|> | arxiv | @article{kamalian2007on,
title={On Interval Colorings of Complete k-partite Graphs K_{n}^{k}},
author={Rafael R. Kamalian and Petros A. Petrosyan},
journal={Mathematical Problems of Computer Science 26, 2006, 28--32},
year={2007},
archivePrefix={arXiv},
eprint={0712.3155},
primaryClass={cs.D... | kamalian2007on |
arxiv-2156 | 0712.3203 | Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach | <|reference_start|>Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach: The subset sum problem (SSP) can be briefly stated as: given a target integer $E$ and a set $A$ containing $n$ positive integer $a_j$, find a subset of $A$ summing to $E$. The \textit{density} $d$ of an S... | arxiv | @article{wan2007solving,
title={Solving Medium-Density Subset Sum Problems in Expected Polynomial Time:
An Enumeration Approach},
author={Changlin Wan, Zhongzhi Shi},
journal={Changlin Wan, Zhongzhi Shi: Solving Medium-Density Subset Sum
Problems in Expected Polynomial Time: An Enumeration Approach. FAW... | wan2007solving |
arxiv-2157 | 0712.3215 | L'accessibilit\'e des E-services aux personnes non-voyantes : difficult\'es d'usage et recommandations | <|reference_start|>L'accessibilit\'e des E-services aux personnes non-voyantes : difficult\'es d'usage et recommandations: While taking into account handicapped people in the design of technologies represents a social and political stake that becomes important (in particular with the recent law on equal rights for all ... | arxiv | @article{sandoz-guermond2007l'accessibilit\'e,
title={L'accessibilit\'e des E-services aux personnes non-voyantes :
difficult\'es d'usage et recommandations},
author={Franc{c}oise Sandoz-Guermond (LIESP), Marc-Eric Bobiller-Chaumon
(GRePS)},
journal={Dans International Conference Proceedings of IHM'2006... | sandoz-guermond2007l'accessibilit\'e |
arxiv-2158 | 0712.3220 | What is Community Informatics (and Why Does It Matter)? | <|reference_start|>What is Community Informatics (and Why Does It Matter)?: Community Informatics (CI) is the application of information and communications technologies (ICTs) to enable community processes and the achievement of community objectives. CI goes beyond the "Digital Divide" to making ICT access usable and u... | arxiv | @article{gurstein2007what,
title={What is Community Informatics (and Why Does It Matter)?},
author={Michael Gurstein},
journal={"Publishing studies" book series, edited by Giandomenico Sica,
ISSN 1973-6061 (Printed edition), ISSN 1973-6053 (Electronic edition)},
year={2007},
archivePrefix={arXiv},... | gurstein2007what |
arxiv-2159 | 0712.3277 | On the Capacity and Energy Efficiency of Training-Based Transmissions over Fading Channels | <|reference_start|>On the Capacity and Energy Efficiency of Training-Based Transmissions over Fading Channels: In this paper, the capacity and energy efficiency of training-based communication schemes employed for transmission over a-priori unknown Rayleigh block fading channels are studied. In these schemes, periodica... | arxiv | @article{gursoy2007on,
title={On the Capacity and Energy Efficiency of Training-Based Transmissions
over Fading Channels},
author={Mustafa Cenk Gursoy},
journal={arXiv preprint arXiv:0712.3277},
year={2007},
archivePrefix={arXiv},
eprint={0712.3277},
primaryClass={cs.IT math.IT}
} | gursoy2007on |
arxiv-2160 | 0712.3286 | Error Rate Analysis for Peaky Signaling over Fading Channels | <|reference_start|>Error Rate Analysis for Peaky Signaling over Fading Channels: In this paper, the performance of signaling strategies with high peak-to-average power ratio is analyzed over both coherent and noncoherent fading channels. Two modulation schemes, namely on-off phase-shift keying (OOPSK) and on-off freque... | arxiv | @article{gursoy2007error,
title={Error Rate Analysis for Peaky Signaling over Fading Channels},
author={Mustafa Cenk Gursoy},
journal={arXiv preprint arXiv:0712.3286},
year={2007},
archivePrefix={arXiv},
eprint={0712.3286},
primaryClass={cs.IT math.IT}
} | gursoy2007error |
arxiv-2161 | 0712.3298 | CLAIRLIB Documentation v103 | <|reference_start|>CLAIRLIB Documentation v103: The Clair library is intended to simplify a number of generic tasks in Natural Language Processing (NLP), Information Retrieval (IR), and Network Analysis. Its architecture also allows for external software to be plugged in with very little effort. Functionality native to... | arxiv | @article{radev2007clairlib,
title={CLAIRLIB Documentation v1.03},
author={Dragomir Radev, Mark Hodges, Anthony Fader, Mark Joseph, Joshua
Gerrish, Mark Schaller, Jonathan dePeri, Bryan Gibson},
journal={arXiv preprint arXiv:0712.3298},
year={2007},
number={CSE-TR-536-07},
archivePrefix={arXiv}... | radev2007clairlib |
arxiv-2162 | 0712.3299 | Computer- and robot-assisted urological surgery | <|reference_start|>Computer- and robot-assisted urological surgery: The author reviews the computer and robotic tools available to urologists to help in diagnosis and technical procedures. The first part concerns the contribution of robotics and presents several systems at various stages of development (laboratory prot... | arxiv | @article{troccaz2007computer-,
title={Computer- and robot-assisted urological surgery},
author={Jocelyne Troccaz (TIMC)},
journal={Progr\`es en urologie : journal de l'Association fran\c{c}aise
d'urologie et de la Soci\'et\'e fran\c{c}aise d'urologie 16, 2 (2006) 112-20},
year={2007},
archivePrefi... | troccaz2007computer- |
arxiv-2163 | 0712.3327 | The capacity of a class of 3-receiver broadcast channels with degraded message sets | <|reference_start|>The capacity of a class of 3-receiver broadcast channels with degraded message sets: Korner and Marton established the capacity region for the 2-receiver broadcast channel with degraded message sets. Recent results and conjectures suggest that a straightforward extension of the Korner-Marton region t... | arxiv | @article{nair2007the,
title={The capacity of a class of 3-receiver broadcast channels with degraded
message sets},
author={Chandra Nair and Abbas El Gamal},
journal={arXiv preprint arXiv:0712.3327},
year={2007},
archivePrefix={arXiv},
eprint={0712.3327},
primaryClass={cs.IT math.IT}
} | nair2007the |
arxiv-2164 | 0712.3329 | Universal Intelligence: A Definition of Machine Intelligence | <|reference_start|>Universal Intelligence: A Definition of Machine Intelligence: A fundamental problem in artificial intelligence is that nobody really knows what intelligence is. The problem is especially acute when we need to consider artificial systems which are significantly different to humans. In this paper we ap... | arxiv | @article{legg2007universal,
title={Universal Intelligence: A Definition of Machine Intelligence},
author={Shane Legg and Marcus Hutter},
journal={Minds & Machines, 17:4 (2007) pages 391-444},
year={2007},
number={IDSIA-10-07},
archivePrefix={arXiv},
eprint={0712.3329},
primaryClass={cs.A... | legg2007universal |
arxiv-2165 | 0712.3331 | How to Complete a Doubling Metric | <|reference_start|>How to Complete a Doubling Metric: In recent years, considerable advances have been made in the study of properties of metric spaces in terms of their doubling dimension. This line of research has not only enhanced our understanding of finite metrics, but has also resulted in many algorithmic applica... | arxiv | @article{gupta2007how,
title={How to Complete a Doubling Metric},
author={Anupam Gupta and Kunal Talwar},
journal={arXiv preprint arXiv:0712.3331},
year={2007},
archivePrefix={arXiv},
eprint={0712.3331},
primaryClass={cs.DM cs.CG}
} | gupta2007how |
arxiv-2166 | 0712.3333 | On the approximability of the vertex cover and related problems | <|reference_start|>On the approximability of the vertex cover and related problems: In this paper we show that the problem of identifying an edge $(i,j)$ in a graph $G$ such that there exists an optimal vertex cover $S$ of $G$ containing exactly one of the nodes $i$ and $j$ is NP-hard. Such an edge is called a weak edg... | arxiv | @article{han2007on,
title={On the approximability of the vertex cover and related problems},
author={Qiaoming Han and Abraham P. Punnen},
journal={arXiv preprint arXiv:0712.3333},
year={2007},
archivePrefix={arXiv},
eprint={0712.3333},
primaryClass={cs.DS cs.DM}
} | han2007on |
arxiv-2167 | 0712.3335 | A polynomial time $\frac 3 2$ -approximation algorithm for the vertex cover problem on a class of graphs | <|reference_start|>A polynomial time $\frac 3 2$ -approximation algorithm for the vertex cover problem on a class of graphs: We develop a polynomial time 3/2-approximation algorithm to solve the vertex cover problem on a class of graphs satisfying a property called ``active edge hypothesis''. The algorithm also guarant... | arxiv | @article{han2007a,
title={A polynomial time $\frac 3 2$ -approximation algorithm for the vertex
cover problem on a class of graphs},
author={Qiaoming Han, Abraham P. Punnen, and Yinyu Ye},
journal={arXiv preprint arXiv:0712.3335},
year={2007},
archivePrefix={arXiv},
eprint={0712.3335},
pri... | han2007a |
arxiv-2168 | 0712.3348 | On Exponential Time Lower Bound of Knapsack under Backtracking | <|reference_start|>On Exponential Time Lower Bound of Knapsack under Backtracking: M.Aleknovich et al. have recently proposed a model of algorithms, called BT model, which generalizes both the priority model of Borodin, Nielson and Rackoff, as well as a simple dynamic programming model by Woeginger. BT model can be fur... | arxiv | @article{li2007on,
title={On Exponential Time Lower Bound of Knapsack under Backtracking},
author={Xin Li, Tian Liu},
journal={arXiv preprint arXiv:0712.3348},
year={2007},
archivePrefix={arXiv},
eprint={0712.3348},
primaryClass={cs.CC}
} | li2007on |
arxiv-2169 | 0712.3360 | Compressed Text Indexes:From Theory to Practice! | <|reference_start|>Compressed Text Indexes:From Theory to Practice!: A compressed full-text self-index represents a text in a compressed form and still answers queries efficiently. This technology represents a breakthrough over the text indexing techniques of the previous decade, whose indexes required several times th... | arxiv | @article{ferragina2007compressed,
title={Compressed Text Indexes:From Theory to Practice!},
author={Paolo Ferragina (1), Rodrigo Gonzalez (2), Gonzalo Navarro (2),
Rossano Venturini (2) ((1) Dept. of Computer Science, University of Pisa, (2)
Dept. of Computer Science, University of Chile)},
journal={arX... | ferragina2007compressed |
arxiv-2170 | 0712.3380 | Extending the Overlap Graph for Gene Assembly in Ciliates | <|reference_start|>Extending the Overlap Graph for Gene Assembly in Ciliates: Gene assembly is an intricate biological process that has been studied formally and modeled through string and graph rewriting systems. Recently, a restriction of the general (intramolecular) model, called simple gene assembly, has been intro... | arxiv | @article{brijder2007extending,
title={Extending the Overlap Graph for Gene Assembly in Ciliates},
author={Robert Brijder, Hendrik Jan Hoogeboom},
journal={arXiv preprint arXiv:0712.3380},
year={2007},
number={LIACS Technical Report 2007-05},
archivePrefix={arXiv},
eprint={0712.3380},
pri... | brijder2007extending |
arxiv-2171 | 0712.3389 | RZBENCH: Performance evaluation of current HPC architectures using low-level and application benchmarks | <|reference_start|>RZBENCH: Performance evaluation of current HPC architectures using low-level and application benchmarks: RZBENCH is a benchmark suite that was specifically developed to reflect the requirements of scientific supercomputer users at the University of Erlangen-Nuremberg (FAU). It comprises a number of a... | arxiv | @article{hager2007rzbench:,
title={RZBENCH: Performance evaluation of current HPC architectures using
low-level and application benchmarks},
author={Georg Hager, Holger Stengel, Thomas Zeiser, Gerhard Wellein},
journal={arXiv preprint arXiv:0712.3389},
year={2007},
archivePrefix={arXiv},
eprin... | hager2007rzbench: |
arxiv-2172 | 0712.3402 | Graph kernels between point clouds | <|reference_start|>Graph kernels between point clouds: Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and practical constraints associated with point clouds in computer vision and graphics. In th... | arxiv | @article{bach2007graph,
title={Graph kernels between point clouds},
author={Francis Bach (WILLOW Project - Inria/Ens)},
journal={arXiv preprint arXiv:0712.3402},
year={2007},
archivePrefix={arXiv},
eprint={0712.3402},
primaryClass={cs.LG}
} | bach2007graph |
arxiv-2173 | 0712.3423 | Tuplix Calculus | <|reference_start|>Tuplix Calculus: We introduce a calculus for tuplices, which are expressions that generalize matrices and vectors. Tuplices have an underlying data type for quantities that are taken from a zero-totalized field. We start with the core tuplix calculus CTC for entries and tests, which are combined usin... | arxiv | @article{bergstra2007tuplix,
title={Tuplix Calculus},
author={J.A. Bergstra, A. Ponse, M.B. van der Zwaag},
journal={Scientific Annals of Computer Science, 18:35--61, 2008},
year={2007},
number={PRG0713},
archivePrefix={arXiv},
eprint={0712.3423},
primaryClass={cs.LO cs.CE}
} | bergstra2007tuplix |
arxiv-2174 | 0712.3433 | AccelKey Selection Method for Mobile Devices | <|reference_start|>AccelKey Selection Method for Mobile Devices: Portable Electronic Devices usually utilize a small screen with limited viewing area and a keyboard with a limited number of keys. This makes it difficult to perform quick searches in data arrays containing more than dozen items such an address book or so... | arxiv | @article{zaliva2007accelkey,
title={AccelKey Selection Method for Mobile Devices},
author={Vadim Zaliva},
journal={arXiv preprint arXiv:0712.3433},
year={2007},
archivePrefix={arXiv},
eprint={0712.3433},
primaryClass={cs.HC}
} | zaliva2007accelkey |
arxiv-2175 | 0712.3501 | The Impact of Hard-Decision Detection on the Energy Efficiency of Phase and Frequency Modulation | <|reference_start|>The Impact of Hard-Decision Detection on the Energy Efficiency of Phase and Frequency Modulation: The central design challenge in next generation wireless systems is to have these systems operate at high bandwidths and provide high data rates while being cognizant of the energy consumption levels esp... | arxiv | @article{gursoy2007the,
title={The Impact of Hard-Decision Detection on the Energy Efficiency of Phase
and Frequency Modulation},
author={Mustafa Cenk Gursoy},
journal={arXiv preprint arXiv:0712.3501},
year={2007},
doi={10.1109/TWC.2009.080998},
archivePrefix={arXiv},
eprint={0712.3501},
... | gursoy2007the |
arxiv-2176 | 0712.3568 | A Partition-Based Relaxation For Steiner Trees | <|reference_start|>A Partition-Based Relaxation For Steiner Trees: The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph G=(V,E), a set of terminals R, and non-negative costs c_e for all edges e ... | arxiv | @article{konemann2007a,
title={A Partition-Based Relaxation For Steiner Trees},
author={Jochen Konemann, David Pritchard, Kunlun Tan},
journal={arXiv preprint arXiv:0712.3568},
year={2007},
archivePrefix={arXiv},
eprint={0712.3568},
primaryClass={cs.DS}
} | konemann2007a |
arxiv-2177 | 0712.3576 | Protocols For Half-Duplex Multiple Relay Networks | <|reference_start|>Protocols For Half-Duplex Multiple Relay Networks: In this paper we present several strategies for multiple relay networks which are constrained by a half-duplex operation, i. e., each node either transmits or receives on a particular resource. Using the discrete memoryless multiple relay channel we ... | arxiv | @article{rost2007protocols,
title={Protocols For Half-Duplex Multiple Relay Networks},
author={P. Rost and G. Fettweis},
journal={arXiv preprint arXiv:0712.3576},
year={2007},
archivePrefix={arXiv},
eprint={0712.3576},
primaryClass={cs.IT math.IT}
} | rost2007protocols |
arxiv-2178 | 0712.3587 | Pattern Recognition System Design with Linear Encoding for Discrete Patterns | <|reference_start|>Pattern Recognition System Design with Linear Encoding for Discrete Patterns: In this paper, designs and analyses of compressive recognition systems are discussed, and also a method of establishing a dual connection between designs of good communication codes and designs of recognition systems is pre... | arxiv | @article{lai2007pattern,
title={Pattern Recognition System Design with Linear Encoding for Discrete
Patterns},
author={Po-Hsiang Lai and Joseph A. O'Sullivan},
journal={arXiv preprint arXiv:0712.3587},
year={2007},
archivePrefix={arXiv},
eprint={0712.3587},
primaryClass={cs.IT cs.CV math.I... | lai2007pattern |
arxiv-2179 | 0712.3617 | A Unified Framework for Pricing Credit and Equity Derivatives | <|reference_start|>A Unified Framework for Pricing Credit and Equity Derivatives: We propose a model which can be jointly calibrated to the corporate bond term structure and equity option volatility surface of the same company. Our purpose is to obtain explicit bond and equity option pricing formulas that can be calibr... | arxiv | @article{bayraktar2007a,
title={A Unified Framework for Pricing Credit and Equity Derivatives},
author={Erhan Bayraktar, Bo Yang},
journal={arXiv preprint arXiv:0712.3617},
year={2007},
archivePrefix={arXiv},
eprint={0712.3617},
primaryClass={cs.CE}
} | bayraktar2007a |
arxiv-2180 | 0712.3641 | Controlling Delay-induced Hopf bifurcation in Internet congestion control system | <|reference_start|>Controlling Delay-induced Hopf bifurcation in Internet congestion control system: This paper focuses on Hopf bifurcation control in a dual model of Internet congestion control algorithms which is modeled as a delay differential equation (DDE). By choosing communication delay as a bifurcation paramete... | arxiv | @article{ding2007controlling,
title={Controlling Delay-induced Hopf bifurcation in Internet congestion
control system},
author={Dawei Ding, Jie Zhu, Xiaoshu Luo, Yuliang Liu},
journal={arXiv preprint arXiv:0712.3641},
year={2007},
archivePrefix={arXiv},
eprint={0712.3641},
primaryClass={cs... | ding2007controlling |
arxiv-2181 | 0712.3654 | Improving the Performance of PieceWise Linear Separation Incremental Algorithms for Practical Hardware Implementations | <|reference_start|>Improving the Performance of PieceWise Linear Separation Incremental Algorithms for Practical Hardware Implementations: In this paper we shall review the common problems associated with Piecewise Linear Separation incremental algorithms. This kind of neural models yield poor performances when dealing... | arxiv | @article{de lara2007improving,
title={Improving the Performance of PieceWise Linear Separation Incremental
Algorithms for Practical Hardware Implementations},
author={Alejandro Chinea Manrique De Lara, Juan Manuel Moreno, Arostegui Jordi
Madrenas, Joan Cabestany},
journal={Biological and Artificial Comp... | de lara2007improving |
arxiv-2182 | 0712.3705 | Framework and Resources for Natural Language Parser Evaluation | <|reference_start|>Framework and Resources for Natural Language Parser Evaluation: Because of the wide variety of contemporary practices used in the automatic syntactic parsing of natural languages, it has become necessary to analyze and evaluate the strengths and weaknesses of different approaches. This research is al... | arxiv | @article{kakkonen2007framework,
title={Framework and Resources for Natural Language Parser Evaluation},
author={Tuomo Kakkonen},
journal={arXiv preprint arXiv:0712.3705},
year={2007},
number={University of Joensuu, Computer Science Dissertations 19},
archivePrefix={arXiv},
eprint={0712.3705}... | kakkonen2007framework |
arxiv-2183 | 0712.3757 | $m$-Sequences of Different Lengths with Four-Valued Cross Correlation | <|reference_start|>$m$-Sequences of Different Lengths with Four-Valued Cross Correlation: {\bf Abstract.} Considered is the distribution of the cross correlation between $m$-sequences of length $2^m-1$, where $m$ is even, and $m$-sequences of shorter length $2^{m/2}-1$. The infinite family of pairs of $m$-sequences wit... | arxiv | @article{helleseth2007$m$-sequences,
title={$m$-Sequences of Different Lengths with Four-Valued Cross Correlation},
author={Tor Helleseth and Alexander Kholosha and Aina Johanssen},
journal={arXiv preprint arXiv:0712.3757},
year={2007},
archivePrefix={arXiv},
eprint={0712.3757},
primaryClass... | helleseth2007$m$-sequences |
arxiv-2184 | 0712.3807 | Improved Collaborative Filtering Algorithm via Information Transformation | <|reference_start|>Improved Collaborative Filtering Algorithm via Information Transformation: In this paper, we propose a spreading activation approach for collaborative filtering (SA-CF). By using the opinion spreading process, the similarity between any users can be obtained. The algorithm has remarkably higher accur... | arxiv | @article{liu2007improved,
title={Improved Collaborative Filtering Algorithm via Information
Transformation},
author={Jian-Guo Liu, Bing-Hong Wang, Qiang Guo},
journal={Int. J. Mod. Phys. C 20(2), 285-293 (2009)},
year={2007},
doi={10.1142/S0129183109013613},
archivePrefix={arXiv},
eprint={... | liu2007improved |
arxiv-2185 | 0712.3823 | Multidimensional reconciliation for continuous-variable quantum key distribution | <|reference_start|>Multidimensional reconciliation for continuous-variable quantum key distribution: We propose a method for extracting an errorless secret key in a continuous-variable quantum key distribution protocol, which is based on Gaussian modulation of coherent states and homodyne detection. The crucial feature... | arxiv | @article{leverrier2007multidimensional,
title={Multidimensional reconciliation for continuous-variable quantum key
distribution},
author={Anthony Leverrier, Romain All'eaume, Joseph Boutros, Gilles Z'emor,
Philippe Grangier},
journal={Phys. Rev. A 77, 042325 (2008)},
year={2007},
doi={10.1103/Ph... | leverrier2007multidimensional |
arxiv-2186 | 0712.3825 | Tests of Machine Intelligence | <|reference_start|>Tests of Machine Intelligence: Although the definition and measurement of intelligence is clearly of fundamental importance to the field of artificial intelligence, no general survey of definitions and tests of machine intelligence exists. Indeed few researchers are even aware of alternatives to the ... | arxiv | @article{legg2007tests,
title={Tests of Machine Intelligence},
author={Shane Legg and Marcus Hutter},
journal={50 Years of Artificial Intelligence (2007) pages 232-242},
year={2007},
number={IDSIA-11-07},
archivePrefix={arXiv},
eprint={0712.3825},
primaryClass={cs.AI}
} | legg2007tests |
arxiv-2187 | 0712.3829 | Quantum Property Testing of Group Solvability | <|reference_start|>Quantum Property Testing of Group Solvability: Testing efficiently whether a finite set with a binary operation over it, given as an oracle, is a group is a well-known open problem in the field of property testing. Recently, Friedl, Ivanyos and Santha have made a significant step in the direction of ... | arxiv | @article{inui2007quantum,
title={Quantum Property Testing of Group Solvability},
author={Yoshifumi Inui and Francois Le Gall},
journal={Algorithmica 59(1): 35-47 (2011)},
year={2007},
doi={10.1007/s00453-009-9338-8},
archivePrefix={arXiv},
eprint={0712.3829},
primaryClass={quant-ph cs.DS... | inui2007quantum |
arxiv-2188 | 0712.3830 | TCHR: a framework for tabled CLP | <|reference_start|>TCHR: a framework for tabled CLP: Tabled Constraint Logic Programming is a powerful execution mechanism for dealing with Constraint Logic Programming without worrying about fixpoint computation. Various applications, e.g in the fields of program analysis and model checking, have been proposed. Unfort... | arxiv | @article{schrijvers2007tchr:,
title={TCHR: a framework for tabled CLP},
author={Tom Schrijvers, Bart Demoen, David S. Warren},
journal={arXiv preprint arXiv:0712.3830},
year={2007},
archivePrefix={arXiv},
eprint={0712.3830},
primaryClass={cs.PL}
} | schrijvers2007tchr: |
arxiv-2189 | 0712.3831 | Hopf bifurcation analysis in a dual model of Internet congestion control algorithm with communication delay | <|reference_start|>Hopf bifurcation analysis in a dual model of Internet congestion control algorithm with communication delay: This paper focuses on the delay induced Hopf bifurcation in a dual model of Internet congestion control algorithms which can be modeled as a time-delay system described by a one-order delay di... | arxiv | @article{ding2007hopf,
title={Hopf bifurcation analysis in a dual model of Internet congestion control
algorithm with communication delay},
author={Dawei Ding, Jie Zhu, Xiaoshu Luo, Yuliang Liu},
journal={arXiv preprint arXiv:0712.3831},
year={2007},
archivePrefix={arXiv},
eprint={0712.3831},
... | ding2007hopf |
arxiv-2190 | 0712.3858 | Bottleneck flows in networks | <|reference_start|>Bottleneck flows in networks: The bottleneck network flow problem (BNFP) is a generalization of several well-studied bottleneck problems such as the bottleneck transportation problem (BTP), bottleneck assignment problem (BAP), bottleneck path problem (BPP), and so on. In this paper we provide a revie... | arxiv | @article{punnen2007bottleneck,
title={Bottleneck flows in networks},
author={Abraham P. Punnen and Ruonan Zhang},
journal={arXiv preprint arXiv:0712.3858},
year={2007},
archivePrefix={arXiv},
eprint={0712.3858},
primaryClass={cs.DS}
} | punnen2007bottleneck |
arxiv-2191 | 0712.3870 | Substitute Valuations: Generation and Structure | <|reference_start|>Substitute Valuations: Generation and Structure: Substitute valuations (in some contexts called gross substitute valuations) are prominent in combinatorial auction theory. An algorithm is given in this paper for generating a substitute valuation through Monte Carlo simulation. In addition, the geomet... | arxiv | @article{hajek2007substitute,
title={Substitute Valuations: Generation and Structure},
author={Bruce Hajek},
journal={arXiv preprint arXiv:0712.3870},
year={2007},
doi={10.1016/j.peva.2008.07.001},
archivePrefix={arXiv},
eprint={0712.3870},
primaryClass={cs.GT cs.PF}
} | hajek2007substitute |
arxiv-2192 | 0712.3876 | Explicit Non-Adaptive Combinatorial Group Testing Schemes | <|reference_start|>Explicit Non-Adaptive Combinatorial Group Testing Schemes: Group testing is a long studied problem in combinatorics: A small set of $r$ ill people should be identified out of the whole ($n$ people) by using only queries (tests) of the form "Does set X contain an ill human?". In this paper we provide ... | arxiv | @article{porat2007explicit,
title={Explicit Non-Adaptive Combinatorial Group Testing Schemes},
author={Ely Porat and Amir Rothschild},
journal={arXiv preprint arXiv:0712.3876},
year={2007},
archivePrefix={arXiv},
eprint={0712.3876},
primaryClass={cs.DS}
} | porat2007explicit |
arxiv-2193 | 0712.3896 | Tighter and Stable Bounds for Marcum Q-Function | <|reference_start|>Tighter and Stable Bounds for Marcum Q-Function: This paper proposes new bounds for Marcum Q-function, which prove extremely tight and outperform all the bounds previously proposed in the literature. What is more, the proposed bounds are good and stable both for large values and small values of the p... | arxiv | @article{wang2007tighter,
title={Tighter and Stable Bounds for Marcum Q-Function},
author={Jiangping Wang},
journal={arXiv preprint arXiv:0712.3896},
year={2007},
archivePrefix={arXiv},
eprint={0712.3896},
primaryClass={cs.IT math.IT}
} | wang2007tighter |
arxiv-2194 | 0712.3916 | Discrete logarithms in curves over finite fields | <|reference_start|>Discrete logarithms in curves over finite fields: A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.<|reference_end|> | arxiv | @article{enge2007discrete,
title={Discrete logarithms in curves over finite fields},
author={Andreas Enge (INRIA Futurs)},
journal={arXiv preprint arXiv:0712.3916},
year={2007},
archivePrefix={arXiv},
eprint={0712.3916},
primaryClass={cs.CR cs.DM math.AG}
} | enge2007discrete |
arxiv-2195 | 0712.3925 | QIS-XML: A metadata specification for Quantum Information Science | <|reference_start|>QIS-XML: A metadata specification for Quantum Information Science: While Quantum Information Science (QIS) is still in its infancy, the ability for quantum based hardware or computers to communicate and integrate with their classical counterparts will be a major requirement towards their success. Lit... | arxiv | @article{heus2007qis-xml:,
title={QIS-XML: A metadata specification for Quantum Information Science},
author={Pascal Heus, Richard Gomez},
journal={arXiv preprint arXiv:0712.3925},
year={2007},
archivePrefix={arXiv},
eprint={0712.3925},
primaryClass={cs.SE cs.DB quant-ph}
} | heus2007qis-xml: |
arxiv-2196 | 0712.3936 | Lagrangian Relaxation and Partial Cover | <|reference_start|>Lagrangian Relaxation and Partial Cover: Lagrangian relaxation has been used extensively in the design of approximation algorithms. This paper studies its strengths and limitations when applied to Partial Cover.<|reference_end|> | arxiv | @article{mestre2007lagrangian,
title={Lagrangian Relaxation and Partial Cover},
author={Juli'an Mestre},
journal={arXiv preprint arXiv:0712.3936},
year={2007},
archivePrefix={arXiv},
eprint={0712.3936},
primaryClass={cs.DS cs.DM}
} | mestre2007lagrangian |
arxiv-2197 | 0712.3964 | Cryptanalysis of an Image Encryption Scheme Based on a Compound Chaotic Sequence | <|reference_start|>Cryptanalysis of an Image Encryption Scheme Based on a Compound Chaotic Sequence: Recently, an image encryption scheme based on a compound chaotic sequence was proposed. In this paper, the security of the scheme is studied and the following problems are found: (1) a differential chosen-plaintext atta... | arxiv | @article{li2007cryptanalysis,
title={Cryptanalysis of an Image Encryption Scheme Based on a Compound Chaotic
Sequence},
author={Chengqing Li, Shujun Li, Guanrong Chen and Wolfgang A. Halang},
journal={arXiv preprint arXiv:0712.3964},
year={2007},
doi={10.1016/j.imavis.2008.09.004},
archivePref... | li2007cryptanalysis |
arxiv-2198 | 0712.3973 | GUIDE: Unifying Evolutionary Engines through a Graphical User Interface | <|reference_start|>GUIDE: Unifying Evolutionary Engines through a Graphical User Interface: Many kinds of Evolutionary Algorithms (EAs) have been described in the literature since the last 30 years. However, though most of them share a common structure, no existing software package allows the user to actually shift fro... | arxiv | @article{collet2007guide:,
title={GUIDE: Unifying Evolutionary Engines through a Graphical User Interface},
author={Pierre Collet (LIL), Marc Schoenauer (INRIA Rocquencourt)},
journal={Dans Evolution Artificielle 2936 (2003) 203-215},
year={2007},
archivePrefix={arXiv},
eprint={0712.3973},
p... | collet2007guide: |
arxiv-2199 | 0712.3980 | Distributed Slicing in Dynamic Systems | <|reference_start|>Distributed Slicing in Dynamic Systems: Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with providing useful P2P middleware services capable of dealing with resource assignme... | arxiv | @article{fernandez2007distributed,
title={Distributed Slicing in Dynamic Systems},
author={Antonio Fernandez (LADyR), Vincent Gramoli (INRIA Futurs, IRISA),
Ernesto Jimenez (EUI), Anne-Marie Kermarrec (IRISA), Michel Raynal (IRISA)},
journal={Dans The 27th International Conference on Distributed Computing... | fernandez2007distributed |
arxiv-2200 | 0712.4011 | Asymptotic Mutual Information Statistics of Separately-Correlated Rician Fading MIMO Channels | <|reference_start|>Asymptotic Mutual Information Statistics of Separately-Correlated Rician Fading MIMO Channels: Precise characterization of the mutual information of MIMO systems is required to assess the throughput of wireless communication channels in the presence of Rician fading and spatial correlation. Here, we ... | arxiv | @article{taricco2007asymptotic,
title={Asymptotic Mutual Information Statistics of Separately-Correlated Rician
Fading MIMO Channels},
author={Giorgio Taricco},
journal={arXiv preprint arXiv:0712.4011},
year={2007},
doi={10.1109/TIT.2008.926415},
archivePrefix={arXiv},
eprint={0712.4011},
... | taricco2007asymptotic |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.