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-1101 | 0708.4407 | Algebraic Distributed Differential Space-Time Codes with Low Decoding Complexity | <|reference_start|>Algebraic Distributed Differential Space-Time Codes with Low Decoding Complexity: The differential encoding/decoding setup introduced by Kiran et al, Oggier-Hassibi and Jing-Jafarkhani for wireless relay networks that use codebooks consisting of unitary matrices is extended to allow codebooks consist... | arxiv | @article{rajan2007algebraic,
title={Algebraic Distributed Differential Space-Time Codes with Low Decoding
Complexity},
author={G. Susinder Rajan and B. Sundar Rajan},
journal={arXiv preprint arXiv:0708.4407},
year={2007},
archivePrefix={arXiv},
eprint={0708.4407},
primaryClass={cs.IT cs.DM... | rajan2007algebraic |
arxiv-1102 | 0708.4409 | Characterizations of finite and infinite episturmian words via lexicographic orderings | <|reference_start|>Characterizations of finite and infinite episturmian words via lexicographic orderings: In this paper, we characterize by lexicographic order all finite Sturmian and episturmian words, i.e., all (finite) factors of such infinite words. Consequently, we obtain a characterization of infinite episturmia... | arxiv | @article{glen2007characterizations,
title={Characterizations of finite and infinite episturmian words via
lexicographic orderings},
author={Amy Glen, Jacques Justin, Giuseppe Pirillo},
journal={European Journal of Combinatorics 29 (2008) 45-58},
year={2007},
doi={10.1016/j.ejc.2007.01.002},
ar... | glen2007characterizations |
arxiv-1103 | 0709.0035 | On The Limitations of The Naive Lattice Decoding | <|reference_start|>On The Limitations of The Naive Lattice Decoding: In this paper, the inherent drawbacks of the naive lattice decoding for MIMO fading systems is investigated. We show that using the naive lattice decoding for MIMO systems has considerable deficiencies in terms of the rate-diversity trade-off. Unlike ... | arxiv | @article{taherzadeh2007on,
title={On The Limitations of The Naive Lattice Decoding},
author={Mahmoud Taherzadeh and Amir K. Khandani},
journal={arXiv preprint arXiv:0709.0035},
year={2007},
archivePrefix={arXiv},
eprint={0709.0035},
primaryClass={cs.IT math.IT}
} | taherzadeh2007on |
arxiv-1104 | 0709.0099 | The road coloring problem | <|reference_start|>The road coloring problem: The synchronizing word of deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of edges of a directed graph is synchronizing if the coloring turns the graph into deterministic ... | arxiv | @article{trahtman2007the,
title={The road coloring problem},
author={A. N. Trahtman},
journal={arXiv preprint arXiv:0709.0099},
year={2007},
archivePrefix={arXiv},
eprint={0709.0099},
primaryClass={cs.DM}
} | trahtman2007the |
arxiv-1105 | 0709.0116 | On Ultrametric Algorithmic Information | <|reference_start|>On Ultrametric Algorithmic Information: How best to quantify the information of an object, whether natural or artifact, is a problem of wide interest. A related problem is the computability of an object. We present practical examples of a new way to address this problem. By giving an appropriate repr... | arxiv | @article{murtagh2007on,
title={On Ultrametric Algorithmic Information},
author={Fionn Murtagh},
journal={Computer Journal, 53, 405-416, 2010},
year={2007},
doi={10.1093/comjnl/bxm084},
archivePrefix={arXiv},
eprint={0709.0116},
primaryClass={cs.AI cs.CL}
} | murtagh2007on |
arxiv-1106 | 0709.0124 | High Rate Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks | <|reference_start|>High Rate Single-Symbol ML Decodable Precoded DSTBCs for Cooperative Networks: Distributed Orthogonal Space-Time Block Codes (DOSTBCs) achieving full diversity order and single-symbol ML decodability have been introduced recently by Yi and Kim for cooperative networks and an upperbound on the maximal... | arxiv | @article{j.2007high,
title={High Rate Single-Symbol ML Decodable Precoded DSTBCs for Cooperative
Networks},
author={Harshan J. and B. Sundar Rajan},
journal={arXiv preprint arXiv:0709.0124},
year={2007},
archivePrefix={arXiv},
eprint={0709.0124},
primaryClass={cs.IT math.IT}
} | j.2007high |
arxiv-1107 | 0709.0145 | Estimating Random Variables from Random Sparse Observations | <|reference_start|>Estimating Random Variables from Random Sparse Observations: Let X_1,...., X_n be a collection of iid discrete random variables, and Y_1,..., Y_m a set of noisy observations of such variables. Assume each observation Y_a to be a random function of some a random subset of the X_i's, and consider the c... | arxiv | @article{montanari2007estimating,
title={Estimating Random Variables from Random Sparse Observations},
author={Andrea Montanari},
journal={arXiv preprint arXiv:0709.0145},
year={2007},
archivePrefix={arXiv},
eprint={0709.0145},
primaryClass={cs.IT math.IT math.PR}
} | montanari2007estimating |
arxiv-1108 | 0709.0170 | Untangling a Planar Graph | <|reference_start|>Untangling a Planar Graph: A straight-line drawing $\delta$ of a planar graph $G$ need not be plane, but can be made so by \emph{untangling} it, that is, by moving some of the vertices of $G$. Let shift$(G,\delta)$ denote the minimum number of vertices that need to be moved to untangle $\delta$. We s... | arxiv | @article{goaoc2007untangling,
title={Untangling a Planar Graph},
author={Xavier Goaoc and Jan Kratochvil and Yoshio Okamoto and Chan-Su Shin
and Andreas Spillner and Alexander Wolff},
journal={arXiv preprint arXiv:0709.0170},
year={2007},
doi={10.1007/s00454-008-9130-6},
archivePrefix={arXiv},... | goaoc2007untangling |
arxiv-1109 | 0709.0178 | Effective Generation of Subjectively Random Binary Sequences | <|reference_start|>Effective Generation of Subjectively Random Binary Sequences: We present an algorithm for effectively generating binary sequences which would be rated by people as highly likely to have been generated by a random process, such as flipping a fair coin.<|reference_end|> | arxiv | @article{sanderson2007effective,
title={Effective Generation of Subjectively Random Binary Sequences},
author={Yasmine B. Sanderson},
journal={arXiv preprint arXiv:0709.0178},
year={2007},
archivePrefix={arXiv},
eprint={0709.0178},
primaryClass={cs.HC cs.AI}
} | sanderson2007effective |
arxiv-1110 | 0709.0204 | Capacity constraints and the inevitability of mediators in adword auctions | <|reference_start|>Capacity constraints and the inevitability of mediators in adword auctions: One natural constraint in the sponsored search advertising framework arises from the fact that there is a limit on the number of available slots, especially for the popular keywords, and as a result, a significant pool of adv... | arxiv | @article{singh2007capacity,
title={Capacity constraints and the inevitability of mediators in adword
auctions},
author={Sudhir Kumar Singh, Vwani P. Roychowdhury, Himawan Gunadhi, Behnam A.
Rezaei},
journal={arXiv preprint arXiv:0709.0204},
year={2007},
archivePrefix={arXiv},
eprint={0709.02... | singh2007capacity |
arxiv-1111 | 0709.0218 | Inferring Neuronal Network Connectivity using Time-constrained Episodes | <|reference_start|>Inferring Neuronal Network Connectivity using Time-constrained Episodes: Discovering frequent episodes in event sequences is an interesting data mining task. In this paper, we argue that this framework is very effective for analyzing multi-neuronal spike train data. Analyzing spike train data is an i... | arxiv | @article{patnaik2007inferring,
title={Inferring Neuronal Network Connectivity using Time-constrained Episodes},
author={Debprakash Patnaik (Electrical Engg. Dept., Indian Institute of
Science), P. S. Sastry (Electrical Engg. Dept., Indian Institute of Science),
K. P. Unnikrishnan (General Motors R&D)},
... | patnaik2007inferring |
arxiv-1112 | 0709.0223 | Brief encounter networks | <|reference_start|>Brief encounter networks: Many complex human and natural phenomena can usefully be represented as networks describing the relationships between individuals. While these relationships are typically intermittent, previous research has used network representations that aggregate the relationships at dis... | arxiv | @article{kostakos2007brief,
title={Brief encounter networks},
author={Vassilis Kostakos, Eamonn O'Neill, Alan Penn},
journal={ACM Transactions on Computer Human Interaction, 17(1):1-38, 2010},
year={2007},
doi={10.1145/1721831.1721833},
archivePrefix={arXiv},
eprint={0709.0223},
primaryC... | kostakos2007brief |
arxiv-1113 | 0709.0259 | Spectrum Sensing in Wideband OFDM Cognitive Radios | <|reference_start|>Spectrum Sensing in Wideband OFDM Cognitive Radios: In this paper, detection of the primary user (PU) signal in an orthogonal frequency division multiplexing (OFDM) based cognitive radio (CR) system is addressed. According to the prior knowledge of the PU signal known to the detector, three detection... | arxiv | @article{hwang2007spectrum,
title={Spectrum Sensing in Wideband OFDM Cognitive Radios},
author={Chien-Hwa Hwang and Shih-Chang Chen},
journal={arXiv preprint arXiv:0709.0259},
year={2007},
archivePrefix={arXiv},
eprint={0709.0259},
primaryClass={cs.IT math.IT}
} | hwang2007spectrum |
arxiv-1114 | 0709.0289 | Cryptography in the Bounded-Quantum-Storage Model | <|reference_start|>Cryptography in the Bounded-Quantum-Storage Model: This thesis initiates the study of cryptographic protocols in the bounded-quantum-storage model. On the practical side, simple protocols for Rabin Oblivious Transfer, 1-2 Oblivious Transfer and Bit Commitment are presented. No quantum memory is requi... | arxiv | @article{schaffner2007cryptography,
title={Cryptography in the Bounded-Quantum-Storage Model},
author={Christian Schaffner},
journal={arXiv preprint arXiv:0709.0289},
year={2007},
archivePrefix={arXiv},
eprint={0709.0289},
primaryClass={quant-ph cs.CR}
} | schaffner2007cryptography |
arxiv-1115 | 0709.0303 | Navigability of Complex Networks | <|reference_start|>Navigability of Complex Networks: Routing information through networks is a universal phenomenon in both natural and manmade complex systems. When each node has full knowledge of the global network connectivity, finding short communication paths is merely a matter of distributed computation. However,... | arxiv | @article{boguna2007navigability,
title={Navigability of Complex Networks},
author={Marian Boguna, Dmitri Krioukov, kc claffy},
journal={Nature Physics 5, 74-80 (2009)},
year={2007},
doi={10.1038/NPHYS1130},
archivePrefix={arXiv},
eprint={0709.0303},
primaryClass={physics.soc-ph cond-mat.... | boguna2007navigability |
arxiv-1116 | 0709.0355 | Solution of moving-boundary problems by the spectral element method | <|reference_start|>Solution of moving-boundary problems by the spectral element method: This paper describes a novel numerical model aiming at solving moving-boundary problems such as free-surface flows or fluid-structure interaction. This model uses a moving-grid technique to solve the Navier--Stokes equations express... | arxiv | @article{bodard2007solution,
title={Solution of moving-boundary problems by the spectral element method},
author={Nicolas Bodard, Roland Bouffanais, Michel O. Deville},
journal={Applied Numerial Mathematics 58 (2008) 968-984},
year={2007},
doi={10.1016/j.apnum.2007.04.009},
archivePrefix={arXiv}... | bodard2007solution |
arxiv-1117 | 0709.0367 | Relationship between clustering and algorithmic phase transitions in the random k-XORSAT model and its NP-complete extensions | <|reference_start|>Relationship between clustering and algorithmic phase transitions in the random k-XORSAT model and its NP-complete extensions: We study the performances of stochastic heuristic search algorithms on Uniquely Extendible Constraint Satisfaction Problems with random inputs. We show that, for any heuristi... | arxiv | @article{altarelli2007relationship,
title={Relationship between clustering and algorithmic phase transitions in the
random k-XORSAT model and its NP-complete extensions},
author={Fabrizio Altarelli, Remi Monasson and Francesco Zamponi},
journal={Journal of Physics: Conference Series 95 (2008) 012013},
... | altarelli2007relationship |
arxiv-1118 | 0709.0370 | An Integrated Simulation System for Human Factors Study | <|reference_start|>An Integrated Simulation System for Human Factors Study: It has been reported that virtual reality can be a useful tool for ergonomics study. The proposed integrated simulation system aims at measuring operator's performance in an interactive way for 2D control panel design. By incorporating some sop... | arxiv | @article{wang2007an,
title={An Integrated Simulation System for Human Factors Study},
author={Ying Wang (DIE), Wei Zhang (DIE), Fouad Bennis (IRCCyN), Damien
Chablat (IRCCyN)},
journal={Dans The Institute of Industrial Engineers Annual Conference - The
Institute of Industrial Engineers Annual Conference... | wang2007an |
arxiv-1119 | 0709.0409 | A DH-parameter based condition for 3R orthogonal manipulators to have 4 distinct inverse kinematic solutions | <|reference_start|>A DH-parameter based condition for 3R orthogonal manipulators to have 4 distinct inverse kinematic solutions: Positioning 3R manipulators may have two or four inverse kinematic solutions (IKS). This paper derives a necessary and sufficient condition for 3R positioning manipulators with orthogonal joi... | arxiv | @article{wenger2007a,
title={A DH-parameter based condition for 3R orthogonal manipulators to have 4
distinct inverse kinematic solutions},
author={Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN), Maher Baili
(IRCCyN)},
journal={Journal of Mechanical Design 127 (2005) 150-155},
year={2007},
ar... | wenger2007a |
arxiv-1120 | 0709.0426 | Do oral messages help visual search? | <|reference_start|>Do oral messages help visual search?: A preliminary experimental study is presented, that aims at eliciting the contribution of oral messages to facilitating visual search tasks on crowded visual displays. Results of quantitative and qualitative analyses suggest that appropriate verbal messages can i... | arxiv | @article{carbonell2007do,
title={Do oral messages help visual search?},
author={No"elle Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA),
Suzanne Kieffer (INRIA Rocquencourt / INRIA Lorraine - LORIA)},
journal={Advances in Natural Multimodal Dialogue Systems, Dordrecht (NL)
Springer (Ed.) (2005) ... | carbonell2007do |
arxiv-1121 | 0709.0428 | Oral messages improve visual search | <|reference_start|>Oral messages improve visual search: Input multimodality combining speech and hand gestures has motivated numerous usability studies. Contrastingly, issues relating to the design and ergonomic evaluation of multimodal output messages combining speech with visual modalities have not yet been addressed... | arxiv | @article{kieffer2007oral,
title={Oral messages improve visual search},
author={Suzanne Kieffer (INRIA Rocquencourt / INRIA Lorraine - LORIA),
No"elle Carbonell (INRIA Rocquencourt / INRIA Lorraine - LORIA)},
journal={Dans Proceedings of ACM Working Conference on Advanced Visual
Interfaces - ACM Working ... | kieffer2007oral |
arxiv-1122 | 0709.0435 | A Generic Approach to Coalition Formation | <|reference_start|>A Generic Approach to Coalition Formation: We propose an abstract approach to coalition formation that focuses on simple merge and split rules transforming partitions of a group of players. We identify conditions under which every iteration of these rules yields a unique partition. The main conceptua... | arxiv | @article{apt2007a,
title={A Generic Approach to Coalition Formation},
author={Krzysztof R. Apt and Andreas Witzel},
journal={arXiv preprint arXiv:0709.0435},
year={2007},
archivePrefix={arXiv},
eprint={0709.0435},
primaryClass={cs.GT}
} | apt2007a |
arxiv-1123 | 0709.0446 | Logic Column 19: Symbolic Model Checking for Temporal-Epistemic Logics | <|reference_start|>Logic Column 19: Symbolic Model Checking for Temporal-Epistemic Logics: This article surveys some of the recent work in verification of temporal epistemic logic via symbolic model checking, focusing on OBDD-based and SAT-based approaches for epistemic logics built on discrete and real-time branching ... | arxiv | @article{lomuscio2007logic,
title={Logic Column 19: Symbolic Model Checking for Temporal-Epistemic Logics},
author={Alessio Lomuscio and Wojciech Penczek},
journal={arXiv preprint arXiv:0709.0446},
year={2007},
archivePrefix={arXiv},
eprint={0709.0446},
primaryClass={cs.LO}
} | lomuscio2007logic |
arxiv-1124 | 0709.0492 | Composable Security in the Bounded-Quantum-Storage Model | <|reference_start|>Composable Security in the Bounded-Quantum-Storage Model: We present a simplified framework for proving sequential composability in the quantum setting. In particular, we give a new, simulation-based, definition for security in the bounded-quantum-storage model, and show that this definition allows f... | arxiv | @article{wehner2007composable,
title={Composable Security in the Bounded-Quantum-Storage Model},
author={Stephanie Wehner, J"urg Wullschleger},
journal={Proceedings of ICALP 2008, pages 604--615},
year={2007},
archivePrefix={arXiv},
eprint={0709.0492},
primaryClass={quant-ph cs.CR}
} | wehner2007composable |
arxiv-1125 | 0709.0509 | Filtering Additive Measurement Noise with Maximum Entropy in the Mean | <|reference_start|>Filtering Additive Measurement Noise with Maximum Entropy in the Mean: The purpose of this note is to show how the method of maximum entropy in the mean (MEM) may be used to improve parametric estimation when the measurements are corrupted by large level of noise. The method is developed in the conte... | arxiv | @article{gzyl2007filtering,
title={Filtering Additive Measurement Noise with Maximum Entropy in the Mean},
author={Henryk Gzyl and Enrique ter Horst},
journal={arXiv preprint arXiv:0709.0509},
year={2007},
archivePrefix={arXiv},
eprint={0709.0509},
primaryClass={cs.LG}
} | gzyl2007filtering |
arxiv-1126 | 0709.0511 | Double Clustering and Graph Navigability | <|reference_start|>Double Clustering and Graph Navigability: Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to meet strict criteria. Since such graphs nevertheless seem to appear in nature, it is... | arxiv | @article{sandberg2007double,
title={Double Clustering and Graph Navigability},
author={Oskar Sandberg},
journal={arXiv preprint arXiv:0709.0511},
year={2007},
archivePrefix={arXiv},
eprint={0709.0511},
primaryClass={math.PR cs.DS math.CO}
} | sandberg2007double |
arxiv-1127 | 0709.0516 | Competition in Wireless Systems via Bayesian Interference Games | <|reference_start|>Competition in Wireless Systems via Bayesian Interference Games: We study competition between wireless devices with incomplete information about their opponents. We model such interactions as Bayesian interference games. Each wireless device selects a power profile over the entire available bandwidth... | arxiv | @article{adlakha2007competition,
title={Competition in Wireless Systems via Bayesian Interference Games},
author={Sachin Adlakha, Ramesh Johari and Andrea Goldsmith},
journal={arXiv preprint arXiv:0709.0516},
year={2007},
archivePrefix={arXiv},
eprint={0709.0516},
primaryClass={cs.GT}
} | adlakha2007competition |
arxiv-1128 | 0709.0518 | Rate Regions for the Partially-Cooperative Relay Broadcast Channel with Non-causal Side Information | <|reference_start|>Rate Regions for the Partially-Cooperative Relay Broadcast Channel with Non-causal Side Information: In this work, we consider a partially cooperative relay broadcast channel (PC-RBC) controlled by random parameters. We provide rate regions for two different situations: 1) when side information (SI) ... | arxiv | @article{zaidi2007rate,
title={Rate Regions for the Partially-Cooperative Relay Broadcast Channel with
Non-causal Side Information},
author={A. Zaidi and L. Vandendorpe},
journal={arXiv preprint arXiv:0709.0518},
year={2007},
archivePrefix={arXiv},
eprint={0709.0518},
primaryClass={cs.IT m... | zaidi2007rate |
arxiv-1129 | 0709.0522 | Qualitative Belief Conditioning Rules (QBCR) | <|reference_start|>Qualitative Belief Conditioning Rules (QBCR): In this paper we extend the new family of (quantitative) Belief Conditioning Rules (BCR) recently developed in the Dezert-Smarandache Theory (DSmT) to their qualitative counterpart for belief revision. Since the revision of quantitative as well as qualita... | arxiv | @article{smarandache2007qualitative,
title={Qualitative Belief Conditioning Rules (QBCR)},
author={Florentin Smarandache, Jean Dezert},
journal={Proceedings of Fusion 2007 International Conference, Quebec City,
Canada, July 2007},
year={2007},
archivePrefix={arXiv},
eprint={0709.0522},
pri... | smarandache2007qualitative |
arxiv-1130 | 0709.0566 | Discovering Patterns in Multi-neuronal Spike Trains using the Frequent Episode Method | <|reference_start|>Discovering Patterns in Multi-neuronal Spike Trains using the Frequent Episode Method: Discovering the 'Neural Code' from multi-neuronal spike trains is an important task in neuroscience. For such an analysis, it is important to unearth interesting regularities in the spiking patterns. In this report... | arxiv | @article{unnikrishnan2007discovering,
title={Discovering Patterns in Multi-neuronal Spike Trains using the Frequent
Episode Method},
author={K.P.Unnikrishnan (General Motors R&D Center, Warren, MI), Debprakash
Patnaik (Dept. Elecetrical Engineering, Indian Institute of Science,
Bangalore), P.S.Sastry (Dep... | unnikrishnan2007discovering |
arxiv-1131 | 0709.0599 | On Universal Properties of Capacity-Approaching LDPC Ensembles | <|reference_start|>On Universal Properties of Capacity-Approaching LDPC Ensembles: This paper is focused on the derivation of some universal properties of capacity-approaching low-density parity-check (LDPC) code ensembles whose transmission takes place over memoryless binary-input output-symmetric (MBIOS) channels. Pr... | arxiv | @article{sason2007on,
title={On Universal Properties of Capacity-Approaching LDPC Ensembles},
author={Igal Sason},
journal={arXiv preprint arXiv:0709.0599},
year={2007},
doi={10.1109/TIT.2009.2021305},
archivePrefix={arXiv},
eprint={0709.0599},
primaryClass={cs.IT math.IT}
} | sason2007on |
arxiv-1132 | 0709.0624 | On Faster Integer Calculations using Non-Arithmetic Primitives | <|reference_start|>On Faster Integer Calculations using Non-Arithmetic Primitives: The unit cost model is both convenient and largely realistic for describing integer decision algorithms over (+,*). Additional operations like division with remainder or bitwise conjunction, although equally supported by computing hardwa... | arxiv | @article{lürwer-brüggemeier2007on,
title={On Faster Integer Calculations using Non-Arithmetic Primitives},
author={Katharina L"urwer-Br"uggemeier and Martin Ziegler},
journal={arXiv preprint arXiv:0709.0624},
year={2007},
archivePrefix={arXiv},
eprint={0709.0624},
primaryClass={cs.DS}
} | lürwer-brüggemeier2007on |
arxiv-1133 | 0709.0670 | Using Data Compressors to Construct Rank Tests | <|reference_start|>Using Data Compressors to Construct Rank Tests: Nonparametric rank tests for homogeneity and component independence are proposed, which are based on data compressors. For homogeneity testing the idea is to compress the binary string obtained by ordering the two joint samples and writing 0 if the elem... | arxiv | @article{ryabko2007using,
title={Using Data Compressors to Construct Rank Tests},
author={Daniil Ryabko, Juergen Schmidhuber},
journal={Applied Mathematics Letters, 22:7, 1029-1032, 2009},
year={2007},
archivePrefix={arXiv},
eprint={0709.0670},
primaryClass={cs.DS cs.IT math.IT}
} | ryabko2007using |
arxiv-1134 | 0709.0674 | Simple Algorithmic Principles of Discovery, Subjective Beauty, Selective Attention, Curiosity & Creativity | <|reference_start|>Simple Algorithmic Principles of Discovery, Subjective Beauty, Selective Attention, Curiosity & Creativity: I postulate that human or other intelligent agents function or should function as follows. They store all sensory observations as they come - the data is holy. At any time, given some agent's c... | arxiv | @article{schmidhuber2007simple,
title={Simple Algorithmic Principles of Discovery, Subjective Beauty, Selective
Attention, Curiosity & Creativity},
author={Juergen Schmidhuber},
journal={arXiv preprint arXiv:0709.0674},
year={2007},
archivePrefix={arXiv},
eprint={0709.0674},
primaryClass={... | schmidhuber2007simple |
arxiv-1135 | 0709.0677 | On the Complexity of Protein Local Structure Alignment Under the Discrete Fr\'echet Distance | <|reference_start|>On the Complexity of Protein Local Structure Alignment Under the Discrete Fr\'echet Distance: We show that given $m$ proteins (or protein backbones, which are modeled as 3D polygonal chains each of length O(n)) the problem of protein local structure alignment under the discrete Fr\'{e}chet distance i... | arxiv | @article{zhu2007on,
title={On the Complexity of Protein Local Structure Alignment Under the
Discrete Fr\'echet Distance},
author={Binhai Zhu},
journal={arXiv preprint arXiv:0709.0677},
year={2007},
archivePrefix={arXiv},
eprint={0709.0677},
primaryClass={cs.CC cs.DS}
} | zhu2007on |
arxiv-1136 | 0709.0680 | Designing a Virtual Manikin Animation Framework Aimed at Virtual Prototyping | <|reference_start|>Designing a Virtual Manikin Animation Framework Aimed at Virtual Prototyping: In the industry, numerous commercial packages provide tools to introduce, and analyse human behaviour in the product's environment (for maintenance, ergonomics...), thanks to Virtual Humans. We will focus on control. Thanks... | arxiv | @article{rennuit2007designing,
title={Designing a Virtual Manikin Animation Framework Aimed at Virtual
Prototyping},
author={Antoine Rennuit (IRCCyN), Alain Micaelli (LIST), Claude Andriot
(LIST), Franc{c}ois Guillaume, Nicolas Chevassus, Damien Chablat (IRCCyN),
Patrick Chedmail (IRCCyN)},
journal={D... | rennuit2007designing |
arxiv-1137 | 0709.0746 | Geometric Complexity Theory: Introduction | <|reference_start|>Geometric Complexity Theory: Introduction: These are lectures notes for the introductory graduate courses on geometric complexity theory (GCT) in the computer science department, the university of Chicago. Part I consists of the lecture notes for the course given by the first author in the spring qua... | arxiv | @article{mulmuley2007geometric,
title={Geometric Complexity Theory: Introduction},
author={Ketan D. Mulmuley, Milind Sohoni},
journal={arXiv preprint arXiv:0709.0746},
year={2007},
number={TR-2007-16, comp. sci. dept., The University Of Chicago},
archivePrefix={arXiv},
eprint={0709.0746},
... | mulmuley2007geometric |
arxiv-1138 | 0709.0748 | On P vs NP, Geometric Complexity Theory, and the Flip I: a high level view | <|reference_start|>On P vs NP, Geometric Complexity Theory, and the Flip I: a high level view: Geometric complexity theory (GCT) is an approach to the $P$ vs. $NP$ and related problems through algebraic geometry and representation theory. This article gives a high-level exposition of the basic plan of GCT based on the ... | arxiv | @article{mulmuley2007on,
title={On P vs. NP, Geometric Complexity Theory, and the Flip I: a high level
view},
author={Ketan D. Mulmuley},
journal={arXiv preprint arXiv:0709.0748},
year={2007},
number={TR-2007-13, comp. sci. dept., The University of Chicago},
archivePrefix={arXiv},
eprint={... | mulmuley2007on |
arxiv-1139 | 0709.0749 | Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem | <|reference_start|>Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem: This article describes a {\em nonstandard} quantum group that may be used to derive a positive formula for the plethysm problem, just as the standard (Drinfeld-Jimbo) quantum group can be used to derive the positive ... | arxiv | @article{mulmuley2007geometric,
title={Geometric Complexity Theory VII: Nonstandard quantum group for the
plethysm problem},
author={Ketan D. Mulmuley},
journal={arXiv preprint arXiv:0709.0749},
year={2007},
number={TR-2007-14, comp. sci. dept., The University Of Chicago},
archivePrefix={arXiv... | mulmuley2007geometric |
arxiv-1140 | 0709.0751 | Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups | <|reference_start|>Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups: This article gives conjecturally correct algorithms to construct canonical bases of the irreducible polynomial representations and the matrix coordinate rings of the nonstandard quantum groups in GCT4 and GCT7, a... | arxiv | @article{mulmuley2007geometric,
title={Geometric Complexity Theory VIII: On canonical bases for the nonstandard
quantum groups},
author={Ketan D. Mulmuley},
journal={arXiv preprint arXiv:0709.0751},
year={2007},
number={TR-2007-15, comp. sci. dept., The University Of Chicago},
archivePrefix={a... | mulmuley2007geometric |
arxiv-1141 | 0709.0787 | Sound Generation by a Turbulent Flow in Musical Instruments - Multiphysics Simulation Approach - | <|reference_start|>Sound Generation by a Turbulent Flow in Musical Instruments - Multiphysics Simulation Approach -: Total computational costs of scientific simulations are analyzed between direct numerical simulations (DNS) and multiphysics simulations (MPS) for sound generation in musical instruments. In order to pro... | arxiv | @article{kobayashi2007sound,
title={Sound Generation by a Turbulent Flow in Musical Instruments -
Multiphysics Simulation Approach -},
author={Taizo Kobayashi, Toshiya Takami, Kin'ya Takahashi, Ryota Mibu, Mutsumi
Aoyagi},
journal={arXiv preprint arXiv:0709.0787},
year={2007},
archivePrefix={arX... | kobayashi2007sound |
arxiv-1142 | 0709.0883 | Liquid State Machines in Adbiatic Quantum Computers for General Computation | <|reference_start|>Liquid State Machines in Adbiatic Quantum Computers for General Computation: Major mistakes do not read<|reference_end|> | arxiv | @article{herman2007liquid,
title={Liquid State Machines in Adbiatic Quantum Computers for General
Computation},
author={Joshua Jay Herman},
journal={arXiv preprint arXiv:0709.0883},
year={2007},
archivePrefix={arXiv},
eprint={0709.0883},
primaryClass={cs.CC cs.NE}
} | herman2007liquid |
arxiv-1143 | 0709.0896 | Open Access does not increase citations for research articles from The Astrophysical Journal | <|reference_start|>Open Access does not increase citations for research articles from The Astrophysical Journal: We demonstrate conclusively that there is no "Open Access Advantage" for papers from the Astrophysical Journal. The two to one citation advantage enjoyed by papers deposited in the arXiv e-print server is du... | arxiv | @article{kurtz2007open,
title={Open Access does not increase citations for research articles from The
Astrophysical Journal},
author={Michael J. Kurtz, Edwin A. Henneken},
journal={arXiv preprint arXiv:0709.0896},
year={2007},
archivePrefix={arXiv},
eprint={0709.0896},
primaryClass={cs.DL ... | kurtz2007open |
arxiv-1144 | 0709.0906 | A Greedy Randomized Adaptive Search Procedure for Technicians and Interventions Scheduling for Telecommunications | <|reference_start|>A Greedy Randomized Adaptive Search Procedure for Technicians and Interventions Scheduling for Telecommunications: The subject of the 5th challenge proposed by the French Society of Operations Research and Decision Analysis (ROADEF) consists in scheduling technicians and interventions for telecommuni... | arxiv | @article{boussier2007a,
title={A Greedy Randomized Adaptive Search Procedure for Technicians and
Interventions Scheduling for Telecommunications},
author={Sylvain Boussier (LGI2P), Hideki Hashimoto, Michel Vasquez (LGI2P)},
journal={arXiv preprint arXiv:0709.0906},
year={2007},
archivePrefix={arXi... | boussier2007a |
arxiv-1145 | 0709.0907 | Computability of probability measures and Martin-Lof randomness over metric spaces | <|reference_start|>Computability of probability measures and Martin-Lof randomness over metric spaces: In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probabilit... | arxiv | @article{hoyrup2007computability,
title={Computability of probability measures and Martin-Lof randomness over
metric spaces},
author={Mathieu Hoyrup and Cristobal Rojas},
journal={arXiv preprint arXiv:0709.0907},
year={2007},
archivePrefix={arXiv},
eprint={0709.0907},
primaryClass={cs.IT m... | hoyrup2007computability |
arxiv-1146 | 0709.0929 | Analysis of network by generalized mutual entropies | <|reference_start|>Analysis of network by generalized mutual entropies: Generalized mutual entropy is defined for networks and applied for analysis of complex network structures. The method is tested for the case of computer simulated scale free networks, random networks, and their mixtures. The possible applications f... | arxiv | @article{gudkov2007analysis,
title={Analysis of network by generalized mutual entropies},
author={V. Gudkov and V. Montealegre},
journal={arXiv preprint arXiv:0709.0929},
year={2007},
doi={10.1016/j.physa.2008.01.005},
archivePrefix={arXiv},
eprint={0709.0929},
primaryClass={cond-mat.dis... | gudkov2007analysis |
arxiv-1147 | 0709.0961 | A New Distributed Topology Control Algorithm for Wireless Environments with Non-Uniform Path Loss and Multipath Propagation | <|reference_start|>A New Distributed Topology Control Algorithm for Wireless Environments with Non-Uniform Path Loss and Multipath Propagation: Each node in a wireless multi-hop network can adjust the power level at which it transmits and thus change the topology of the network to save energy by choosing the neighbors ... | arxiv | @article{sethu2007a,
title={A New Distributed Topology Control Algorithm for Wireless Environments
with Non-Uniform Path Loss and Multipath Propagation},
author={Harish Sethu and Thomas Gerety},
journal={Ad Hoc Networks, May 2010, volume 8, issue 3, pages 280-294.},
year={2007},
archivePrefix={arX... | sethu2007a |
arxiv-1148 | 0709.0965 | The Induced Bounded-Degree Subgraph Problem and Stream Control in MIMO Networks | <|reference_start|>The Induced Bounded-Degree Subgraph Problem and Stream Control in MIMO Networks: In this report, we consider maximal solutions to the induced bounded-degree subgraph problem and relate it to issues concerning stream control in multiple-input multiple-output (MIMO) networks. We present a new distribut... | arxiv | @article{sethu2007the,
title={The Induced Bounded-Degree Subgraph Problem and Stream Control in MIMO
Networks},
author={Harish Sethu},
journal={arXiv preprint arXiv:0709.0965},
year={2007},
archivePrefix={arXiv},
eprint={0709.0965},
primaryClass={cs.NI}
} | sethu2007the |
arxiv-1149 | 0709.0974 | Finding Paths and Cycles in Graphs | <|reference_start|>Finding Paths and Cycles in Graphs: A polynomial time algorithm which detects all paths and cycles of all lengths in form of vertex pairs (start, finish).<|reference_end|> | arxiv | @article{gubin2007finding,
title={Finding Paths and Cycles in Graphs},
author={Sergey Gubin},
journal={arXiv preprint arXiv:0709.0974},
year={2007},
archivePrefix={arXiv},
eprint={0709.0974},
primaryClass={cs.DM cs.CC cs.DS math.CO}
} | gubin2007finding |
arxiv-1150 | 0709.0993 | The Description of Information in 4-Dimensional Pseudo-Euclidean Information Space | <|reference_start|>The Description of Information in 4-Dimensional Pseudo-Euclidean Information Space: This article is presented new method of description information systems in abstract 4-dimensional pseudo-Euclidean information space (4-DPIES) with using special relativity (SR) methods. This purpose core postulates o... | arxiv | @article{shro2007the,
title={The Description of Information in 4-Dimensional Pseudo-Euclidean
Information Space},
author={O. I. Shro},
journal={arXiv preprint arXiv:0709.0993},
year={2007},
archivePrefix={arXiv},
eprint={0709.0993},
primaryClass={cs.IT math.IT nlin.AO physics.soc-ph}
} | shro2007the |
arxiv-1151 | 0709.1023 | Constraint optimization and landscapes | <|reference_start|>Constraint optimization and landscapes: We describe an effective landscape introduced in [1] for the analysis of Constraint Satisfaction problems, such as Sphere Packing, K-SAT and Graph Coloring. This geometric construction reexpresses these problems in the more familiar terms of optimization in rug... | arxiv | @article{krzakala2007constraint,
title={Constraint optimization and landscapes},
author={Florent Krzakala and Jorge Kurchan},
journal={Eur. Phys. J. B 64, 563-565 (2008)},
year={2007},
doi={10.1140/epjb/e2008-00052-x},
archivePrefix={arXiv},
eprint={0709.1023},
primaryClass={quant-ph con... | krzakala2007constraint |
arxiv-1152 | 0709.1024 | Computational performance of a parallelized high-order spectral and mortar element toolbox | <|reference_start|>Computational performance of a parallelized high-order spectral and mortar element toolbox: In this paper, a comprehensive performance review of a MPI-based high-order spectral and mortar element method C++ toolbox is presented. The focus is put on the performance evaluation of several aspects with a... | arxiv | @article{bouffanais2007computational,
title={Computational performance of a parallelized high-order spectral and
mortar element toolbox},
author={Roland Bouffanais, Vincent Keller, Ralf Gruber, Michel O. Deville},
journal={arXiv preprint arXiv:0709.1024},
year={2007},
archivePrefix={arXiv},
ep... | bouffanais2007computational |
arxiv-1153 | 0709.1056 | A Sudoku Game for People with Motor Impairments | <|reference_start|>A Sudoku Game for People with Motor Impairments: Computer games are motivating and beneficial in learning different educational skills. Most people use their fingers, hands, and arms when using a computer game. However, for people with motor disabilities this task can be a barrier. We present a new S... | arxiv | @article{norte2007a,
title={A Sudoku Game for People with Motor Impairments},
author={Stephane Norte},
journal={arXiv preprint arXiv:0709.1056},
year={2007},
archivePrefix={arXiv},
eprint={0709.1056},
primaryClass={cs.HC cs.CY}
} | norte2007a |
arxiv-1154 | 0709.1074 | Johnson Type Bounds on Constant Dimension Codes | <|reference_start|>Johnson Type Bounds on Constant Dimension Codes: Very recently, an operator channel was defined by Koetter and Kschischang when they studied random network coding. They also introduced constant dimension codes and demonstrated that these codes can be employed to correct errors and/or erasures over th... | arxiv | @article{xia2007johnson,
title={Johnson Type Bounds on Constant Dimension Codes},
author={Shu-Tao Xia and Fang-Wei Fu},
journal={arXiv preprint arXiv:0709.1074},
year={2007},
archivePrefix={arXiv},
eprint={0709.1074},
primaryClass={cs.IT math.IT}
} | xia2007johnson |
arxiv-1155 | 0709.1080 | On the Protocol Composition Logic PCL | <|reference_start|>On the Protocol Composition Logic PCL: A recent development in formal security protocol analysis is the Protocol Composition Logic (PCL). We identify a number of problems with this logic as well as with extensions of the logic, as defined in [DDMP05,HSD+05,He05,Dat05,Der06,DDMR07]. The identified pro... | arxiv | @article{cremers2007on,
title={On the Protocol Composition Logic PCL},
author={Cas Cremers},
journal={arXiv preprint arXiv:0709.1080},
year={2007},
archivePrefix={arXiv},
eprint={0709.1080},
primaryClass={cs.CR cs.LO}
} | cremers2007on |
arxiv-1156 | 0709.1099 | Multi-Sensor Fusion Method using Dynamic Bayesian Network for Precise Vehicle Localization and Road Matching | <|reference_start|>Multi-Sensor Fusion Method using Dynamic Bayesian Network for Precise Vehicle Localization and Road Matching: This paper presents a multi-sensor fusion strategy for a novel road-matching method designed to support real-time navigational features within advanced driving-assistance systems. Managing mu... | arxiv | @article{smaili2007multi-sensor,
title={Multi-Sensor Fusion Method using Dynamic Bayesian Network for Precise
Vehicle Localization and Road Matching},
author={Cherif Smaili (INRIA Lorraine - LORIA), Maan El Badaoui El Najjar
(INRIA Lorraine - LORIA), Franc{c}ois Charpillet (INRIA Lorraine - LORIA)},
jou... | smaili2007multi-sensor |
arxiv-1157 | 0709.1166 | An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation | <|reference_start|>An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation: Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting a sequence in up to K segments. We want segments to be as monotonic as possible and to alternate signs. We propose a quality me... | arxiv | @article{lemire2007an,
title={An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation},
author={Daniel Lemire, Martin Brooks, Yuhong Yan},
journal={Daniel Lemire, Martin Brooks and Yuhong Yan, An Optimal Linear
Time Algorithm for Quasi-Monotonic Segmentation. International Journal of
Computer ... | lemire2007an |
arxiv-1158 | 0709.1167 | Using RDF to Model the Structure and Process of Systems | <|reference_start|>Using RDF to Model the Structure and Process of Systems: Many systems can be described in terms of networks of discrete elements and their various relationships to one another. A semantic network, or multi-relational network, is a directed labeled graph consisting of a heterogeneous set of entities c... | arxiv | @article{rodriguez2007using,
title={Using RDF to Model the Structure and Process of Systems},
author={Marko A. Rodriguez, Jennifer H. Watkins, Johan Bollen, Carlos
Gershenson},
journal={InterJournal of Complex Systems, 2131, ISSN: 1081-0625, February
2008},
year={2007},
number={LAUR-07-5720},
... | rodriguez2007using |
arxiv-1159 | 0709.1190 | Belief-Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions | <|reference_start|>Belief-Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions: We consider the general problem of finding the minimum weight $\bm$-matching on arbitrary graphs. We prove that, whenever the linear programming (LP) relaxation of the problem h... | arxiv | @article{bayati2007belief-propagation,
title={Belief-Propagation for Weighted b-Matchings on Arbitrary Graphs and its
Relation to Linear Programs with Integer Solutions},
author={Mohsen Bayati, Christian Borgs, Jennifer Chayes, Riccardo Zecchina},
journal={SIAM J. Discrete Math. 2011, Vol 25, Issue 2, pp.... | bayati2007belief-propagation |
arxiv-1160 | 0709.1197 | An efficient algorithm finds noticeable trends and examples concerning the \vCerny conjecture | <|reference_start|>An efficient algorithm finds noticeable trends and examples concerning the \vCerny conjecture: A word w is called synchronizing (recurrent, reset, directed) word of a deterministic finite automaton (DFA) if w sends all states of the automaton on a unique state. Jan Cerny had found in 1964 a sequence ... | arxiv | @article{trahtman2007an,
title={An efficient algorithm finds noticeable trends and examples concerning
the \v{C}erny conjecture},
author={A.N. Trahtman},
journal={Lectures Notes in Computer Science, 4162(2006), 789-80},
year={2007},
archivePrefix={arXiv},
eprint={0709.1197},
primaryClass={... | trahtman2007an |
arxiv-1161 | 0709.1201 | On the Proof Complexity of Deep Inference | <|reference_start|>On the Proof Complexity of Deep Inference: We obtain two results about the proof complexity of deep inference: 1) deep-inference proof systems are as powerful as Frege ones, even when both are extended with the Tseitin extension rule or with the substitution rule; 2) there are analytic deep-inference... | arxiv | @article{bruscoli2007on,
title={On the Proof Complexity of Deep Inference},
author={Paola Bruscoli and Alessio Guglielmi},
journal={ACM Transactions on Computational Logic 10 (2:14) 2009, pp. 1-34},
year={2007},
doi={10.1145/1462179.1462186},
archivePrefix={arXiv},
eprint={0709.1201},
pr... | bruscoli2007on |
arxiv-1162 | 0709.1205 | Normalisation Control in Deep Inference via Atomic Flows | <|reference_start|>Normalisation Control in Deep Inference via Atomic Flows: We introduce `atomic flows': they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomic flows that correspond to complex reductions on derivations. This a... | arxiv | @article{guglielmi2007normalisation,
title={Normalisation Control in Deep Inference via Atomic Flows},
author={Alessio Guglielmi and Tom Gundersen},
journal={Logical Methods in Computer Science, Volume 4, Issue 1 (March 31,
2008) lmcs:1081},
year={2007},
doi={10.2168/LMCS-4(1:9)2008},
archiveP... | guglielmi2007normalisation |
arxiv-1163 | 0709.1207 | The P versus NP Brief | <|reference_start|>The P versus NP Brief: This paper discusses why P and NP are likely to be different. It analyses the essence of the concepts and points out that P and NP might be diverse by sheer definition. It also speculates that P and NP may be unequal due to natural laws.<|reference_end|> | arxiv | @article{franzen2007the,
title={The P versus NP Brief},
author={Mikael Franzen},
journal={arXiv preprint arXiv:0709.1207},
year={2007},
archivePrefix={arXiv},
eprint={0709.1207},
primaryClass={cs.CC}
} | franzen2007the |
arxiv-1164 | 0709.1211 | Likelihood ratios and Bayesian inference for Poisson channels | <|reference_start|>Likelihood ratios and Bayesian inference for Poisson channels: In recent years, infinite-dimensional methods have been introduced for the Gaussian channels estimation. The aim of this paper is to study the application of similar methods to Poisson channels. In particular we compute the Bayesian estim... | arxiv | @article{reveillac2007likelihood,
title={Likelihood ratios and Bayesian inference for Poisson channels},
author={Anthony Reveillac},
journal={arXiv preprint arXiv:0709.1211},
year={2007},
archivePrefix={arXiv},
eprint={0709.1211},
primaryClass={cs.IT math.IT math.ST stat.TH}
} | reveillac2007likelihood |
arxiv-1165 | 0709.1227 | Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination | <|reference_start|>Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination: Recently, great efforts have been dedicated to researches on the management of large scale graph based data such as WWW, social networks, biological networks. In the study of graph based data management, node disjoint subgra... | arxiv | @article{xiao2007efficient,
title={Efficient Algorithms for Node Disjoint Subgraph Homeomorphism
Determination},
author={Yanghua Xiao, Wentao Wu, Wei Wang and Zhengying He},
journal={In Proceeding of 13th International Conference on Database Systems
for Advanced Applications, 2008},
year={2007},
... | xiao2007efficient |
arxiv-1166 | 0709.1263 | Enumerating the Nash equilibria of rank 1-games | <|reference_start|>Enumerating the Nash equilibria of rank 1-games: A bimatrix game $(A,B)$ is called a game of rank $k$ if the rank of the matrix $A+B$ is at most $k$. We consider the problem of enumerating the Nash equilibria in (non-degenerate) games of rank 1. In particular, we show that even for games of rank 1 no... | arxiv | @article{theobald2007enumerating,
title={Enumerating the Nash equilibria of rank 1-games},
author={Thorsten Theobald},
journal={arXiv preprint arXiv:0709.1263},
year={2007},
archivePrefix={arXiv},
eprint={0709.1263},
primaryClass={cs.GT math.OC}
} | theobald2007enumerating |
arxiv-1167 | 0709.1272 | A Class of Parallel Tiled Linear Algebra Algorithms for Multicore Architectures | <|reference_start|>A Class of Parallel Tiled Linear Algebra Algorithms for Multicore Architectures: As multicore systems continue to gain ground in the High Performance Computing world, linear algebra algorithms have to be reformulated or new algorithms have to be developed in order to take advantage of the architectur... | arxiv | @article{buttari2007a,
title={A Class of Parallel Tiled Linear Algebra Algorithms for Multicore
Architectures},
author={Alfredo Buttari, Julien Langou, Jakub Kurzak, Jack Dongarra},
journal={arXiv preprint arXiv:0709.1272},
year={2007},
number={Lapack working Note 191},
archivePrefix={arXiv},
... | buttari2007a |
arxiv-1168 | 0709.1308 | Cirquent calculus deepened | <|reference_start|>Cirquent calculus deepened: Cirquent calculus is a new proof-theoretic and semantic framework, whose main distinguishing feature is being based on circuits, as opposed to the more traditional approaches that deal with tree-like objects such as formulas or sequents. Among its advantages are greater ef... | arxiv | @article{japaridze2007cirquent,
title={Cirquent calculus deepened},
author={Giorgi Japaridze},
journal={Journal of Logic and Computation 18 (2008), pp. 983-1028},
year={2007},
doi={10.1093/logcom/exn019},
archivePrefix={arXiv},
eprint={0709.1308},
primaryClass={cs.LO math.LO}
} | japaridze2007cirquent |
arxiv-1169 | 0709.1401 | A proof of strong normalisation using domain theory | <|reference_start|>A proof of strong normalisation using domain theory: Ulrich Berger presented a powerful proof of strong normalisation using domains, in particular it simplifies significantly Tait's proof of strong normalisation of Spector's bar recursion. The main contribution of this paper is to show that, using id... | arxiv | @article{coquand2007a,
title={A proof of strong normalisation using domain theory},
author={Thierry Coquand and Arnaud Spiwack},
journal={Logical Methods in Computer Science, Volume 3, Issue 4 (December
4, 2007) lmcs:1099},
year={2007},
doi={10.2168/LMCS-3(4:12)2007},
archivePrefix={arXiv},
... | coquand2007a |
arxiv-1170 | 0709.1433 | The Rank-Width of Edge-Colored Graphs | <|reference_start|>The Rank-Width of Edge-Colored Graphs: Clique-width is a complexity measure of directed as well as undirected graphs. Rank-width is an equivalent complexity measure for undirected graphs and has good algorithmic and structural properties. It is in particular related to the vertex-minor relation. We d... | arxiv | @article{kante2007the,
title={The Rank-Width of Edge-Colored Graphs},
author={Mamadou Moustapha Kante and Michael Rao},
journal={Theory of Computing Systems 52(4):599-644(2013)},
year={2007},
doi={10.1007/s00224-012-9399-y},
archivePrefix={arXiv},
eprint={0709.1433},
primaryClass={cs.DM ... | kante2007the |
arxiv-1171 | 0709.1441 | Information-theoretic analysis of MIMO channel sounding | <|reference_start|>Information-theoretic analysis of MIMO channel sounding: The large majority of commercially available multiple-input multiple-output (MIMO) radio channel measurement devices (sounders) is based on time-division multiplexed switching (TDMS) of a single transmit/receive radio-frequency chain into the e... | arxiv | @article{baum2007information-theoretic,
title={Information-theoretic analysis of MIMO channel sounding},
author={Daniel S. Baum and Helmut B"olcskei},
journal={arXiv preprint arXiv:0709.1441},
year={2007},
archivePrefix={arXiv},
eprint={0709.1441},
primaryClass={cs.IT math.IT}
} | baum2007information-theoretic |
arxiv-1172 | 0709.1449 | Supervised secure entanglement sharing for faithful quantum teleportation via tripartite W states | <|reference_start|>Supervised secure entanglement sharing for faithful quantum teleportation via tripartite W states: We present a supervised secure entanglement sharing protocol via tripartite W states for faithful quantum teleportation. By guaranteeing a secure entanglement distribution in the charge of a third belie... | arxiv | @article{li2007supervised,
title={Supervised secure entanglement sharing for faithful quantum
teleportation via tripartite W states},
author={Yue Li and Yu Liu},
journal={arXiv preprint arXiv:0709.1449},
year={2007},
archivePrefix={arXiv},
eprint={0709.1449},
primaryClass={quant-ph cs.CR}
... | li2007supervised |
arxiv-1173 | 0709.1500 | The Graver Complexity of Integer Programming | <|reference_start|>The Graver Complexity of Integer Programming: In this article we establish an exponential lower bound on the Graver complexity of integer programs. This provides new type of evidence supporting the presumable intractability of integer programming. Specifically, we show that the Graver complexity of t... | arxiv | @article{berstein2007the,
title={The Graver Complexity of Integer Programming},
author={Yael Berstein and Shmuel Onn},
journal={Annals of Combinatorics, 13:289--296, 2009},
year={2007},
archivePrefix={arXiv},
eprint={0709.1500},
primaryClass={math.CO cs.CC cs.DM math.AC}
} | berstein2007the |
arxiv-1174 | 0709.1516 | On Universal Prediction and Bayesian Confirmation | <|reference_start|>On Universal Prediction and Bayesian Confirmation: The Bayesian framework is a well-studied and successful framework for inductive reasoning, which includes hypothesis testing and confirmation, parameter estimation, sequence prediction, classification, and regression. But standard statistical guideli... | arxiv | @article{hutter2007on,
title={On Universal Prediction and Bayesian Confirmation},
author={Marcus Hutter},
journal={Theoretical Computer Science, 384 (2007) pages 33-48},
year={2007},
archivePrefix={arXiv},
eprint={0709.1516},
primaryClass={math.ST cs.IT cs.LG math.IT stat.ML stat.TH}
} | hutter2007on |
arxiv-1175 | 0709.1647 | Unfolding Restricted Convex Caps | <|reference_start|>Unfolding Restricted Convex Caps: This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restrictions: the cap's faces are quadrilaterals, with vertices over an underlying integer lat... | arxiv | @article{o'rourke2007unfolding,
title={Unfolding Restricted Convex Caps},
author={Joseph O'Rourke},
journal={arXiv preprint arXiv:0709.1647},
year={2007},
number={Smith Computer Science 086},
archivePrefix={arXiv},
eprint={0709.1647},
primaryClass={cs.CG}
} | o'rourke2007unfolding |
arxiv-1176 | 0709.1667 | Solving Constraint Satisfaction Problems through Belief Propagation-guided decimation | <|reference_start|>Solving Constraint Satisfaction Problems through Belief Propagation-guided decimation: Message passing algorithms have proved surprisingly successful in solving hard constraint satisfaction problems on sparse random graphs. In such applications, variables are fixed sequentially to satisfy the constra... | arxiv | @article{montanari2007solving,
title={Solving Constraint Satisfaction Problems through Belief
Propagation-guided decimation},
author={Andrea Montanari, Federico Ricci-Tersenghi and Guilhem Semerjian},
journal={Proceedings of the 45th Annual Allerton Conference on
Communication, Control, and Computing (M... | montanari2007solving |
arxiv-1177 | 0709.1674 | Matrix-Lifting Semi-Definite Programming for Decoding in Multiple Antenna Systems | <|reference_start|>Matrix-Lifting Semi-Definite Programming for Decoding in Multiple Antenna Systems: This paper presents a computationally efficient decoder for multiple antenna systems. The proposed algorithm can be used for any constellation (QAM or PSK) and any labeling method. The decoder is based on matrix-liftin... | arxiv | @article{mobasher2007matrix-lifting,
title={Matrix-Lifting Semi-Definite Programming for Decoding in Multiple
Antenna Systems},
author={Amin Mobasher and Amir K. Khandani},
journal={arXiv preprint arXiv:0709.1674},
year={2007},
number={Technical report UW-E&CE #2007-06},
archivePrefix={arXiv},... | mobasher2007matrix-lifting |
arxiv-1178 | 0709.1699 | Efficient Tabling Mechanisms for Transaction Logic Programs | <|reference_start|>Efficient Tabling Mechanisms for Transaction Logic Programs: In this paper we present efficient evaluation algorithms for the Horn Transaction Logic (a generalization of the regular Horn logic programs with state updates). We present two complementary methods for optimizing the implementation of Tran... | arxiv | @article{fodor2007efficient,
title={Efficient Tabling Mechanisms for Transaction Logic Programs},
author={Paul Fodor},
journal={arXiv preprint arXiv:0709.1699},
year={2007},
archivePrefix={arXiv},
eprint={0709.1699},
primaryClass={cs.LO cs.AI}
} | fodor2007efficient |
arxiv-1179 | 0709.1701 | Enrichment of Qualitative Beliefs for Reasoning under Uncertainty | <|reference_start|>Enrichment of Qualitative Beliefs for Reasoning under Uncertainty: This paper deals with enriched qualitative belief functions for reasoning under uncertainty and for combining information expressed in natural language through linguistic labels. In this work, two possible enrichments (quantitative an... | arxiv | @article{li2007enrichment,
title={Enrichment of Qualitative Beliefs for Reasoning under Uncertainty},
author={Xinde Li (ICRL), Xinhan Huang (ICRL), Florentin Smarandache (UNM),
Jean Dezert (ONERA)},
journal={arXiv preprint arXiv:0709.1701},
year={2007},
archivePrefix={arXiv},
eprint={0709.1701... | li2007enrichment |
arxiv-1180 | 0709.1744 | Experiments with small helicopter automated landings at unusual attitudes | <|reference_start|>Experiments with small helicopter automated landings at unusual attitudes: This paper describes a set of experiments involving small helicopters landing automated landing at unusual attitudes. By leveraging the increased agility of small air vehicles, we show that it is possible to automatically land... | arxiv | @article{bayraktar2007experiments,
title={Experiments with small helicopter automated landings at unusual
attitudes},
author={S. Bayraktar and E. Feron},
journal={arXiv preprint arXiv:0709.1744},
year={2007},
archivePrefix={arXiv},
eprint={0709.1744},
primaryClass={cs.RO}
} | bayraktar2007experiments |
arxiv-1181 | 0709.1771 | Variational local structure estimation for image super-resolution | <|reference_start|>Variational local structure estimation for image super-resolution: Super-resolution is an important but difficult problem in image/video processing. If a video sequence or some training set other than the given low-resolution image is available, this kind of extra information can greatly aid in the r... | arxiv | @article{lian2007variational,
title={Variational local structure estimation for image super-resolution},
author={Heng Lian},
journal={arXiv preprint arXiv:0709.1771},
year={2007},
archivePrefix={arXiv},
eprint={0709.1771},
primaryClass={cs.CV}
} | lian2007variational |
arxiv-1182 | 0709.1794 | Overlap-free words and spectra of matrices | <|reference_start|>Overlap-free words and spectra of matrices: Overlap-free words are words over the binary alphabet $A=\{a, b\}$ that do not contain factors of the form $xvxvx$, where $x \in A$ and $v \in A^*$. We analyze the asymptotic growth of the number $u_n$ of overlap-free words of length $n$ as $ n \to \infty$.... | arxiv | @article{jungers2007overlap-free,
title={Overlap-free words and spectra of matrices},
author={Raphael M. Jungers, Vladimir Y. Protasov, Vincent D. Blondel},
journal={arXiv preprint arXiv:0709.1794},
year={2007},
archivePrefix={arXiv},
eprint={0709.1794},
primaryClass={cs.DM}
} | jungers2007overlap-free |
arxiv-1183 | 0709.1920 | Bandwidth selection for kernel estimation in mixed multi-dimensional spaces | <|reference_start|>Bandwidth selection for kernel estimation in mixed multi-dimensional spaces: Kernel estimation techniques, such as mean shift, suffer from one major drawback: the kernel bandwidth selection. The bandwidth can be fixed for all the data set or can vary at each points. Automatic bandwidth selection beco... | arxiv | @article{bugeau2007bandwidth,
title={Bandwidth selection for kernel estimation in mixed multi-dimensional
spaces},
author={Aurelie Bugeau (IRISA), Patrick P'erez (IRISA)},
journal={arXiv preprint arXiv:0709.1920},
year={2007},
archivePrefix={arXiv},
eprint={0709.1920},
primaryClass={cs.CV}... | bugeau2007bandwidth |
arxiv-1184 | 0709.1934 | CD(4) has bounded width | <|reference_start|>CD(4) has bounded width: We prove that the constraint languages invariant under a short sequence of J\'onsson terms (containing at most three non-trivial ternary terms) are tractable by showing that they have bounded width. This improves the previous result by Kiss and Valeriote and presents some evi... | arxiv | @article{carvalho2007cd(4),
title={CD(4) has bounded width},
author={Catarina Carvalho, V'ictor Dalmau, Petar Markovi'c and Mikl'os
Mar'oti},
journal={arXiv preprint arXiv:0709.1934},
year={2007},
archivePrefix={arXiv},
eprint={0709.1934},
primaryClass={math.LO cs.CC}
} | carvalho2007cd(4) |
arxiv-1185 | 0709.1941 | Speeding up Simplification of Polygonal Curves using Nested Approximations | <|reference_start|>Speeding up Simplification of Polygonal Curves using Nested Approximations: We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used between any two successive levels of resolution sati... | arxiv | @article{marteau2007speeding,
title={Speeding up Simplification of Polygonal Curves using Nested
Approximations},
author={Pierre-Franc{c}ois Marteau (VALORIA), Gildas G. M'enier (VALORIA)},
journal={Pattern Analysis & Applications (2008) 1-8},
year={2007},
doi={10.1007/s10044-008-0133-y},
arch... | marteau2007speeding |
arxiv-1186 | 0709.1942 | Connecting Polygonizations via Stretches and Twangs | <|reference_start|>Connecting Polygonizations via Stretches and Twangs: We show that the space of polygonizations of a fixed planar point set S of n points is connected by O(n^2) ``moves'' between simple polygons. Each move is composed of a sequence of atomic moves called ``stretches'' and ``twangs''. These atomic move... | arxiv | @article{damian2007connecting,
title={Connecting Polygonizations via Stretches and Twangs},
author={Mirela Damian, Robin Flatland, Joseph O'Rourke, Suneeta Ramaswami},
journal={arXiv preprint arXiv:0709.1942},
year={2007},
archivePrefix={arXiv},
eprint={0709.1942},
primaryClass={cs.CG cs.DM}... | damian2007connecting |
arxiv-1187 | 0709.2016 | Distribution of PageRank Mass Among Principle Components of the Web | <|reference_start|>Distribution of PageRank Mass Among Principle Components of the Web: We study the PageRank mass of principal components in a bow-tie Web Graph, as a function of the damping factor c. Using a singular perturbation approach, we show that the PageRank share of IN and SCC components remains high even for... | arxiv | @article{avrachenkov2007distribution,
title={Distribution of PageRank Mass Among Principle Components of the Web},
author={Konstantin Avrachenkov, Nelly Litvak, Kim Son Pham},
journal={arXiv preprint arXiv:0709.2016},
year={2007},
archivePrefix={arXiv},
eprint={0709.2016},
primaryClass={cs.N... | avrachenkov2007distribution |
arxiv-1188 | 0709.2065 | Toward Psycho-robots | <|reference_start|>Toward Psycho-robots: We try to perform geometrization of psychology by representing mental states, <<ideas>>, by points of a metric space, <<mental space>>. Evolution of ideas is described by dynamical systems in metric mental space. We apply the mental space approach for modeling of flows of uncons... | arxiv | @article{khrennikov2007toward,
title={Toward Psycho-robots},
author={Andrei Khrennikov},
journal={Paladyn Volume 1, Number 2, 99-108, 2010},
year={2007},
doi={10.2478/s13230-010-0014-0},
archivePrefix={arXiv},
eprint={0709.2065},
primaryClass={cs.AI}
} | khrennikov2007toward |
arxiv-1189 | 0709.2074 | Generalized entropies and open random and scale-free networks | <|reference_start|>Generalized entropies and open random and scale-free networks: We propose the concept of open network as an arbitrary selection of nodes of a large unknown network. Using the hypothesis that information of the whole network structure can be extrapolated from an arbitrary set of its nodes, we use Reny... | arxiv | @article{gudkov2007generalized,
title={Generalized entropies and open random and scale-free networks},
author={V. Gudkov and V. Montealegre},
journal={arXiv preprint arXiv:0709.2074},
year={2007},
doi={10.1063/1.2828754},
archivePrefix={arXiv},
eprint={0709.2074},
primaryClass={cond-mat.... | gudkov2007generalized |
arxiv-1190 | 0709.2196 | Bregman Voronoi Diagrams: Properties, Algorithms and Applications | <|reference_start|>Bregman Voronoi Diagrams: Properties, Algorithms and Applications: The Voronoi diagram of a finite set of objects is a fundamental geometric structure that subdivides the embedding space into regions, each region consisting of the points that are closer to a given object than to the others. We may de... | arxiv | @article{nielsen2007bregman,
title={Bregman Voronoi Diagrams: Properties, Algorithms and Applications},
author={Frank Nielsen, Jean-Daniel Boissonnat, Richard Nock},
journal={Discrete & Computational Geometry volume 44, pages281-307(2010)},
year={2007},
doi={10.1007/s00454-010-9256-1},
archivePr... | nielsen2007bregman |
arxiv-1191 | 0709.2201 | A complete proof of The Graceful Tree Conjecture using the concept of Edge Degree | <|reference_start|>A complete proof of The Graceful Tree Conjecture using the concept of Edge Degree: We show the Graceful Tree Conjecture holds.<|reference_end|> | arxiv | @article{gilbert2007a,
title={A complete proof of The Graceful Tree Conjecture using the concept of
Edge Degree},
author={Jesse Gilbert},
journal={arXiv preprint arXiv:0709.2201},
year={2007},
archivePrefix={arXiv},
eprint={0709.2201},
primaryClass={cs.DM}
} | gilbert2007a |
arxiv-1192 | 0709.2224 | Self-similar dilatation structures and automata | <|reference_start|>Self-similar dilatation structures and automata: We show that on the boundary of the dyadic tree, any self-similar dilatation structure induces a web of interacting automata. This is a short version, for publication, of the paper arXiv:math/0612509v2<|reference_end|> | arxiv | @article{buliga2007self-similar,
title={Self-similar dilatation structures and automata},
author={Marius Buliga},
journal={Proceedings of the Sixth Congress of Romanian Mahematicians,
Bucharest 2007, vol. 1, 557-564},
year={2007},
archivePrefix={arXiv},
eprint={0709.2224},
primaryClass={ma... | buliga2007self-similar |
arxiv-1193 | 0709.2225 | Improved Linear Parallel Interference Cancellers | <|reference_start|>Improved Linear Parallel Interference Cancellers: In this paper, taking the view that a linear parallel interference canceller (LPIC) can be seen as a linear matrix filter, we propose new linear matrix filters that can result in improved bit error performance compared to other LPICs in the literature... | arxiv | @article{srikanth2007improved,
title={Improved Linear Parallel Interference Cancellers},
author={T. Srikanth, K. Vishnu Vardhan, A. Chockalingam, and L. B. Milstein},
journal={arXiv preprint arXiv:0709.2225},
year={2007},
archivePrefix={arXiv},
eprint={0709.2225},
primaryClass={cs.IT cs.SC c... | srikanth2007improved |
arxiv-1194 | 0709.2252 | Otiy: Loactors tracking nodes | <|reference_start|>Otiy: Loactors tracking nodes: We propose Otiy, a node-centric location service that limits the impact of location updates generate by mobile nodes in IEEE802.11-based wireless mesh networks. Existing location services use node identifiers to determine the locator (aka anchor) that is responsible for... | arxiv | @article{boc2007otiy:,
title={Otiy: Loactors tracking nodes},
author={Mathias Boc, Anne Fladenmuller and Marcelo dias de Amorim},
journal={arXiv preprint arXiv:0709.2252},
year={2007},
archivePrefix={arXiv},
eprint={0709.2252},
primaryClass={cs.NI}
} | boc2007otiy: |
arxiv-1195 | 0709.2330 | Queueing for ergodic arrivals and services | <|reference_start|>Queueing for ergodic arrivals and services: In this paper we revisit the results of Loynes (1962) on stability of queues for ergodic arrivals and services, and show examples when the arrivals are bounded and ergodic, the service rate is constant, and under stability the limit distribution has larger ... | arxiv | @article{gyorfi2007queueing,
title={Queueing for ergodic arrivals and services},
author={L. Gyorfi, G. Morvai},
journal={In Limit Theorems in Probability and Statistics, I. Berkes E.
Csaki, M. Csorgo (Eds.), pp. 127-141, J. Bolyai Mathematical Society, 2002},
year={2007},
archivePrefix={arXiv},
... | gyorfi2007queueing |
arxiv-1196 | 0709.2346 | Pushdown Compression | <|reference_start|>Pushdown Compression: The pressing need for eficient compression schemes for XML documents has recently been focused on stack computation [6, 9], and in particular calls for a formulation of information-lossless stack or pushdown compressors that allows a formal analysis of their performance and a mo... | arxiv | @article{albert2007pushdown,
title={Pushdown Compression},
author={Pilar Albert, Elvira Mayordomo, Philippe Moser, Sylvain Perifel},
journal={arXiv preprint arXiv:0709.2346},
year={2007},
archivePrefix={arXiv},
eprint={0709.2346},
primaryClass={cs.IT cs.CC math.IT}
} | albert2007pushdown |
arxiv-1197 | 0709.2401 | Bootstrapping Deep Lexical Resources: Resources for Courses | <|reference_start|>Bootstrapping Deep Lexical Resources: Resources for Courses: We propose a range of deep lexical acquisition methods which make use of morphological, syntactic and ontological language resources to model word similarity and bootstrap from a seed lexicon. The different methods are deployed in learning ... | arxiv | @article{baldwin2007bootstrapping,
title={Bootstrapping Deep Lexical Resources: Resources for Courses},
author={Timothy Baldwin},
journal={In Proceedings of the ACL-SIGLEX 2005 Workshop on Deep Lexical
Acquisition, Ann Arbor, USA, pp. 67-76},
year={2007},
archivePrefix={arXiv},
eprint={0709.24... | baldwin2007bootstrapping |
arxiv-1198 | 0709.2405 | New Complexity Bounds for Certain Real Fewnomial Zero Sets | <|reference_start|>New Complexity Bounds for Certain Real Fewnomial Zero Sets: Consider real bivariate polynomials f and g, respectively having 3 and m monomial terms. We prove that for all m>=3, there are systems of the form (f,g) having exactly 2m-1 roots in the positive quadrant. Even examples with m=4 having 7 posi... | arxiv | @article{gomez2007new,
title={New Complexity Bounds for Certain Real Fewnomial Zero Sets},
author={Joel Gomez, Andrew Niles, and J. Maurice Rojas},
journal={arXiv preprint arXiv:0709.2405},
year={2007},
archivePrefix={arXiv},
eprint={0709.2405},
primaryClass={math.AG cs.CG}
} | gomez2007new |
arxiv-1199 | 0709.2410 | Distributed Decision Through Self-Synchronizing Sensor Networks in the Presence of Propagation Delays and Asymmetric Channels | <|reference_start|>Distributed Decision Through Self-Synchronizing Sensor Networks in the Presence of Propagation Delays and Asymmetric Channels: In this paper we propose and analyze a distributed algorithm for achieving globally optimal decisions, either estimation or detection, through a self-synchronization mechanis... | arxiv | @article{scutari2007distributed,
title={Distributed Decision Through Self-Synchronizing Sensor Networks in the
Presence of Propagation Delays and Asymmetric Channels},
author={Gesualdo Scutari, Sergio Barbarossa, Loreto Pescosolido},
journal={arXiv preprint arXiv:0709.2410},
year={2007},
doi={10.1... | scutari2007distributed |
arxiv-1200 | 0709.2445 | A Simple Characterization of Strategic Behaviors in Broadcast Channels | <|reference_start|>A Simple Characterization of Strategic Behaviors in Broadcast Channels: In this paper, we consider the problem of resource allocation among two competing users sharing a binary symmetric broadcast channel. We model the interaction between autonomous selfish users in the resource allocation and analyz... | arxiv | @article{su2007a,
title={A Simple Characterization of Strategic Behaviors in Broadcast Channels},
author={Yi Su and Mihaela van der Schaar},
journal={arXiv preprint arXiv:0709.2445},
year={2007},
doi={10.1109/LSP.2007.910259},
archivePrefix={arXiv},
eprint={0709.2445},
primaryClass={cs.I... | su2007a |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.