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-1201 | 0709.2446 | Learning for Dynamic Bidding in Cognitive Radio Resources | <|reference_start|>Learning for Dynamic Bidding in Cognitive Radio Resources: In this paper, we model the various wireless users in a cognitive radio network as a collection of selfish, autonomous agents that strategically interact in order to acquire the dynamically available spectrum opportunities. Our main focus is ... | arxiv | @article{fu2007learning,
title={Learning for Dynamic Bidding in Cognitive Radio Resources},
author={Fangwen Fu, Mihaela van der Schaar},
journal={arXiv preprint arXiv:0709.2446},
year={2007},
archivePrefix={arXiv},
eprint={0709.2446},
primaryClass={cs.LG cs.GT}
} | fu2007learning |
arxiv-1202 | 0709.2506 | Autoencoder, Principal Component Analysis and Support Vector Regression for Data Imputation | <|reference_start|>Autoencoder, Principal Component Analysis and Support Vector Regression for Data Imputation: Data collection often results in records that have missing values or variables. This investigation compares 3 different data imputation models and identifies their merits by using accuracy measures. Autoencod... | arxiv | @article{marivate2007autoencoder,,
title={Autoencoder, Principal Component Analysis and Support Vector Regression
for Data Imputation},
author={Vukosi N. Marivate, Fulufhelo V. Nelwamodo, Tshilidzi Marwala},
journal={arXiv preprint arXiv:0709.2506},
year={2007},
archivePrefix={arXiv},
eprint={... | marivate2007autoencoder, |
arxiv-1203 | 0709.2512 | Quantifying Homology Classes II: Localization and Stability | <|reference_start|>Quantifying Homology Classes II: Localization and Stability: In the companion paper, we measured homology classes and computed the optimal homology basis. This paper addresses two related problems, namely, localization and stability. We localize a class with the cycle minimizing a certain objective f... | arxiv | @article{chen2007quantifying,
title={Quantifying Homology Classes II: Localization and Stability},
author={Chao Chen, Daniel Freedman},
journal={arXiv preprint arXiv:0709.2512},
year={2007},
archivePrefix={arXiv},
eprint={0709.2512},
primaryClass={cs.CG cs.CC math.AT}
} | chen2007quantifying |
arxiv-1204 | 0709.2525 | H-Decompositions | <|reference_start|>H-Decompositions: We show that for all graphs H of size n, the complete graph $K_{2n+1}$ has an $H$-decomposition.<|reference_end|> | arxiv | @article{gilbert2007h-decompositions,
title={H-Decompositions},
author={Jesse Gilbert},
journal={arXiv preprint arXiv:0709.2525},
year={2007},
archivePrefix={arXiv},
eprint={0709.2525},
primaryClass={cs.DM}
} | gilbert2007h-decompositions |
arxiv-1205 | 0709.2562 | When are recommender systems useful? | <|reference_start|>When are recommender systems useful?: Recommender systems are crucial tools to overcome the information overload brought about by the Internet. Rigorous tests are needed to establish to what extent sophisticated methods can improve the quality of the predictions. Here we analyse a refined correlation... | arxiv | @article{blattner2007when,
title={When are recommender systems useful?},
author={Marcel Blattner, Alexander Hunziker, Paolo Laureti},
journal={arXiv preprint arXiv:0709.2562},
year={2007},
archivePrefix={arXiv},
eprint={0709.2562},
primaryClass={cs.IR cs.CY cs.DL cs.DS physics.data-an physic... | blattner2007when |
arxiv-1206 | 0709.2598 | On the 3/4-Conjecture for Fix-Free Codes -- A Survey | <|reference_start|>On the 3/4-Conjecture for Fix-Free Codes -- A Survey: In this survey we concern ourself with the question, wether there exists a fix-free code for a given sequence of codeword lengths. For a given alphabet, we obtain the {\em Kraftsum} of a code, if we divide for every length the number of codewords ... | arxiv | @article{schnettler2007on,
title={On the 3/4-Conjecture for Fix-Free Codes -- A Survey},
author={Holger Schnettler},
journal={arXiv preprint arXiv:0709.2598},
year={2007},
archivePrefix={arXiv},
eprint={0709.2598},
primaryClass={cs.IT math.CO math.IT}
} | schnettler2007on |
arxiv-1207 | 0709.2618 | On Frequency Optimisation for Power Saving in WSNs: Finding Optimum Hardware Timers Frequencies | <|reference_start|>On Frequency Optimisation for Power Saving in WSNs: Finding Optimum Hardware Timers Frequencies: Wireless Sensor Networks research and demand are now in full expansion, since people came to understand these are the key to a large number of issues in industry, commerce, home automation, healthcare, ag... | arxiv | @article{picu2007on,
title={On Frequency Optimisation for Power Saving in WSNs: Finding Optimum
Hardware Timers Frequencies},
author={Andreea Picu (CITI, INRIA Rh^one-Alpes), Antoine Fraboulet (CITI,
INRIA Rh^one-Alpes), Eric Fleury (CITI, INRIA Rh^one-Alpes)},
journal={arXiv preprint arXiv:0709.2618},
... | picu2007on |
arxiv-1208 | 0709.2635 | Non-Blocking Signature of very large SOAP Messages | <|reference_start|>Non-Blocking Signature of very large SOAP Messages: Data transfer and staging services are common components in Grid-based, or more generally, in service-oriented applications. Security mechanisms play a central role in such services, especially when they are deployed in sensitive application fields ... | arxiv | @article{kohring2007non-blocking,
title={Non-Blocking Signature of very large SOAP Messages},
author={G.A. Kohring and L. Lo Iacono},
journal={in H.-G. Hegering, A. Lehmann, H.J. Ohlbach and C. Scheideler,
eds., INFORMATIK 2008, Beherrschbare Systeme - dank Informatik (Koellen Druck
& Verlag GmbH, Bonn,... | kohring2007non-blocking |
arxiv-1209 | 0709.2689 | An algorithm for solving the Independent Set problem | <|reference_start|>An algorithm for solving the Independent Set problem: This paper has been withdrawn by the author, due an error in claim 1.<|reference_end|> | arxiv | @article{kettani2007an,
title={An algorithm for solving the Independent Set problem},
author={Omar Kettani},
journal={arXiv preprint arXiv:0709.2689},
year={2007},
archivePrefix={arXiv},
eprint={0709.2689},
primaryClass={cs.DM}
} | kettani2007an |
arxiv-1210 | 0709.2721 | Pricing, Competition, and Routing for Selfish and Strategic Nodes in Multi-hop Relay Networks | <|reference_start|>Pricing, Competition, and Routing for Selfish and Strategic Nodes in Multi-hop Relay Networks: We study a pricing game in multi-hop relay networks where nodes price their services and route their traffic selfishly and strategically. In this game, each node (1) announces pricing functions which specif... | arxiv | @article{xi2007pricing,,
title={Pricing, Competition, and Routing for Selfish and Strategic Nodes in
Multi-hop Relay Networks},
author={Yufang Xi and Edmund M. Yeh},
journal={arXiv preprint arXiv:0709.2721},
year={2007},
archivePrefix={arXiv},
eprint={0709.2721},
primaryClass={cs.GT}
} | xi2007pricing, |
arxiv-1211 | 0709.2813 | LDPC codes from Singer cycles | <|reference_start|>LDPC codes from Singer cycles: The main goal of coding theory is to devise efficient systems to exploit the full capacity of a communication channel, thus achieving an arbitrarily small error probability. Low Density Parity Check (LDPC) codes are a family of block codes--characterised by admitting a ... | arxiv | @article{giuzzi2007ldpc,
title={LDPC codes from Singer cycles},
author={L. Giuzzi, A. Sonnino},
journal={Discrete Applied Mathematics 157: 1723-1728 (2009)},
year={2007},
doi={10.1016/j.dam.2009.01.013},
archivePrefix={arXiv},
eprint={0709.2813},
primaryClass={cs.IT math.IT}
} | giuzzi2007ldpc |
arxiv-1212 | 0709.2831 | Triangulating the Real Projective Plane | <|reference_start|>Triangulating the Real Projective Plane: We consider the problem of computing a triangulation of the real projective plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a triangulation of P2 always exists if at least six points in S are in general position, i.e., no three of... | arxiv | @article{aanjaneya2007triangulating,
title={Triangulating the Real Projective Plane},
author={Mridul Aanjaneya, Monique Teillaud (INRIA Sophia Antipolis)},
journal={arXiv preprint arXiv:0709.2831},
year={2007},
archivePrefix={arXiv},
eprint={0709.2831},
primaryClass={cs.CG}
} | aanjaneya2007triangulating |
arxiv-1213 | 0709.2833 | Distributed Space Time Codes with Low Decoding Complexity for Asynchronous Relay Networks | <|reference_start|>Distributed Space Time Codes with Low Decoding Complexity for Asynchronous Relay Networks: Recently Li and Xia have proposed a transmission scheme for wireless relay networks based on the Alamouti space time code and orthogonal frequency division multiplexing to combat the effect of timing errors at ... | arxiv | @article{rajan2007distributed,
title={Distributed Space Time Codes with Low Decoding Complexity for
Asynchronous Relay Networks},
author={G. Susinder Rajan and B. Sundar Rajan},
journal={arXiv preprint arXiv:0709.2833},
year={2007},
number={TR-PME-2007-09},
archivePrefix={arXiv},
eprint={0... | rajan2007distributed |
arxiv-1214 | 0709.2851 | Joint power control and user scheduling in multicell wireless networks: Capacity scaling laws | <|reference_start|>Joint power control and user scheduling in multicell wireless networks: Capacity scaling laws: We address the optimization of the sum rate performance in multicell interference-limited singlehop networks where access points are allowed to cooperate in terms of joint resource allocation. The resource ... | arxiv | @article{gesbert2007joint,
title={Joint power control and user scheduling in multicell wireless networks:
Capacity scaling laws},
author={David Gesbert, Marios Kountouris},
journal={arXiv preprint arXiv:0709.2851},
year={2007},
archivePrefix={arXiv},
eprint={0709.2851},
primaryClass={cs.IT... | gesbert2007joint |
arxiv-1215 | 0709.2935 | An Extension to an Algebraic Method for Linear Time-Invariant System and Network Theory: The full AC-Calculus | <|reference_start|>An Extension to an Algebraic Method for Linear Time-Invariant System and Network Theory: The full AC-Calculus: Being inspired by phasor analysis in linear circuit theory, and its algebraic counterpart - the AC-(operational)-calculus for sinusoids developed by W. Marten and W. Mathis - we define a com... | arxiv | @article{gerbracht2007an,
title={An Extension to an Algebraic Method for Linear Time-Invariant System and
Network Theory: The full AC-Calculus},
author={Eberhard H.-A. Gerbracht},
journal={Proceedings of the Fifth International Workshop on Symbolic
Methods and Applications in Circuit Design, SMACD '98, ... | gerbracht2007an |
arxiv-1216 | 0709.2961 | Incremental Satisfiability and Implication for UTVPI Constraints | <|reference_start|>Incremental Satisfiability and Implication for UTVPI Constraints: Unit two-variable-per-inequality (UTVPI) constraints form one of the largest class of integer constraints which are polynomial time solvable (unless P=NP). There is considerable interest in their use for constraint solving, abstract in... | arxiv | @article{schutt2007incremental,
title={Incremental Satisfiability and Implication for UTVPI Constraints},
author={Andreas Schutt and Peter J. Stuckey},
journal={arXiv preprint arXiv:0709.2961},
year={2007},
archivePrefix={arXiv},
eprint={0709.2961},
primaryClass={cs.DS cs.CG cs.LO}
} | schutt2007incremental |
arxiv-1217 | 0709.2962 | Algebraic characterization of logically defined tree languages | <|reference_start|>Algebraic characterization of logically defined tree languages: We give an algebraic characterization of the tree languages that are defined by logical formulas using certain Lindstr\"om quantifiers. An important instance of our result concerns first-order definable tree languages. Our characterizati... | arxiv | @article{esik2007algebraic,
title={Algebraic characterization of logically defined tree languages},
author={Zoltan Esik, Pascal Weil (LaBRI)},
journal={International Journal of Algebra and Computation 20 (2010) 195-239},
year={2007},
archivePrefix={arXiv},
eprint={0709.2962},
primaryClass={c... | esik2007algebraic |
arxiv-1218 | 0709.3013 | Supervised learning on graphs of spatio-temporal similarity in satellite image sequences | <|reference_start|>Supervised learning on graphs of spatio-temporal similarity in satellite image sequences: High resolution satellite image sequences are multidimensional signals composed of spatio-temporal patterns associated to numerous and various phenomena. Bayesian methods have been previously proposed in (Heas a... | arxiv | @article{héas2007supervised,
title={Supervised learning on graphs of spatio-temporal similarity in satellite
image sequences},
author={Patrick H'eas (IRISA), Mihai Datcu (DLR, Oberpfaffenhofen)},
journal={arXiv preprint arXiv:0709.3013},
year={2007},
archivePrefix={arXiv},
eprint={0709.3013},
... | héas2007supervised |
arxiv-1219 | 0709.3034 | Query Evaluation in P2P Systems of Taxonomy-based Sources: Algorithms, Complexity, and Optimizations | <|reference_start|>Query Evaluation in P2P Systems of Taxonomy-based Sources: Algorithms, Complexity, and Optimizations: In this study, we address the problem of answering queries over a peer-to-peer system of taxonomy-based sources. A taxonomy states subsumption relationships between negation-free DNF formulas on term... | arxiv | @article{meghini2007query,
title={Query Evaluation in P2P Systems of Taxonomy-based Sources: Algorithms,
Complexity, and Optimizations},
author={Carlo Meghini, Yannis Tzitzikas, Anastasia Analyti},
journal={arXiv preprint arXiv:0709.3034},
year={2007},
archivePrefix={arXiv},
eprint={0709.3034}... | meghini2007query |
arxiv-1220 | 0709.3094 | Transition from small to large world in growing networks | <|reference_start|>Transition from small to large world in growing networks: We examine the global organization of growing networks in which a new vertex is attached to already existing ones with a probability depending on their age. We find that the network is infinite- or finite-dimensional depending on whether the a... | arxiv | @article{dorogovtsev2007transition,
title={Transition from small to large world in growing networks},
author={S. N. Dorogovtsev, P. L. Krapivsky, J. F. F. Mendes},
journal={EPL 81, 30004 (2008)},
year={2007},
doi={10.1209/0295-5075/81/30004},
archivePrefix={arXiv},
eprint={0709.3094},
pr... | dorogovtsev2007transition |
arxiv-1221 | 0709.3257 | Series which are both max-plus and min-plus rational are unambiguous | <|reference_start|>Series which are both max-plus and min-plus rational are unambiguous: Consider partial maps from the free monoid into the field of real numbers with a rational domain. We show that two families of such series are actually the same: the unambiguous rational series on the one hand, and the max-plus and... | arxiv | @article{lombardy2007series,
title={Series which are both max-plus and min-plus rational are unambiguous},
author={Sylvain Lombardy (LIAFA), Jean Mairesse (LIAFA)},
journal={RAIRO - Theoretical Informatics and Applications 40 (2006) 1-14},
year={2007},
doi={10.1051/ita:2005042},
archivePrefix={a... | lombardy2007series |
arxiv-1222 | 0709.3262 | A software for learning Information Theory basics with emphasis on Entropy of Spanish | <|reference_start|>A software for learning Information Theory basics with emphasis on Entropy of Spanish: In this paper, a tutorial software to learn Information Theory basics in a practical way is reported. The software, called IT-tutor-UV, makes use of a modern existing Spanish corpus for the modeling of the source. ... | arxiv | @article{guerrero2007a,
title={A software for learning Information Theory basics with emphasis on
Entropy of Spanish},
author={Fabio G. Guerrero and Lucio A. Perez},
journal={Revista Energia y Computacion, Vol. 16, No.1, June 2008, pp.58-64},
year={2007},
archivePrefix={arXiv},
eprint={0709.32... | guerrero2007a |
arxiv-1223 | 0709.3283 | Algorithmic and topological aspects of semi-algebraic sets defined by quadratic polynomial | <|reference_start|>Algorithmic and topological aspects of semi-algebraic sets defined by quadratic polynomial: In this thesis, we consider semi-algebraic sets over a real closed field $R$ defined by quadratic polynomials. Semi-algebraic sets of $R^k$ are defined as the smallest family of sets in $R^k$ that contains the... | arxiv | @article{kettner2007algorithmic,
title={Algorithmic and topological aspects of semi-algebraic sets defined by
quadratic polynomial},
author={Michael Kettner},
journal={arXiv preprint arXiv:0709.3283},
year={2007},
archivePrefix={arXiv},
eprint={0709.3283},
primaryClass={math.AG cs.CG math.... | kettner2007algorithmic |
arxiv-1224 | 0709.3334 | Mistake Analyses on Proof about Perfect Secrecy of One-time-pad | <|reference_start|>Mistake Analyses on Proof about Perfect Secrecy of One-time-pad: This paper has been withdrawn<|reference_end|> | arxiv | @article{wang2007mistake,
title={Mistake Analyses on Proof about Perfect Secrecy of One-time-pad},
author={Yong Wang},
journal={arXiv preprint arXiv:0709.3334},
year={2007},
archivePrefix={arXiv},
eprint={0709.3334},
primaryClass={cs.CR}
} | wang2007mistake |
arxiv-1225 | 0709.3384 | Weighted Matching in the Semi-Streaming Model | <|reference_start|>Weighted Matching in the Semi-Streaming Model: We reduce the best known approximation ratio for finding a weighted matching of a graph using a one-pass semi-streaming algorithm from 5.828 to 5.585. The semi-streaming model forbids random access to the input and restricts the memory to O(n*polylog(n))... | arxiv | @article{zelke2007weighted,
title={Weighted Matching in the Semi-Streaming Model},
author={Mariano Zelke},
journal={Proceedings of the 25th Annual Symposium on the Theoretical
Aspects of Computer Science - STACS 2008, Bordeaux : France (2008)},
year={2007},
archivePrefix={arXiv},
eprint={0709.... | zelke2007weighted |
arxiv-1226 | 0709.3420 | Co-Betweenness: A Pairwise Notion of Centrality | <|reference_start|>Co-Betweenness: A Pairwise Notion of Centrality: Betweenness centrality is a metric that seeks to quantify a sense of the importance of a vertex in a network graph in terms of its "control" on the distribution of information along geodesic paths throughout that network. This quantity however does not... | arxiv | @article{kolaczyk2007co-betweenness:,
title={Co-Betweenness: A Pairwise Notion of Centrality},
author={Eric D. Kolaczyk, David B. Chua, Marc Barthelemy},
journal={Social Networks 31 (2009), pp. 190-203},
year={2007},
archivePrefix={arXiv},
eprint={0709.3420},
primaryClass={cs.NI physics.soc-... | kolaczyk2007co-betweenness: |
arxiv-1227 | 0709.3427 | Mutual information for the selection of relevant variables in spectrometric nonlinear modelling | <|reference_start|>Mutual information for the selection of relevant variables in spectrometric nonlinear modelling: Data from spectrophotometers form vectors of a large number of exploitable variables. Building quantitative models using these variables most often requires using a smaller set of variables than the initi... | arxiv | @article{rossi2007mutual,
title={Mutual information for the selection of relevant variables in
spectrometric nonlinear modelling},
author={Fabrice Rossi (INRIA Rocquencourt / INRIA Sophia Antipolis), Amaury
Lendasse (CIS), Damien Franc{c}ois (CESAME), Vincent Wertz (CESAME), Michel
Verleysen (DICE - MLG)}... | rossi2007mutual |
arxiv-1228 | 0709.3461 | Fast Algorithm and Implementation of Dissimilarity Self-Organizing Maps | <|reference_start|>Fast Algorithm and Implementation of Dissimilarity Self-Organizing Maps: In many real world applications, data cannot be accurately represented by vectors. In those situations, one possible solution is to rely on dissimilarity measures that enable sensible comparison between observations. Kohonen's S... | arxiv | @article{conan-guez2007fast,
title={Fast Algorithm and Implementation of Dissimilarity Self-Organizing Maps},
author={Brieuc Conan-Guez (LITA), Fabrice Rossi (INRIA Rocquencourt / INRIA
Sophia Antipolis), A"icha El Golli (INRIA Rocquencourt / INRIA Sophia
Antipolis)},
journal={Neural Networks 19, 6-7 (2... | conan-guez2007fast |
arxiv-1229 | 0709.3541 | Towards the Secrecy Capacity of the Gaussian MIMO Wire-tap Channel: The 2-2-1 Channel | <|reference_start|>Towards the Secrecy Capacity of the Gaussian MIMO Wire-tap Channel: The 2-2-1 Channel: We find the secrecy capacity of the 2-2-1 Gaussian MIMO wire-tap channel, which consists of a transmitter and a receiver with two antennas each, and an eavesdropper with a single antenna. We determine the secrecy c... | arxiv | @article{shafiee2007towards,
title={Towards the Secrecy Capacity of the Gaussian MIMO Wire-tap Channel: The
2-2-1 Channel},
author={Shabnam Shafiee, Nan Liu and Sennur Ulukus},
journal={arXiv preprint arXiv:0709.3541},
year={2007},
doi={10.1109/TIT.2009.2025549},
archivePrefix={arXiv},
epr... | shafiee2007towards |
arxiv-1230 | 0709.3553 | Design of moveable and resizable graphics | <|reference_start|>Design of moveable and resizable graphics: We are communicating with computers on two different levels. On upper level we have a very flexible system of windows: we can move them, resize, overlap or put side by side. At any moment we decide what would be the best view and reorganize the whole view ea... | arxiv | @article{andreyev2007design,
title={Design of moveable and resizable graphics},
author={Sergey Andreyev},
journal={arXiv preprint arXiv:0709.3553},
year={2007},
archivePrefix={arXiv},
eprint={0709.3553},
primaryClass={cs.GR cs.HC}
} | andreyev2007design |
arxiv-1231 | 0709.3554 | A New Lower Bound on Guard Placement for Wireless Localization | <|reference_start|>A New Lower Bound on Guard Placement for Wireless Localization: The problem of wireless localization asks to place and orient stations in the plane, each of which broadcasts a unique key within a fixed angular range, so that each point in the plane can determine whether it is inside or outside a give... | arxiv | @article{damian2007a,
title={A New Lower Bound on Guard Placement for Wireless Localization},
author={Mirela Damian, Robin Flatland, Joseph O'Rourke and Suneeta Ramaswami},
journal={arXiv preprint arXiv:0709.3554},
year={2007},
archivePrefix={arXiv},
eprint={0709.3554},
primaryClass={cs.CG c... | damian2007a |
arxiv-1232 | 0709.3586 | Une adaptation des cartes auto-organisatrices pour des donn\'ees d\'ecrites par un tableau de dissimilarit\'es | <|reference_start|>Une adaptation des cartes auto-organisatrices pour des donn\'ees d\'ecrites par un tableau de dissimilarit\'es: Many data analysis methods cannot be applied to data that are not represented by a fixed number of real values, whereas most of real world observations are not readily available in such a f... | arxiv | @article{golli2007une,
title={Une adaptation des cartes auto-organisatrices pour des donn\'ees
d\'ecrites par un tableau de dissimilarit\'es},
author={A"icha El Golli (INRIA Rocquencourt / INRIA Sophia Antipolis),
Fabrice Rossi (INRIA Rocquencourt / INRIA Sophia Antipolis), Brieuc
Conan-Guez (LITA), Yves ... | golli2007une |
arxiv-1233 | 0709.3587 | Self-organizing maps and symbolic data | <|reference_start|>Self-organizing maps and symbolic data: In data analysis new forms of complex data have to be considered like for example (symbolic data, functional data, web data, trees, SQL query and multimedia data, ...). In this context classical data analysis for knowledge discovery based on calculating the cen... | arxiv | @article{golli2007self-organizing,
title={Self-organizing maps and symbolic data},
author={A"icha El Golli (INRIA Rocquencourt / INRIA Sophia Antipolis), Brieuc
Conan-Guez (INRIA Rocquencourt / INRIA Sophia Antipolis), Fabrice Rossi
(INRIA Rocquencourt / INRIA Sophia Antipolis)},
journal={Journal of Sym... | golli2007self-organizing |
arxiv-1234 | 0709.3590 | An extension of a result concerning convex geometric graphs | <|reference_start|>An extension of a result concerning convex geometric graphs: We show a general result known as the Erdos_Sos Conjecture: if $E(G)>{1/2}(k-1)n$ where $G$ has order $n$ then $G$ contains every tree of order $k+1$ as a subgraph.<|reference_end|> | arxiv | @article{gilbert2007an,
title={An extension of a result concerning convex geometric graphs},
author={Jesse Gilbert},
journal={arXiv preprint arXiv:0709.3590},
year={2007},
archivePrefix={arXiv},
eprint={0709.3590},
primaryClass={cs.DM}
} | gilbert2007an |
arxiv-1235 | 0709.3600 | Cooperative Multiplexing in a Half Duplex Relay Network: Performance and Constraints | <|reference_start|>Cooperative Multiplexing in a Half Duplex Relay Network: Performance and Constraints: Previous work on relay networks has concentrated primarily on the diversity benefits of such techniques. This paper explores the possibility of also obtaining multiplexing gain in a relay network, while retaining di... | arxiv | @article{yijia2007cooperative,
title={Cooperative Multiplexing in a Half Duplex Relay Network: Performance and
Constraints},
author={Yijia (Richard) Fan, H. Vincent Poor, John S. Thompson},
journal={arXiv preprint arXiv:0709.3600},
year={2007},
archivePrefix={arXiv},
eprint={0709.3600},
pr... | yijia2007cooperative |
arxiv-1236 | 0709.3639 | Fast Selection of Spectral Variables with B-Spline Compression | <|reference_start|>Fast Selection of Spectral Variables with B-Spline Compression: The large number of spectral variables in most data sets encountered in spectral chemometrics often renders the prediction of a dependent variable uneasy. The number of variables hopefully can be reduced, by using either projection techn... | arxiv | @article{rossi2007fast,
title={Fast Selection of Spectral Variables with B-Spline Compression},
author={Fabrice Rossi (INRIA Rocquencourt / INRIA Sophia Antipolis), Damien
Franc{c}ois (CESAME), Vincent Wertz (CESAME), Marc Meurens (BNUT), Michel
Verleysen (DICE - MLG)},
journal={Chemometrics and Intelli... | rossi2007fast |
arxiv-1237 | 0709.3640 | Resampling methods for parameter-free and robust feature selection with mutual information | <|reference_start|>Resampling methods for parameter-free and robust feature selection with mutual information: Combining the mutual information criterion with a forward feature selection strategy offers a good trade-off between optimality of the selected feature subset and computation time. However, it requires to set ... | arxiv | @article{françois2007resampling,
title={Resampling methods for parameter-free and robust feature selection with
mutual information},
author={Damien Franc{c}ois (CESAME), Fabrice Rossi (INRIA Rocquencourt /
INRIA Sophia Antipolis), Vincent Wertz (CESAME), Michel Verleysen (DICE -
MLG)},
journal={Neuroc... | françois2007resampling |
arxiv-1238 | 0709.3641 | Representation of Functional Data in Neural Networks | <|reference_start|>Representation of Functional Data in Neural Networks: Functional Data Analysis (FDA) is an extension of traditional data analysis to functional data, for example spectra, temporal series, spatio-temporal images, gesture recognition data, etc. Functional data are rarely known in practice; usually a re... | arxiv | @article{rossi2007representation,
title={Representation of Functional Data in Neural Networks},
author={Fabrice Rossi (INRIA Rocquencourt / INRIA Sophia Antipolis, CEREMADE),
Nicolas Delannay (DICE - MLG), Brieuc Conan-Guez (INRIA Rocquencourt / INRIA
Sophia Antipolis, CEREMADE), Michel Verleysen (DICE - ML... | rossi2007representation |
arxiv-1239 | 0709.3642 | Functional Multi-Layer Perceptron: a Nonlinear Tool for Functional Data Analysis | <|reference_start|>Functional Multi-Layer Perceptron: a Nonlinear Tool for Functional Data Analysis: In this paper, we study a natural extension of Multi-Layer Perceptrons (MLP) to functional inputs. We show that fundamental results for classical MLP can be extended to functional MLP. We obtain universal approximation ... | arxiv | @article{rossi2007functional,
title={Functional Multi-Layer Perceptron: a Nonlinear Tool for Functional Data
Analysis},
author={Fabrice Rossi (INRIA Rocquencourt / INRIA Sophia Antipolis, CEREMADE),
Brieuc Conan-Guez (INRIA Rocquencourt / INRIA Sophia Antipolis, CEREMADE)},
journal={Neural Networks 18, ... | rossi2007functional |
arxiv-1240 | 0709.3689 | Static Deadlock Detection in MPI Synchronization Communication | <|reference_start|>Static Deadlock Detection in MPI Synchronization Communication: It is very common to use dynamic methods to detect deadlocks in MPI programs for the reason that static methods have some restrictions. To guarantee high reliability of some important MPI-based application software, a model of MPI synchr... | arxiv | @article{ming-xue2007static,
title={Static Deadlock Detection in MPI Synchronization Communication},
author={Liao Ming-Xue, He Xiao-Xin, Fan Zhi-Hua},
journal={arXiv preprint arXiv:0709.3689},
year={2007},
archivePrefix={arXiv},
eprint={0709.3689},
primaryClass={cs.DC}
} | ming-xue2007static |
arxiv-1241 | 0709.3692 | Deadlock Detection in Basic Models of MPI Synchronization Communication Programs | <|reference_start|>Deadlock Detection in Basic Models of MPI Synchronization Communication Programs: A model of MPI synchronization communication programs is presented and its three basic simplified models are also defined. A series of theorems and methods for deciding whether deadlocks will occur among the three model... | arxiv | @article{liao2007deadlock,
title={Deadlock Detection in Basic Models of MPI Synchronization Communication
Programs},
author={Ming-xue Liao, Zhi-hua Fan},
journal={arXiv preprint arXiv:0709.3692},
year={2007},
archivePrefix={arXiv},
eprint={0709.3692},
primaryClass={cs.DC}
} | liao2007deadlock |
arxiv-1242 | 0709.3693 | Algorithm of Static Deadlock Detection in MPI Synchronization Communication Sequential Model | <|reference_start|>Algorithm of Static Deadlock Detection in MPI Synchronization Communication Sequential Model: Detecting deadlocks in MPI synchronization communication programs is very difficult and need building program models. All complex models are based on sequential models. The sequential model is mapped into a ... | arxiv | @article{ming-xue2007algorithm,
title={Algorithm of Static Deadlock Detection in MPI Synchronization
Communication Sequential Model},
author={Liao Ming-Xue, He Xiao-Xin, Fan Zhi-Hua},
journal={arXiv preprint arXiv:0709.3693},
year={2007},
archivePrefix={arXiv},
eprint={0709.3693},
primaryC... | ming-xue2007algorithm |
arxiv-1243 | 0709.3753 | On Real-Time Communication Systems with Noisy Feedback | <|reference_start|>On Real-Time Communication Systems with Noisy Feedback: We consider a real-time communication system with noisy feedback consisting of a Markov source, a forward and a backward discrete memoryless channels, and a receiver with finite memory. The objective is to design an optimal communication strateg... | arxiv | @article{mahajan2007on,
title={On Real-Time Communication Systems with Noisy Feedback},
author={Aditya Mahajan and Demosthenis Teneketzis},
journal={arXiv preprint arXiv:0709.3753},
year={2007},
archivePrefix={arXiv},
eprint={0709.3753},
primaryClass={cs.IT cs.MA math.IT math.OC math.PR}
} | mahajan2007on |
arxiv-1244 | 0709.3826 | Research Paper on Transaction-Oriented Simulation In Ad Hoc Grids | <|reference_start|>Research Paper on Transaction-Oriented Simulation In Ad Hoc Grids: This paper analyses the requirements of performing parallel transaction-oriented simulations with a special focus on the space-parallel approach and discrete event simulation synchronisation algorithms that are suitable for transactio... | arxiv | @article{krafft2007research,
title={Research Paper on Transaction-Oriented Simulation In Ad Hoc Grids},
author={Gerald Krafft},
journal={arXiv preprint arXiv:0709.3826},
year={2007},
archivePrefix={arXiv},
eprint={0709.3826},
primaryClass={cs.DC}
} | krafft2007research |
arxiv-1245 | 0709.3827 | On Successive Refinement of Diversity for Fading ISI Channels | <|reference_start|>On Successive Refinement of Diversity for Fading ISI Channels: Rate and diversity impose a fundamental tradeoff in communications. This tradeoff was investigated for Intersymbol Interference (ISI) channels in [4]. A different point of view was explored in [1] where high-rate codes were designed so th... | arxiv | @article{dusad2007on,
title={On Successive Refinement of Diversity for Fading ISI Channels},
author={S. Dusad, S. N. Diggavi},
journal={arXiv preprint arXiv:0709.3827},
year={2007},
archivePrefix={arXiv},
eprint={0709.3827},
primaryClass={cs.IT math.IT}
} | dusad2007on |
arxiv-1246 | 0709.3880 | A New Perspective on Multi-user Power Control Games in Interference Channels | <|reference_start|>A New Perspective on Multi-user Power Control Games in Interference Channels: This paper considers the problem of how to allocate power among competing users sharing a frequency-selective interference channel. We model the interaction between selfish users as a non-cooperative game. As opposed to the... | arxiv | @article{su2007a,
title={A New Perspective on Multi-user Power Control Games in Interference
Channels},
author={Yi Su and Mihaela van der Schaar},
journal={arXiv preprint arXiv:0709.3880},
year={2007},
archivePrefix={arXiv},
eprint={0709.3880},
primaryClass={cs.GT}
} | su2007a |
arxiv-1247 | 0709.3915 | Guessing Facets: Polytope Structure and Improved LP Decoding | <|reference_start|>Guessing Facets: Polytope Structure and Improved LP Decoding: In this paper we investigate the structure of the fundamental polytope used in the Linear Programming decoding introduced by Feldman, Karger and Wainwright. We begin by showing that for expander codes, every fractional pseudocodeword alway... | arxiv | @article{dimakis2007guessing,
title={Guessing Facets: Polytope Structure and Improved LP Decoding},
author={Alexandros G. Dimakis, Amin A. Gohari, Martin J. Wainwright},
journal={arXiv preprint arXiv:0709.3915},
year={2007},
archivePrefix={arXiv},
eprint={0709.3915},
primaryClass={cs.IT math... | dimakis2007guessing |
arxiv-1248 | 0709.3921 | Geographic Gossip: Efficient Averaging for Sensor Networks | <|reference_start|>Geographic Gossip: Efficient Averaging for Sensor Networks: Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standard gossip algorithms can lead to a significant waste in energy... | arxiv | @article{dimakis2007geographic,
title={Geographic Gossip: Efficient Averaging for Sensor Networks},
author={Alexandros G. Dimakis, Anand D. Sarwate, Martin J. Wainwright},
journal={arXiv preprint arXiv:0709.3921},
year={2007},
doi={10.1109/TSP.2007.908946},
archivePrefix={arXiv},
eprint={070... | dimakis2007geographic |
arxiv-1249 | 0709.3965 | Evolving Classifiers: Methods for Incremental Learning | <|reference_start|>Evolving Classifiers: Methods for Incremental Learning: The ability of a classifier to take on new information and classes by evolving the classifier without it having to be fully retrained is known as incremental learning. Incremental learning has been successfully applied to many classification pro... | arxiv | @article{hulley2007evolving,
title={Evolving Classifiers: Methods for Incremental Learning},
author={Greg Hulley and Tshilidzi Marwala},
journal={arXiv preprint arXiv:0709.3965},
year={2007},
archivePrefix={arXiv},
eprint={0709.3965},
primaryClass={cs.LG cs.AI cs.NE}
} | hulley2007evolving |
arxiv-1250 | 0709.3967 | Classification of Images Using Support Vector Machines | <|reference_start|>Classification of Images Using Support Vector Machines: Support Vector Machines (SVMs) are a relatively new supervised classification technique to the land cover mapping community. They have their roots in Statistical Learning Theory and have gained prominence because they are robust, accurate and ar... | arxiv | @article{anthony2007classification,
title={Classification of Images Using Support Vector Machines},
author={Gidudu Anthony, Hulley Greg and Marwala Tshilidzi},
journal={arXiv preprint arXiv:0709.3967},
year={2007},
archivePrefix={arXiv},
eprint={0709.3967},
primaryClass={cs.LG cs.AI}
} | anthony2007classification |
arxiv-1251 | 0709.3974 | Fitness landscape of the cellular automata majority problem: View from the Olympus | <|reference_start|>Fitness landscape of the cellular automata majority problem: View from the Olympus: In this paper we study cellular automata (CAs) that perform the computational Majority task. This task is a good example of what the phenomenon of emergence in complex systems is. We take an interest in the reasons th... | arxiv | @article{verel2007fitness,
title={Fitness landscape of the cellular automata majority problem: View from
the Olympus},
author={S'ebastien Verel (I3S), Philippe Collard (I3S), Marco Tomassini
(ISI), Leonardo Vanneschi (DISCO)},
journal={Theoretical Computer Science 378, 1 (2007) 54-77},
year={2007},
... | verel2007fitness |
arxiv-1252 | 0709.4010 | Local search heuristics: Fitness Cloud versus Fitness Landscape | <|reference_start|>Local search heuristics: Fitness Cloud versus Fitness Landscape: This paper introduces the concept of fitness cloud as an alternative way to visualize and analyze search spaces than given by the geographic notion of fitness landscape. It is argued that the fitness cloud concept overcomes several defi... | arxiv | @article{collard2007local,
title={Local search heuristics: Fitness Cloud versus Fitness Landscape},
author={Philippe Collard (I3S), S'ebastien Verel (I3S), Manuel Clergue (I3S)},
journal={Dans Poster at the 2004 European Conference on Artificial
Intelligence (ECAI04) - the 2004 European Conference on Arti... | collard2007local |
arxiv-1253 | 0709.4011 | Measuring the Evolvability Landscape to study Neutrality | <|reference_start|>Measuring the Evolvability Landscape to study Neutrality: This theoretical work defines the measure of autocorrelation of evolvability in the context of neutral fitness landscape. This measure has been studied on the classical MAX-SAT problem. This work highlight a new characteristic of neutral fitne... | arxiv | @article{verel2007measuring,
title={Measuring the Evolvability Landscape to study Neutrality},
author={S'ebastien Verel (I3S), Philippe Collard (I3S), Manuel Clergue (I3S)},
journal={Dans Poster at Genetic and Evolutionary Computation -- GECCO-2006
- Genetic and Evolutionary Computation -- GECCO-2006, Sea... | verel2007measuring |
arxiv-1254 | 0709.4015 | From Texts to Structured Documents: The Case of Health Practice Guidelines | <|reference_start|>From Texts to Structured Documents: The Case of Health Practice Guidelines: This paper describes a system capable of semi-automatically filling an XML template from free texts in the clinical domain (practice guidelines). The XML template includes semantic information not explicitly encoded in the te... | arxiv | @article{bouffier2007from,
title={From Texts to Structured Documents: The Case of Health Practice
Guidelines},
author={Amanda Bouffier (LIPN)},
journal={Dans International Semantic Web Conference Proceedings -
International Semantic Web Conference-Doctoral Consortium, Busan : Cor\'ee,
R\'epublique de ... | bouffier2007from |
arxiv-1255 | 0709.4035 | Energy Efficient Estimation of Gaussian Sources Over Inhomogeneous Gaussian MAC Channels | <|reference_start|>Energy Efficient Estimation of Gaussian Sources Over Inhomogeneous Gaussian MAC Channels: It has been shown lately the optimality of uncoded transmission in estimating Gaussian sources over homogeneous/symmetric Gaussian multiple access channels (MAC) using multiple sensors. It remains, however, uncl... | arxiv | @article{wei2007energy,
title={Energy Efficient Estimation of Gaussian Sources Over Inhomogeneous
Gaussian MAC Channels},
author={Shuangqing Wei, Rajgopal Kannan, Sitharama Iyengar and Nageswara S.
Rao},
journal={arXiv preprint arXiv:0709.4035},
year={2007},
archivePrefix={arXiv},
eprint={07... | wei2007energy |
arxiv-1256 | 0709.4048 | A Symphony Conducted by Brunet | <|reference_start|>A Symphony Conducted by Brunet: We introduce BruNet, a general P2P software framework which we use to produce the first implementation of Symphony, a 1-D Kleinberg small-world architecture. Our framework is designed to easily implement and measure different P2P protocols over different transport laye... | arxiv | @article{boykin2007a,
title={A Symphony Conducted by Brunet},
author={P. Oscar Boykin, Jesse S. A. Bridgewater, Joseph S. Kong, Kamen M.
Lozev, Behnam A. Rezaei, Vwani P. Roychowdhury},
journal={arXiv preprint arXiv:0709.4048},
year={2007},
archivePrefix={arXiv},
eprint={0709.4048},
primar... | boykin2007a |
arxiv-1257 | 0709.4063 | The Importance and Criticality of Spreadsheets in the City of London | <|reference_start|>The Importance and Criticality of Spreadsheets in the City of London: Spreadsheets have been with us in their present form for over a quarter of a century. We have become so used to them that we forget that we are using them at all. It may serve us well to stand back for a moment to review where, whe... | arxiv | @article{croll2007the,
title={The Importance and Criticality of Spreadsheets in the City of London},
author={Grenville J. Croll},
journal={Proc. European Spreadsheet Risks Int. Grp. (EuSpRIG) 2005 82-92
ISBN:1-902724-16-X},
year={2007},
archivePrefix={arXiv},
eprint={0709.4063},
primaryCla... | croll2007the |
arxiv-1258 | 0709.4087 | The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing | <|reference_start|>The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing: We consider embeddings of 3-regular graphs into 3-dimensional Cartesian coordinates, in such a way that two vertices are adjacent if and only if two of their three coordinates are equal (that is, if they lie on an axis-parallel line... | arxiv | @article{eppstein2007the,
title={The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing},
author={David Eppstein},
journal={J. Graph Algorithms & Applications 17(1): 35-55, 2013},
year={2007},
doi={10.7155/jgaa.00283},
archivePrefix={arXiv},
eprint={0709.4087},
primaryClass=... | eppstein2007the |
arxiv-1259 | 0709.4117 | Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton | <|reference_start|>Deciding Unambiguity and Sequentiality starting from a Finitely Ambiguous Max-Plus Automaton: Finite automata with weights in the max-plus semiring are considered. The main result is: it is decidable in an effective way whether a series that is recognized by a finitely ambiguous max-plus automaton is... | arxiv | @article{klimann2007deciding,
title={Deciding Unambiguity and Sequentiality starting from a Finitely
Ambiguous Max-Plus Automaton},
author={Ines Klimann (LIAFA), Sylvain Lombardy (LIAFA), Jean Mairesse (LIAFA),
Christophe Prieur (LIAFA)},
journal={Theoretical Computer Science 327, 3 (2004) 349-373},
... | klimann2007deciding |
arxiv-1260 | 0709.4118 | An efficient simulation algorithm based on abstract interpretation | <|reference_start|>An efficient simulation algorithm based on abstract interpretation: A number of algorithms for computing the simulation preorder are available. Let Sigma denote the state space, -> the transition relation and Psim the partition of Sigma induced by simulation equivalence. The algorithms by Henzinger, ... | arxiv | @article{ranzato2007an,
title={An efficient simulation algorithm based on abstract interpretation},
author={Francesco Ranzato and Francesco Tapparo},
journal={arXiv preprint arXiv:0709.4118},
year={2007},
archivePrefix={arXiv},
eprint={0709.4118},
primaryClass={cs.LO}
} | ranzato2007an |
arxiv-1261 | 0709.4263 | On Cobweb posets tiling problem | <|reference_start|>On Cobweb posets tiling problem: Kwasniewski's cobweb posets uniquely represented by directed acyclic graphs are such a generalization of the Fibonacci tree that allows joint combinatorial interpretation for all of them under admissibility condition. This interpretation was derived in the source pape... | arxiv | @article{dziemianczuk2007on,
title={On Cobweb posets tiling problem},
author={M. Dziemianczuk},
journal={Adv. Stud. Contemp. Math. volume 16 (2), 2008 (April) pp. 219-233},
year={2007},
archivePrefix={arXiv},
eprint={0709.4263},
primaryClass={math.CO cs.DM}
} | dziemianczuk2007on |
arxiv-1262 | 0709.4273 | Set Matrices and The Path/Cycle Problem | <|reference_start|>Set Matrices and The Path/Cycle Problem: Presentation of set matrices and demonstration of their efficiency as a tool using the path/cycle problem.<|reference_end|> | arxiv | @article{gubin2007set,
title={Set Matrices and The Path/Cycle Problem},
author={Sergey Gubin},
journal={arXiv preprint arXiv:0709.4273},
year={2007},
archivePrefix={arXiv},
eprint={0709.4273},
primaryClass={cs.DM cs.CC cs.DS math.CO}
} | gubin2007set |
arxiv-1263 | 0709.4280 | A converse to Moore's theorem on cellular automata | <|reference_start|>A converse to Moore's theorem on cellular automata: We prove a converse to Moore's ``Garden-of-Eden'' theorem: a group G is amenable if and only if all cellular automata living on G that admit mutually erasable patterns also admit gardens of Eden. It had already been conjectured in that amenability... | arxiv | @article{bartholdi2007a,
title={A converse to Moore's theorem on cellular automata},
author={Laurent Bartholdi},
journal={J. Eur. Math. Soc. 12 (2010), 241-248},
year={2007},
doi={10.471/JEMS/196},
archivePrefix={arXiv},
eprint={0709.4280},
primaryClass={math.CO cs.IT math.DS math.GR mat... | bartholdi2007a |
arxiv-1264 | 0709.4303 | Security Analyses of One-time System | <|reference_start|>Security Analyses of One-time System: This paper has been withdrawn<|reference_end|> | arxiv | @article{wang2007security,
title={Security Analyses of One-time System},
author={Yong Wang},
journal={arXiv preprint arXiv:0709.4303},
year={2007},
archivePrefix={arXiv},
eprint={0709.4303},
primaryClass={cs.CR}
} | wang2007security |
arxiv-1265 | 0709.4397 | The Parallel-Sequential Duality : Matrices and Graphs | <|reference_start|>The Parallel-Sequential Duality : Matrices and Graphs: Usually, mathematical objects have highly parallel interpretations. In this paper, we consider them as sequential constructors of other objects. In particular, we prove that every reflexive directed graph can be interpreted as a program that buil... | arxiv | @article{burckel2007the,
title={The Parallel-Sequential Duality : Matrices and Graphs},
author={Serge Burckel},
journal={arXiv preprint arXiv:0709.4397},
year={2007},
archivePrefix={arXiv},
eprint={0709.4397},
primaryClass={math.CO cs.IT math.IT}
} | burckel2007the |
arxiv-1266 | 0709.4420 | Confirmation of Shannon's Mistake about Perfect Secrecy of One-time-pad | <|reference_start|>Confirmation of Shannon's Mistake about Perfect Secrecy of One-time-pad: This paper has been withdrawn<|reference_end|> | arxiv | @article{wang2007confirmation,
title={Confirmation of Shannon's Mistake about Perfect Secrecy of One-time-pad},
author={Yong Wang},
journal={arXiv preprint arXiv:0709.4420},
year={2007},
archivePrefix={arXiv},
eprint={0709.4420},
primaryClass={cs.CR}
} | wang2007confirmation |
arxiv-1267 | 0709.4464 | Adaptive Investment Strategies For Periodic Environments | <|reference_start|>Adaptive Investment Strategies For Periodic Environments: In this paper, we present an adaptive investment strategy for environments with periodic returns on investment. In our approach, we consider an investment model where the agent decides at every time step the proportion of wealth to invest in a... | arxiv | @article{navarro2007adaptive,
title={Adaptive Investment Strategies For Periodic Environments},
author={J.-Emeterio Navarro},
journal={Advances in Complex Systems Vol. 11, No. 5 (2008) 761-787},
year={2007},
doi={10.1142/S0219525908001933},
archivePrefix={arXiv},
eprint={0709.4464},
prim... | navarro2007adaptive |
arxiv-1268 | 0709.4466 | Serially Concatenated IRA Codes | <|reference_start|>Serially Concatenated IRA Codes: We address the error floor problem of low-density parity check (LDPC) codes on the binary-input additive white Gaussian noise (AWGN) channel, by constructing a serially concatenated code consisting of two systematic irregular repeat accumulate (IRA) component codes co... | arxiv | @article{cheng2007serially,
title={Serially Concatenated IRA Codes},
author={Taikun Cheng, Krishnamoorthy Sivakumar, Benjamin J. Belzer},
journal={arXiv preprint arXiv:0709.4466},
year={2007},
archivePrefix={arXiv},
eprint={0709.4466},
primaryClass={cs.IT math.IT}
} | cheng2007serially |
arxiv-1269 | 0709.4497 | The complexity of nonrepetitive edge coloring of graphs | <|reference_start|>The complexity of nonrepetitive edge coloring of graphs: A squarefree word is a sequence $w$ of symbols such that there are no strings $x, y$, and $z$ for which $w=xyyz$. A nonrepetitive coloring of a graph is an edge coloring in which the sequence of colors along any open path is squarefree. We show... | arxiv | @article{manin2007the,
title={The complexity of nonrepetitive edge coloring of graphs},
author={Fedor Manin},
journal={arXiv preprint arXiv:0709.4497},
year={2007},
archivePrefix={arXiv},
eprint={0709.4497},
primaryClass={cs.CC cs.DM}
} | manin2007the |
arxiv-1270 | 0709.4506 | Optimum Diversity-Multiplexing Tradeoff in the Multiple Relays Network | <|reference_start|>Optimum Diversity-Multiplexing Tradeoff in the Multiple Relays Network: In this paper, a multiple-relay network in considered, in which $K$ single-antenna relays assist a single-antenna transmitter to communicate with a single-antenna receiver in a half-duplex mode. A new Amplify and Forward (AF) sch... | arxiv | @article{gharan2007optimum,
title={Optimum Diversity-Multiplexing Tradeoff in the Multiple Relays Network},
author={Shahab Oveis Gharan, Alireza Bayesteh, Amir K. khandani},
journal={arXiv preprint arXiv:0709.4506},
year={2007},
number={Technical Report UW-E&CE#2007-19, University of Waterloo, April... | gharan2007optimum |
arxiv-1271 | 0709.4513 | Scheduling and Pre-Conditioning in Multi-User MIMO TDD Systems | <|reference_start|>Scheduling and Pre-Conditioning in Multi-User MIMO TDD Systems: The downlink transmission in multi-user multiple-input multiple-output (MIMO) systems has been extensively studied from both communication-theoretic and information-theoretic perspectives. Most of these papers assume perfect/imperfect ch... | arxiv | @article{jose2007scheduling,
title={Scheduling and Pre-Conditioning in Multi-User MIMO TDD Systems},
author={Jubin Jose, Alexei Ashikhmin, Phil Whiting, Sriram Vishwanath},
journal={arXiv preprint arXiv:0709.4513},
year={2007},
archivePrefix={arXiv},
eprint={0709.4513},
primaryClass={cs.IT m... | jose2007scheduling |
arxiv-1272 | 0709.4552 | Distributed N-body Simulation on the Grid Using Dedicated Hardware | <|reference_start|>Distributed N-body Simulation on the Grid Using Dedicated Hardware: We present performance measurements of direct gravitational N -body simulation on the grid, with and without specialized (GRAPE-6) hardware. Our inter-continental virtual organization consists of three sites, one in Tokyo, one in Phi... | arxiv | @article{groen2007distributed,
title={Distributed N-body Simulation on the Grid Using Dedicated Hardware},
author={Derek Groen, Simon Portegies Zwart, Steve McMillan and Jun Makino},
journal={NewAstron.13:348-358,2008},
year={2007},
doi={10.1016/j.newast.2007.11.004},
archivePrefix={arXiv},
... | groen2007distributed |
arxiv-1273 | 0709.4558 | Practical Multiwriter Lock-Free Queues for "Hard Real-Time" Systems without CAS | <|reference_start|>Practical Multiwriter Lock-Free Queues for "Hard Real-Time" Systems without CAS: FIFO queues with a single reader and writer can be insufficient for "hard real-time" systems where interrupt handlers require wait-free guarantees when writing to message queues. We present an algorithm which elegantly a... | arxiv | @article{lee2007practical,
title={Practical Multiwriter Lock-Free Queues for "Hard Real-Time" Systems
without CAS},
author={Jeremy Lee},
journal={arXiv preprint arXiv:0709.4558},
year={2007},
archivePrefix={arXiv},
eprint={0709.4558},
primaryClass={cs.OS cs.DC}
} | lee2007practical |
arxiv-1274 | 0709.4565 | Topological Dynamics of 2D Cellular Automata | <|reference_start|>Topological Dynamics of 2D Cellular Automata: Topological dynamics of cellular automata (CA), inherited from classical dynamical systems theory, has been essentially studied in dimension 1. This paper focuses on 2D CA and aims at showing that the situation is different and more complex. The main resu... | arxiv | @article{sablik2007topological,
title={Topological Dynamics of 2D Cellular Automata},
author={Mathieu Sablik (UMPA-ENSL), Guillaume Theyssier (LM-Savoie)},
journal={4th Conference on Computability in Europe, CiE 2008, Athens :
Gr\`ece (2008)},
year={2007},
doi={10.1007/978-3-540-69407-6},
arch... | sablik2007topological |
arxiv-1275 | 0709.4655 | Mining for trees in a graph is NP-complete | <|reference_start|>Mining for trees in a graph is NP-complete: Mining for trees in a graph is shown to be NP-complete.<|reference_end|> | arxiv | @article{bussche2007mining,
title={Mining for trees in a graph is NP-complete},
author={Jan Van den Bussche},
journal={arXiv preprint arXiv:0709.4655},
year={2007},
archivePrefix={arXiv},
eprint={0709.4655},
primaryClass={cs.DB cs.AI}
} | bussche2007mining |
arxiv-1276 | 0709.4669 | The Extended Edit Distance Metric | <|reference_start|>The Extended Edit Distance Metric: Similarity search is an important problem in information retrieval. This similarity is based on a distance. Symbolic representation of time series has attracted many researchers recently, since it reduces the dimensionality of these high dimensional data objects. We... | arxiv | @article{fuad2007the,
title={The Extended Edit Distance Metric},
author={Muhammad Marwan Muhammad Fuad (VALORIA), Pierre-Franc{c}ois Marteau
(VALORIA)},
journal={Content-Based Multimedia Indexing, CBMI 2008, london : United
Kingdom (2008)},
year={2007},
doi={10.1109/CBMI.2008.4564953},
archi... | fuad2007the |
arxiv-1277 | 0709.4671 | Secrecy Capacity Region of a Multi-Antenna Gaussian Broadcast Channel with Confidential Messages | <|reference_start|>Secrecy Capacity Region of a Multi-Antenna Gaussian Broadcast Channel with Confidential Messages: In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise ... | arxiv | @article{liu2007secrecy,
title={Secrecy Capacity Region of a Multi-Antenna Gaussian Broadcast Channel
with Confidential Messages},
author={Ruoheng Liu and H. Vincent Poor},
journal={arXiv preprint arXiv:0709.4671},
year={2007},
archivePrefix={arXiv},
eprint={0709.4671},
primaryClass={cs.IT... | liu2007secrecy |
arxiv-1278 | 0710.0009 | Bio-linguistic transition and Baldwin effect in an evolutionary naming-game model | <|reference_start|>Bio-linguistic transition and Baldwin effect in an evolutionary naming-game model: We examine an evolutionary naming-game model where communicating agents are equipped with an evolutionarily selected learning ability. Such a coupling of biological and linguistic ingredients results in an abrupt trans... | arxiv | @article{lipowski2007bio-linguistic,
title={Bio-linguistic transition and Baldwin effect in an evolutionary
naming-game model},
author={Adam Lipowski and Dorota Lipowska},
journal={Int.J.Mod.Phys. C vol.19, pp. 399-407 (2008)},
year={2007},
doi={10.1142/S0129183108012248},
archivePrefix={arXiv... | lipowski2007bio-linguistic |
arxiv-1279 | 0710.0013 | Lagrangian Relaxation for MAP Estimation in Graphical Models | <|reference_start|>Lagrangian Relaxation for MAP Estimation in Graphical Models: We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an intractable estimation problem as one defined on a more tractable graph, ... | arxiv | @article{johnson2007lagrangian,
title={Lagrangian Relaxation for MAP Estimation in Graphical Models},
author={Jason K. Johnson, Dmitry M. Malioutov, Alan S. Willsky},
journal={arXiv preprint arXiv:0710.0013},
year={2007},
archivePrefix={arXiv},
eprint={0710.0013},
primaryClass={cs.AI}
} | johnson2007lagrangian |
arxiv-1280 | 0710.0020 | A Probability Model for Lifetime of Wireless Sensor Networks | <|reference_start|>A Probability Model for Lifetime of Wireless Sensor Networks: Considering a wireless sensor network whose nodes are distributed randomly over a given area, a probability model for the network lifetime is provided. Using this model and assuming that packet generation follows a Poisson distribution, an... | arxiv | @article{noori2007a,
title={A Probability Model for Lifetime of Wireless Sensor Networks},
author={Moslem Noori, Masoud Ardakani},
journal={arXiv preprint arXiv:0710.0020},
year={2007},
archivePrefix={arXiv},
eprint={0710.0020},
primaryClass={cs.NI}
} | noori2007a |
arxiv-1281 | 0710.0021 | New families of cryptographic systems | <|reference_start|>New families of cryptographic systems: A symmetric encryption method based on properties of quasicrystals is proposed. The advantages of the cipher are strict aperiodicity and everywhere discontinuous property as well as the speed of computation, simplicity of implementation and a straightforward pos... | arxiv | @article{nesterenko2007new,
title={New families of cryptographic systems},
author={Maryna Nesterenko, Jiri Patera, Dmytro Zhavrotskyj},
journal={arXiv preprint arXiv:0710.0021},
year={2007},
archivePrefix={arXiv},
eprint={0710.0021},
primaryClass={cs.CR math.GM}
} | nesterenko2007new |
arxiv-1282 | 0710.0043 | Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching | <|reference_start|>Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching: A recent paper \cite{CaeCaeSchBar06} proposed a provably optimal, polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal graphical model. Their fundamental... | arxiv | @article{mcauley2007graph,
title={Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching},
author={Julian J. McAuley, Tiberio S. Caetano and Marconi S. Barbosa},
journal={arXiv preprint arXiv:0710.0043},
year={2007},
archivePrefix={arXiv},
eprint={0710.0043},
primaryClass={cs.C... | mcauley2007graph |
arxiv-1283 | 0710.0083 | Sorting and Selection with Random Costs | <|reference_start|>Sorting and Selection with Random Costs: There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work is the first treatment of a natural stochastic variant of the problem where the cost of comparing two elements is a random variable. Each co... | arxiv | @article{angelov2007sorting,
title={Sorting and Selection with Random Costs},
author={Stanislav Angelov, Keshav Kunal, Andrew McGregor},
journal={arXiv preprint arXiv:0710.0083},
year={2007},
archivePrefix={arXiv},
eprint={0710.0083},
primaryClass={cs.DS}
} | angelov2007sorting |
arxiv-1284 | 0710.0105 | Zipf's Law and Avoidance of Excessive Synonymy | <|reference_start|>Zipf's Law and Avoidance of Excessive Synonymy: Zipf's law states that if words of language are ranked in the order of decreasing frequency in texts, the frequency of a word is inversely proportional to its rank. It is very robust as an experimental observation, but to date it escaped satisfactory th... | arxiv | @article{manin2007zipf's,
title={Zipf's Law and Avoidance of Excessive Synonymy},
author={Dmitrii Manin},
journal={Main text in Cognitive Science, 32 (7) 2008, pp. 1075 - 1098;
Appendix A TBP separately in J. Quant. Ling.},
year={2007},
doi={10.1080/03640210802020003},
archivePrefix={arXiv},
... | manin2007zipf's |
arxiv-1285 | 0710.0116 | Distributed MIMO receiver - Achievable rates and upper bounds | <|reference_start|>Distributed MIMO receiver - Achievable rates and upper bounds: In this paper we investigate the achievable rate of a system that includes a nomadic transmitter with several antennas, which is received by multiple agents, exhibiting independent channel gains and additive circular-symmetric complex Gau... | arxiv | @article{sanderovich2007distributed,
title={Distributed MIMO receiver - Achievable rates and upper bounds},
author={Amichai Sanderovich, Shlomo Shamai (Shitz) and Yossef Steinberg},
journal={arXiv preprint arXiv:0710.0116},
year={2007},
archivePrefix={arXiv},
eprint={0710.0116},
primaryClass... | sanderovich2007distributed |
arxiv-1286 | 0710.0142 | LDPC codes in the McEliece cryptosystem: attacks and countermeasures | <|reference_start|>LDPC codes in the McEliece cryptosystem: attacks and countermeasures: The McEliece cryptosystem is a public-key cryptosystem based on coding theory that has successfully resisted cryptanalysis for thirty years. The original version, based on Goppa codes, is able to guarantee a high level of security,... | arxiv | @article{baldi2007ldpc,
title={LDPC codes in the McEliece cryptosystem: attacks and countermeasures},
author={Marco Baldi},
journal={NATO Science for Peace and Security Series - D: Information and
Communication Security, vol. 23, pp. 160-174, IOS Press, 2009. Edited by Bart
Preneel, Stefan Dodunekov, Vi... | baldi2007ldpc |
arxiv-1287 | 0710.0169 | Evaluation experiments on related terms search in Wikipedia: Information Content and Adapted HITS (In Russian) | <|reference_start|>Evaluation experiments on related terms search in Wikipedia: Information Content and Adapted HITS (In Russian): The classification of metrics and algorithms search for related terms via WordNet, Roget's Thesaurus, and Wikipedia was extended to include adapted HITS algorithm. Evaluation experiments on... | arxiv | @article{krizhanovsky2007evaluation,
title={Evaluation experiments on related terms search in Wikipedia: Information
Content and Adapted HITS (In Russian)},
author={A. A. Krizhanovsky},
journal={arXiv preprint arXiv:0710.0169},
year={2007},
archivePrefix={arXiv},
eprint={0710.0169},
primar... | krizhanovsky2007evaluation |
arxiv-1288 | 0710.0192 | Binary quantization using Belief Propagation with decimation over factor graphs of LDGM codes | <|reference_start|>Binary quantization using Belief Propagation with decimation over factor graphs of LDGM codes: We propose a new algorithm for binary quantization based on the Belief Propagation algorithm with decimation over factor graphs of Low Density Generator Matrix (LDGM) codes. This algorithm, which we call Bi... | arxiv | @article{filler2007binary,
title={Binary quantization using Belief Propagation with decimation over factor
graphs of LDGM codes},
author={Tomas Filler and Jessica Fridrich},
journal={arXiv preprint arXiv:0710.0192},
year={2007},
archivePrefix={arXiv},
eprint={0710.0192},
primaryClass={cs.I... | filler2007binary |
arxiv-1289 | 0710.0198 | Z4-Linear Perfect Codes | <|reference_start|>Z4-Linear Perfect Codes: For every $n = 2^k > 8$ there exist exactly $[(k+1)/2]$ mutually nonequivalent $Z_4$-linear extended perfect codes with distance 4. All these codes have different ranks.<|reference_end|> | arxiv | @article{krotov2007z4-linear,
title={Z4-Linear Perfect Codes},
author={Denis Krotov (Sobolev Institute of Mathematics, Novosibirsk, Russia)},
journal={transl. from: Diskretn. Anal. Issled. Oper. Ser.1., 7(4) 2000,
78-90 [Russian]},
year={2007},
archivePrefix={arXiv},
eprint={0710.0198},
pr... | krotov2007z4-linear |
arxiv-1290 | 0710.0199 | Z4-linear Hadamard and extended perfect codes | <|reference_start|>Z4-linear Hadamard and extended perfect codes: If $N=2^k > 8$ then there exist exactly $[(k-1)/2]$ pairwise nonequivalent $Z_4$-linear Hadamard $(N,2N,N/2)$-codes and $[(k+1)/2]$ pairwise nonequivalent $Z_4$-linear extended perfect $(N,2^N/2N,4)$-codes. A recurrent construction of $Z_4$-linear Hadama... | arxiv | @article{krotov2007z4-linear,
title={Z4-linear Hadamard and extended perfect codes},
author={Denis Krotov (Sobolev Institute of Mathematics, Novosibirsk, Russia)},
journal={Electron. Notes Discrete Math. 6 (2001) 107-112},
year={2007},
doi={10.1016/S1571-0653(04)00161-1},
archivePrefix={arXiv},
... | krotov2007z4-linear |
arxiv-1291 | 0710.0213 | Optimising the topology of complex neural networks | <|reference_start|>Optimising the topology of complex neural networks: In this paper, we study instances of complex neural networks, i.e. neural netwo rks with complex topologies. We use Self-Organizing Map neural networks whose n eighbourhood relationships are defined by a complex network, to classify handwr itten dig... | arxiv | @article{jiang2007optimising,
title={Optimising the topology of complex neural networks},
author={Fei Jiang (INRIA Futurs, INRIA Futurs), Hugues Berry (INRIA Futurs),
Marc Schoenauer (INRIA Futurs)},
journal={Dans ECCS'07 (2007)},
year={2007},
archivePrefix={arXiv},
eprint={0710.0213},
pri... | jiang2007optimising |
arxiv-1292 | 0710.0225 | On the role of autocorrelations in texts | <|reference_start|>On the role of autocorrelations in texts: The task of finding a criterion allowing to distinguish a text from an arbitrary set of words is rather relevant in itself, for instance, in the aspect of development of means for internet-content indexing or separating signals and noise in communication chan... | arxiv | @article{lande2007on,
title={On the role of autocorrelations in texts},
author={D.V. Lande, A.A. Snarskii},
journal={arXiv preprint arXiv:0710.0225},
year={2007},
archivePrefix={arXiv},
eprint={0710.0225},
primaryClass={cs.CL}
} | lande2007on |
arxiv-1293 | 0710.0228 | On the fractal nature of mutual relevance sequences in the Internet news message flows | <|reference_start|>On the fractal nature of mutual relevance sequences in the Internet news message flows: In the task of information retrieval the term relevance is taken to mean formal conformity of a document given by the retrieval system to user's information query. As a rule, the documents found by the retrieval s... | arxiv | @article{braichevsky2007on,
title={On the fractal nature of mutual relevance sequences in the Internet news
message flows},
author={S. Braichevsky, D. Lande, A. Snarskii},
journal={arXiv preprint arXiv:0710.0228},
year={2007},
archivePrefix={arXiv},
eprint={0710.0228},
primaryClass={cs.CL}... | braichevsky2007on |
arxiv-1294 | 0710.0232 | Constructing a uniform plane-filling path in the ternary heptagrid of the hyperbolic plane | <|reference_start|>Constructing a uniform plane-filling path in the ternary heptagrid of the hyperbolic plane: In this paper, we distinguish two levels for the plane-filling property. We consider a simple and a strong one. In this paper, we give the construction which proves that the simple plane-filling property also ... | arxiv | @article{margenstern2007constructing,
title={Constructing a uniform plane-filling path in the ternary heptagrid of
the hyperbolic plane},
author={Maurice Margenstern},
journal={arXiv preprint arXiv:0710.0232},
year={2007},
archivePrefix={arXiv},
eprint={0710.0232},
primaryClass={cs.CG cs.D... | margenstern2007constructing |
arxiv-1295 | 0710.0243 | High-Order Nonparametric Belief-Propagation for Fast Image Inpainting | <|reference_start|>High-Order Nonparametric Belief-Propagation for Fast Image Inpainting: In this paper, we use belief-propagation techniques to develop fast algorithms for image inpainting. Unlike traditional gradient-based approaches, which may require many iterations to converge, our techniques achieve competitive r... | arxiv | @article{mcauley2007high-order,
title={High-Order Nonparametric Belief-Propagation for Fast Image Inpainting},
author={Julian John McAuley, Tiberio S. Caetano},
journal={arXiv preprint arXiv:0710.0243},
year={2007},
archivePrefix={arXiv},
eprint={0710.0243},
primaryClass={cs.CV}
} | mcauley2007high-order |
arxiv-1296 | 0710.0244 | Theoretical Engineering and Satellite Comlink of a PTVD-SHAM System | <|reference_start|>Theoretical Engineering and Satellite Comlink of a PTVD-SHAM System: This paper focuses on super helical memory system's design, 'Engineering, Architectural and Satellite Communications' as a theoretical approach of an invention-model to 'store time-data'. The current release entails three concepts: ... | arxiv | @article{alipour2007theoretical,
title={Theoretical Engineering and Satellite Comlink of a PTVD-SHAM System},
author={Philip B. Alipour},
journal={arXiv preprint arXiv:0710.0244},
year={2007},
archivePrefix={arXiv},
eprint={0710.0244},
primaryClass={cs.CE cs.AR}
} | alipour2007theoretical |
arxiv-1297 | 0710.0262 | Incomplete Lineage Sorting: Consistent Phylogeny Estimation From Multiple Loci | <|reference_start|>Incomplete Lineage Sorting: Consistent Phylogeny Estimation From Multiple Loci: We introduce a simple algorithm for reconstructing phylogenies from multiple gene trees in the presence of incomplete lineage sorting, that is, when the topology of the gene trees may differ from that of the species tree.... | arxiv | @article{mossel2007incomplete,
title={Incomplete Lineage Sorting: Consistent Phylogeny Estimation From
Multiple Loci},
author={Elchanan Mossel and Sebastien Roch},
journal={arXiv preprint arXiv:0710.0262},
year={2007},
archivePrefix={arXiv},
eprint={0710.0262},
primaryClass={q-bio.PE cs.CE... | mossel2007incomplete |
arxiv-1298 | 0710.0270 | An Analytical Study of a Structured Overlay in the presence of Dynamic Membership | <|reference_start|>An Analytical Study of a Structured Overlay in the presence of Dynamic Membership: In this paper we present an analytical study of dynamic membership (aka churn) in structured peer-to-peer networks. We use a fluid model approach to describe steady-state or transient phenomena, and apply it to the Cho... | arxiv | @article{krishnamurthy2007an,
title={An Analytical Study of a Structured Overlay in the presence of Dynamic
Membership},
author={Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurell and Seif Haridi},
journal={arXiv preprint arXiv:0710.0270},
year={2007},
doi={10.1109/TNET.2007.905590},
archiveP... | krishnamurthy2007an |
arxiv-1299 | 0710.0291 | On Outage Behavior of Wideband Slow-Fading Channels | <|reference_start|>On Outage Behavior of Wideband Slow-Fading Channels: This paper investigates point-to-point information transmission over a wideband slow-fading channel, modeled as an (asymptotically) large number of independent identically distributed parallel channels, with the random channel fading realizations r... | arxiv | @article{zhang2007on,
title={On Outage Behavior of Wideband Slow-Fading Channels},
author={Wenyi Zhang, Urbashi Mitra},
journal={arXiv preprint arXiv:0710.0291},
year={2007},
archivePrefix={arXiv},
eprint={0710.0291},
primaryClass={cs.IT math.IT}
} | zhang2007on |
arxiv-1300 | 0710.0318 | Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough? | <|reference_start|>Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best one good enough?: The Metric Traveling Salesman Problem (TSP) is a classical NP-hard optimization problem. The double-tree shortcutting method for Metric TSP yields an exponentially-sized space of TSP tours, each of which approx... | arxiv | @article{deineko2007fast,
title={Fast minimum-weight double-tree shortcutting for Metric TSP: Is the best
one good enough?},
author={Vladimir Deineko and Alexander Tiskin},
journal={arXiv preprint arXiv:0710.0318},
year={2007},
archivePrefix={arXiv},
eprint={0710.0318},
primaryClass={cs.DS... | deineko2007fast |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.