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-501 | 0706.1019 | Probabilistic Anonymity and Admissible Schedulers | <|reference_start|>Probabilistic Anonymity and Admissible Schedulers: When studying safety properties of (formal) protocol models, it is customary to view the scheduler as an adversary: an entity trying to falsify the safety property. We show that in the context of security protocols, and in particular of anonymizing p... | arxiv | @article{garcia2007probabilistic,
title={Probabilistic Anonymity and Admissible Schedulers},
author={Flavio D. Garcia, Peter van Rossum, and Ana Sokolova},
journal={arXiv preprint arXiv:0706.1019},
year={2007},
archivePrefix={arXiv},
eprint={0706.1019},
primaryClass={cs.CR}
} | garcia2007probabilistic |
arxiv-502 | 0706.1051 | Improved Neural Modeling of Real-World Systems Using Genetic Algorithm Based Variable Selection | <|reference_start|>Improved Neural Modeling of Real-World Systems Using Genetic Algorithm Based Variable Selection: Neural network models of real-world systems, such as industrial processes, made from sensor data must often rely on incomplete data. System states may not all be known, sensor data may be biased or noisy,... | arxiv | @article{sofge2007improved,
title={Improved Neural Modeling of Real-World Systems Using Genetic Algorithm
Based Variable Selection},
author={Donald A. Sofge and David L. Elliott},
journal={D. Sofge and D. Elliott, "Improved Neural Modeling of Real-World
Systems Using Genetic Algorithm Based Variable Sel... | sofge2007improved |
arxiv-503 | 0706.1061 | Design, Implementation, and Cooperative Coevolution of an Autonomous/ Teleoperated Control System for a Serpentine Robotic Manipulator | <|reference_start|>Design, Implementation, and Cooperative Coevolution of an Autonomous/ Teleoperated Control System for a Serpentine Robotic Manipulator: Design, implementation, and machine learning issues associated with developing a control system for a serpentine robotic manipulator are explored. The controller dev... | arxiv | @article{sofge2007design,,
title={Design, Implementation, and Cooperative Coevolution of an Autonomous/
Teleoperated Control System for a Serpentine Robotic Manipulator},
author={Donald Sofge and Gerald Chiang},
journal={D. Sofge and G. Chiang, "Design, ... a Serpentine Automated Waste
Retrieval Manipul... | sofge2007design, |
arxiv-504 | 0706.1063 | Small Worlds: Strong Clustering in Wireless Networks | <|reference_start|>Small Worlds: Strong Clustering in Wireless Networks: Small-worlds represent efficient communication networks that obey two distinguishing characteristics: a high clustering coefficient together with a small characteristic path length. This paper focuses on an interesting paradox, that removing links... | arxiv | @article{brust2007small,
title={Small Worlds: Strong Clustering in Wireless Networks},
author={Matthias R. Brust, Steffen Rothkugel},
journal={arXiv preprint arXiv:0706.1063},
year={2007},
archivePrefix={arXiv},
eprint={0706.1063},
primaryClass={cs.NI cs.DC cs.DS}
} | brust2007small |
arxiv-505 | 0706.1066 | Applying Test-Paradigms in a Generic Tutoring System Concept for Web-based Learning | <|reference_start|>Applying Test-Paradigms in a Generic Tutoring System Concept for Web-based Learning: Realizing test scenarios through a tutoring system involve questions about architecture and didactic methods in such a system. Observing the fact that traditional tutoring systems normally are domain-static, this pap... | arxiv | @article{brust2007applying,
title={Applying Test-Paradigms in a Generic Tutoring System Concept for
Web-based Learning},
author={Matthias R. Brust},
journal={arXiv preprint arXiv:0706.1066},
year={2007},
archivePrefix={arXiv},
eprint={0706.1066},
primaryClass={cs.CY}
} | brust2007applying |
arxiv-506 | 0706.1080 | WACA: A Hierarchical Weighted Clustering Algorithm optimized for Mobile Hybrid Networks | <|reference_start|>WACA: A Hierarchical Weighted Clustering Algorithm optimized for Mobile Hybrid Networks: Clustering techniques create hierarchal network structures, called clusters, on an otherwise flat network. In a dynamic environment-in terms of node mobility as well as in terms of steadily changing device parame... | arxiv | @article{brust2007waca:,
title={WACA: A Hierarchical Weighted Clustering Algorithm optimized for Mobile
Hybrid Networks},
author={Matthias R. Brust, Adrian Andronache, Steffen Rothkugel},
journal={arXiv preprint arXiv:0706.1080},
year={2007},
archivePrefix={arXiv},
eprint={0706.1080},
prim... | brust2007waca: |
arxiv-507 | 0706.1084 | Sublinear Algorithms for Approximating String Compressibility | <|reference_start|>Sublinear Algorithms for Approximating String Compressibility: We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popular lossless compression schemes: run-length encoding (RLE)... | arxiv | @article{raskhodnikova2007sublinear,
title={Sublinear Algorithms for Approximating String Compressibility},
author={Sofya Raskhodnikova and Dana Ron and Ronitt Rubinfeld and Adam Smith},
journal={arXiv preprint arXiv:0706.1084},
year={2007},
archivePrefix={arXiv},
eprint={0706.1084},
primary... | raskhodnikova2007sublinear |
arxiv-508 | 0706.1087 | On Anomalies in Annotation Systems | <|reference_start|>On Anomalies in Annotation Systems: Today's computer-based annotation systems implement a wide range of functionalities that often go beyond those available in traditional paper-and-pencil annotations. Conceptually, annotation systems are based on thoroughly investigated psycho-sociological and pedag... | arxiv | @article{brust2007on,
title={On Anomalies in Annotation Systems},
author={Matthias R. Brust, Steffen Rothkugel},
journal={arXiv preprint arXiv:0706.1087},
year={2007},
archivePrefix={arXiv},
eprint={0706.1087},
primaryClass={cs.HC cs.CY}
} | brust2007on |
arxiv-509 | 0706.1096 | Inquiring the Potential of Evoking Small-World Properties for Self-Organizing Communication Networks | <|reference_start|>Inquiring the Potential of Evoking Small-World Properties for Self-Organizing Communication Networks: Mobile multi-hop ad hoc networks allow establishing local groups of communicating devices in a self-organizing way. However, in a global setting such networks fail to work properly due to network par... | arxiv | @article{brust2007inquiring,
title={Inquiring the Potential of Evoking Small-World Properties for
Self-Organizing Communication Networks},
author={Matthias R. Brust, Steffen Rothkugel, Carlos H.C. Ribeiro},
journal={Published in: Proceedings of 5th International Conference on
Networking (ICN 06), 2006, ... | brust2007inquiring |
arxiv-510 | 0706.1118 | Asynchronous games: innocence without alternation | <|reference_start|>Asynchronous games: innocence without alternation: The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of lambda-terms and PCF programs. An innocent strategy is defined as an alternating strategy with partial memory, in which the strategy pla... | arxiv | @article{melliès2007asynchronous,
title={Asynchronous games: innocence without alternation},
author={Paul-Andr'e Melli`es (PPS), Samuel Mimram (PPS)},
journal={arXiv preprint arXiv:0706.1118},
year={2007},
archivePrefix={arXiv},
eprint={0706.1118},
primaryClass={cs.LO}
} | melliès2007asynchronous |
arxiv-511 | 0706.1119 | Cointegration of the Daily Electric Power System Load and the Weather | <|reference_start|>Cointegration of the Daily Electric Power System Load and the Weather: The paper makes a thermal predictive analysis of the electric power system security for a day ahead. This predictive analysis is set as a thermal computation of the expected security. This computation is obtained by cointegrating ... | arxiv | @article{stefanov2007cointegration,
title={Cointegration of the Daily Electric Power System Load and the Weather},
author={Stefan Z. Stefanov},
journal={arXiv preprint arXiv:0706.1119},
year={2007},
archivePrefix={arXiv},
eprint={0706.1119},
primaryClass={cs.CE}
} | stefanov2007cointegration |
arxiv-512 | 0706.1127 | Redesigning Computer-based Learning Environments: Evaluation as Communication | <|reference_start|>Redesigning Computer-based Learning Environments: Evaluation as Communication: In the field of evaluation research, computer scientists live constantly upon dilemmas and conflicting theories. As evaluation is differently perceived and modeled among educational areas, it is not difficult to become tra... | arxiv | @article{brust2007redesigning,
title={Redesigning Computer-based Learning Environments: Evaluation as
Communication},
author={Matthias R. Brust, Christian M. Adriano, Ivan M.L. Ricarte},
journal={arXiv preprint arXiv:0706.1127},
year={2007},
archivePrefix={arXiv},
eprint={0706.1127},
prima... | brust2007redesigning |
arxiv-513 | 0706.1130 | A Communication Model for Adaptive Service Provisioning in Hybrid Wireless Networks | <|reference_start|>A Communication Model for Adaptive Service Provisioning in Hybrid Wireless Networks: Mobile entities with wireless links are able to form a mobile ad-hoc network. Such an infrastructureless network does not have to be administrated. However, self-organizing principles have to be applied to deal with ... | arxiv | @article{brust2007a,
title={A Communication Model for Adaptive Service Provisioning in Hybrid
Wireless Networks},
author={Matthias R. Brust, Steffen Rothkugel},
journal={arXiv preprint arXiv:0706.1130},
year={2007},
archivePrefix={arXiv},
eprint={0706.1130},
primaryClass={cs.NI cs.AR cs.CY... | brust2007a |
arxiv-514 | 0706.1137 | Automatically Restructuring Practice Guidelines using the GEM DTD | <|reference_start|>Automatically Restructuring Practice Guidelines using the GEM DTD: 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 text (pairs... | arxiv | @article{bouffier2007automatically,
title={Automatically Restructuring Practice Guidelines using the GEM DTD},
author={Amanda Bouffier (LIPN), Thierry Poibeau (LIPN)},
journal={Proceedings of Biomedical Natural Language Processing (BioNLP)
(2007) -},
year={2007},
archivePrefix={arXiv},
eprint=... | bouffier2007automatically |
arxiv-515 | 0706.1141 | Multimedia Content Distribution in Hybrid Wireless Networks using Weighted Clustering | <|reference_start|>Multimedia Content Distribution in Hybrid Wireless Networks using Weighted Clustering: Fixed infrastructured networks naturally support centralized approaches for group management and information provisioning. Contrary to infrastructured networks, in multi-hop ad-hoc networks each node acts as a rout... | arxiv | @article{andronache2007multimedia,
title={Multimedia Content Distribution in Hybrid Wireless Networks using
Weighted Clustering},
author={Adrian Andronache, Matthias R. Brust, Steffen Rothkugel},
journal={arXiv preprint arXiv:0706.1141},
year={2007},
archivePrefix={arXiv},
eprint={0706.1141},
... | andronache2007multimedia |
arxiv-516 | 0706.1142 | Localized Support for Injection Point Election in Hybrid Networks | <|reference_start|>Localized Support for Injection Point Election in Hybrid Networks: Ad-hoc networks, a promising trend in wireless technology, fail to work properly in a global setting. In most cases, self-organization and cost-free local communication cannot compensate the need for being connected, gathering urgent ... | arxiv | @article{brust2007localized,
title={Localized Support for Injection Point Election in Hybrid Networks},
author={Matthias R. Brust, Steffen Rothkugel},
journal={arXiv preprint arXiv:0706.1142},
year={2007},
archivePrefix={arXiv},
eprint={0706.1142},
primaryClass={cs.DC cs.NI}
} | brust2007localized |
arxiv-517 | 0706.1151 | A taxonomic Approach to Topology Control in Ad-hoc and Wireless Networks | <|reference_start|>A taxonomic Approach to Topology Control in Ad-hoc and Wireless Networks: Topology Control (TC) aims at tuning the topology of highly dynamic networks to provide better control over network resources and to increase the efficiency of communication. Recently, many TC protocols have been proposed. The ... | arxiv | @article{brust2007a,
title={A taxonomic Approach to Topology Control in Ad-hoc and Wireless Networks},
author={Matthias R. Brust, Steffen Rothkugel},
journal={arXiv preprint arXiv:0706.1151},
year={2007},
archivePrefix={arXiv},
eprint={0706.1151},
primaryClass={cs.NI cs.DC}
} | brust2007a |
arxiv-518 | 0706.1162 | The multiple viewpoints as approach to information retrieval within collaborative development context | <|reference_start|>The multiple viewpoints as approach to information retrieval within collaborative development context: Nowadays, to achieve competitive advantage, the industrial companies are considering that success is sustained to great product development. That is to manage the product throughout its entire lifec... | arxiv | @article{geryville2007the,
title={The multiple viewpoints as approach to information retrieval within
collaborative development context},
author={Hichem Geryville (LIESP), Yacine Ouzrout (LIESP), Abdelaziz Bouras
(LIESP), Nikolaos Sapidis},
journal={Dans Information and Communication Technologies Intern... | geryville2007the |
arxiv-519 | 0706.1169 | Vector Precoding for Wireless MIMO Systems: A Replica Analysis | <|reference_start|>Vector Precoding for Wireless MIMO Systems: A Replica Analysis: We apply the replica method to analyze vector precoding, a method to reduce transmit power in antenna array communications. The analysis applies to a very general class of channel matrices. The statistics of the channel matrix enter the ... | arxiv | @article{mueller2007vector,
title={Vector Precoding for Wireless MIMO Systems: A Replica Analysis},
author={Ralf R. Mueller, Dongning Guo, and Aris L. Moustakas},
journal={arXiv preprint arXiv:0706.1169},
year={2007},
doi={10.1109/JSAC.2008.080411},
archivePrefix={arXiv},
eprint={0706.1169},... | mueller2007vector |
arxiv-520 | 0706.1179 | Collaborative product and process model: Multiple Viewpoints approach | <|reference_start|>Collaborative product and process model: Multiple Viewpoints approach: The design and development of complex products invariably involves many actors who have different points of view on the problem they are addressing, the product being developed, and the process by which it is being developed. The ... | arxiv | @article{geryville2007collaborative,
title={Collaborative product and process model: Multiple Viewpoints approach},
author={Hichem Geryville (LIESP), Abdelaziz Bouras (LIESP), Yacine Ouzrout
(LIESP), Nikolaos Sapidis},
journal={Innovative Products and Services through Collaborative Networks
(2006) 542},... | geryville2007collaborative |
arxiv-521 | 0706.1201 | Developing a Collaborative and Autonomous Training and Learning Environment for Hybrid Wireless Networks | <|reference_start|>Developing a Collaborative and Autonomous Training and Learning Environment for Hybrid Wireless Networks: With larger memory capacities and the ability to link into wireless networks, more and more students uses palmtop and handheld computers for learning activities. However, existing software for We... | arxiv | @article{lobo2007developing,
title={Developing a Collaborative and Autonomous Training and Learning
Environment for Hybrid Wireless Networks},
author={Jose Eduardo M. Lobo, Jorge Luis Risco Becerra, Matthias R. Brust,
Steffen Rothkugel, Christian M. Adriano},
journal={arXiv preprint arXiv:0706.1201},
... | lobo2007developing |
arxiv-522 | 0706.1290 | Temporal Reasoning without Transitive Tables | <|reference_start|>Temporal Reasoning without Transitive Tables: Representing and reasoning about qualitative temporal information is an essential part of many artificial intelligence tasks. Lots of models have been proposed in the litterature for representing such temporal information. All derive from a point-based or... | arxiv | @article{schwer2007temporal,
title={Temporal Reasoning without Transitive Tables},
author={Sylviane R. Schwer (LIPN)},
journal={arXiv preprint arXiv:0706.1290},
year={2007},
archivePrefix={arXiv},
eprint={0706.1290},
primaryClass={cs.AI}
} | schwer2007temporal |
arxiv-523 | 0706.1318 | Constructing a maximum utility slate of on-line advertisements | <|reference_start|>Constructing a maximum utility slate of on-line advertisements: We present an algorithm for constructing an optimal slate of sponsored search advertisements which respects the ordering that is the outcome of a generalized second price auction, but which must also accommodate complicating factors such... | arxiv | @article{keerthi2007constructing,
title={Constructing a maximum utility slate of on-line advertisements},
author={S. Sathiya Keerthi and John A. Tomlin},
journal={arXiv preprint arXiv:0706.1318},
year={2007},
number={YR-2007-001},
archivePrefix={arXiv},
eprint={0706.1318},
primaryClass={... | keerthi2007constructing |
arxiv-524 | 0706.1395 | Opportunistic Network Coding for Video Streaming over Wireless | <|reference_start|>Opportunistic Network Coding for Video Streaming over Wireless: In this paper, we study video streaming over wireless networks with network coding capabilities. We build upon recent work, which demonstrated that network coding can increase throughput over a broadcast medium, by mixing packets from di... | arxiv | @article{seferoglu2007opportunistic,
title={Opportunistic Network Coding for Video Streaming over Wireless},
author={Hulya Seferoglu, Athina Markopoulou},
journal={arXiv preprint arXiv:0706.1395},
year={2007},
archivePrefix={arXiv},
eprint={0706.1395},
primaryClass={cs.NI}
} | seferoglu2007opportunistic |
arxiv-525 | 0706.1399 | Duality and Stability Regions of Multi-rate Broadcast and Multiple Access Networks | <|reference_start|>Duality and Stability Regions of Multi-rate Broadcast and Multiple Access Networks: We characterize stability regions of two-user fading Gaussian multiple access (MAC) and broadcast (BC) networks with centralized scheduling. The data to be transmitted to the users is encoded into codewords of fixed l... | arxiv | @article{cadambe2007duality,
title={Duality and Stability Regions of Multi-rate Broadcast and Multiple
Access Networks},
author={Viveck R. Cadambe and Syed A. Jafar},
journal={arXiv preprint arXiv:0706.1399},
year={2007},
archivePrefix={arXiv},
eprint={0706.1399},
primaryClass={cs.IT math.... | cadambe2007duality |
arxiv-526 | 0706.1402 | Analyzing Design Process and Experiments on the AnITA Generic Tutoring System | <|reference_start|>Analyzing Design Process and Experiments on the AnITA Generic Tutoring System: In the field of tutoring systems, investigations have shown that there are many tutoring systems specific to a specific domain that, because of their static architecture, cannot be adapted to other domains. As consequence,... | arxiv | @article{brust2007analyzing,
title={Analyzing Design Process and Experiments on the AnITA Generic Tutoring
System},
author={Matthias R. Brust, Steffen Rothkugel},
journal={arXiv preprint arXiv:0706.1402},
year={2007},
archivePrefix={arXiv},
eprint={0706.1402},
primaryClass={cs.CY cs.HC}
} | brust2007analyzing |
arxiv-527 | 0706.1409 | A Proof of a Recursion for Bessel Moments | <|reference_start|>A Proof of a Recursion for Bessel Moments: We provide a proof of a conjecture in (Bailey, Borwein, Borwein, Crandall 2007) on the existence and form of linear recursions for moments of powers of the Bessel function $K_0$.<|reference_end|> | arxiv | @article{borwein2007a,
title={A Proof of a Recursion for Bessel Moments},
author={Jonathan M. Borwein, Bruno Salvy (INRIA Rocquencourt)},
journal={arXiv preprint arXiv:0706.1409},
year={2007},
doi={10.1080/10586458.2008.10129032},
archivePrefix={arXiv},
eprint={0706.1409},
primaryClass={... | borwein2007a |
arxiv-528 | 0706.1410 | Evolutionary Mesh Numbering: Preliminary Results | <|reference_start|>Evolutionary Mesh Numbering: Preliminary Results: Mesh numbering is a critical issue in Finite Element Methods, as the computational cost of one analysis is highly dependent on the order of the nodes of the mesh. This paper presents some preliminary investigations on the problem of mesh numbering usi... | arxiv | @article{sourd2007evolutionary,
title={Evolutionary Mesh Numbering: Preliminary Results},
author={Francis Sourd (CMAP), Marc Schoenauer (CMAP)},
journal={Dans Adaptive Computing in Design and Manufacture, ACDM'98 (1998)
137-150},
year={2007},
archivePrefix={arXiv},
eprint={0706.1410},
prim... | sourd2007evolutionary |
arxiv-529 | 0706.1456 | A Generic Model of Contracts for Embedded Systems | <|reference_start|>A Generic Model of Contracts for Embedded Systems: We present the mathematical foundations of the contract-based model developed in the framework of the SPEEDS project. SPEEDS aims at developing methods and tools to support "speculative design", a design methodology in which distributed designers dev... | arxiv | @article{benveniste2007a,
title={A Generic Model of Contracts for Embedded Systems},
author={Albert Benveniste (IRISA), Benoit Caillaud (IRISA), Roberto Passerone},
journal={arXiv preprint arXiv:0706.1456},
year={2007},
archivePrefix={arXiv},
eprint={0706.1456},
primaryClass={cs.SE}
} | benveniste2007a |
arxiv-530 | 0706.1477 | VPSPACE and a transfer theorem over the complex field | <|reference_start|>VPSPACE and a transfer theorem over the complex field: We extend the transfer theorem of [KP2007] to the complex field. That is, we investigate the links between the class VPSPACE of families of polynomials and the Blum-Shub-Smale model of computation over C. Roughly speaking, a family of polynomials... | arxiv | @article{koiran2007vpspace,
title={VPSPACE and a transfer theorem over the complex field},
author={Pascal Koiran (LIP), Sylvain Perifel (LIP)},
journal={arXiv preprint arXiv:0706.1477},
year={2007},
archivePrefix={arXiv},
eprint={0706.1477},
primaryClass={cs.CC}
} | koiran2007vpspace |
arxiv-531 | 0706.1563 | Optimal Choice of Threshold in Two Level Processor Sharing | <|reference_start|>Optimal Choice of Threshold in Two Level Processor Sharing: We analyze the Two Level Processor Sharing (TLPS) scheduling discipline with the hyper-exponential job size distribution and with the Poisson arrival process. TLPS is a convenient model to study the benefit of the file size based differentia... | arxiv | @article{avrachenkov2007optimal,
title={Optimal Choice of Threshold in Two Level Processor Sharing},
author={Konstantin Avrachenkov (INRIA Sophia Antipolis), Patrick Brown (FT
R&D), Natalia Osipova (INRIA Sophia Antipolis)},
journal={arXiv preprint arXiv:0706.1563},
year={2007},
archivePrefix={arX... | avrachenkov2007optimal |
arxiv-532 | 0706.1588 | Detection of Gauss-Markov Random Fields with Nearest-Neighbor Dependency | <|reference_start|>Detection of Gauss-Markov Random Fields with Nearest-Neighbor Dependency: The problem of hypothesis testing against independence for a Gauss-Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the log-likelihood ratio of detection is derived. Assuming rando... | arxiv | @article{anandkumar2007detection,
title={Detection of Gauss-Markov Random Fields with Nearest-Neighbor Dependency},
author={Animashree Anandkumar, Lang Tong, Ananthram Swami},
journal={vol. 55, no. 2, Feb. 2009},
year={2007},
doi={10.1109/TIT.2008.2009855},
archivePrefix={arXiv},
eprint={070... | anandkumar2007detection |
arxiv-533 | 0706.1614 | Non-Cooperative Scheduling of Multiple Bag-of-Task Applications | <|reference_start|>Non-Cooperative Scheduling of Multiple Bag-of-Task Applications: Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper we analyze the behavior of $K$ non-cooperative schedulers using the optimal strategy that maximize their eff... | arxiv | @article{legrand2007non-cooperative,
title={Non-Cooperative Scheduling of Multiple Bag-of-Task Applications},
author={Arnaud Legrand (INRIA Rh^one-Alpes / Id-Imag, Lig), Corinne Touati
(INRIA Rh^one-Alpes / Id-Imag, Lig)},
journal={Dans INFOCOM (2007)},
year={2007},
archivePrefix={arXiv},
epri... | legrand2007non-cooperative |
arxiv-534 | 0706.1617 | Relative Strength of Strategy Elimination Procedures | <|reference_start|>Relative Strength of Strategy Elimination Procedures: We compare here the relative strength of four widely used procedures on finite strategic games: iterated elimination of weakly/strictly dominated strategies by a pure/mixed strategy. A complication is that none of these procedures is based on a mo... | arxiv | @article{apt2007relative,
title={Relative Strength of Strategy Elimination Procedures},
author={Krzysztof R. Apt},
journal={Economics Bulletin, Vol. 3, no. 21, pp. 1-9 (2007)},
year={2007},
archivePrefix={arXiv},
eprint={0706.1617},
primaryClass={cs.GT}
} | apt2007relative |
arxiv-535 | 0706.1642 | On the growth of components with non fixed excesses | <|reference_start|>On the growth of components with non fixed excesses: Denote by an $l$-component a connected graph with $l$ edges more than vertices. We prove that the expected number of creations of $(l+1)$-component, by means of adding a new edge to an $l$-component in a randomly growing graph with $n$ vertices, te... | arxiv | @article{baert2007on,
title={On the growth of components with non fixed excesses},
author={Anne-Elisabeth Baert (LaRIA), Vlady Ravelomanana (LIPN), Lo"ys
Thimonier (LaRIA)},
journal={Discrete Applied Mathematics 130, 3 (17/07/2003) 487--493},
year={2007},
doi={10.1016/S0166-218X(03)00326-3},
a... | baert2007on |
arxiv-536 | 0706.1665 | Another Proof of Wright's Inequalities | <|reference_start|>Another Proof of Wright's Inequalities: We present a short way of proving the inequalities obtained by Wright in [Journal of Graph Theory, 4: 393 - 407 (1980)] concerning the number of connected graphs with $\ell$ edges more than vertices.<|reference_end|> | arxiv | @article{ravelomanana2007another,
title={Another Proof of Wright's Inequalities},
author={Vlady Ravelomanana (LIPN)},
journal={arXiv preprint arXiv:0706.1665},
year={2007},
archivePrefix={arXiv},
eprint={0706.1665},
primaryClass={cs.DM math.CO}
} | ravelomanana2007another |
arxiv-537 | 0706.1692 | A Methodology for Efficient Space-Time Adapter Design Space Exploration: A Case Study of an Ultra Wide Band Interleaver | <|reference_start|>A Methodology for Efficient Space-Time Adapter Design Space Exploration: A Case Study of an Ultra Wide Band Interleaver: This paper presents a solution to efficiently explore the design space of communication adapters. In most digital signal processing (DSP) applications, the overall architecture of ... | arxiv | @article{chavet2007a,
title={A Methodology for Efficient Space-Time Adapter Design Space Exploration:
A Case Study of an Ultra Wide Band Interleaver},
author={Cyrille Chavet (LESTER, STM), Philippe Coussy (LESTER), Pascal Urard
(STM), Eric Martin (LESTER)},
journal={Proceedings of the IEEE International... | chavet2007a |
arxiv-538 | 0706.1700 | Information Criteria and Arithmetic Codings : An Illustration on Raw Images | <|reference_start|>Information Criteria and Arithmetic Codings : An Illustration on Raw Images: In this paper we give a short theoretical description of the general predictive adaptive arithmetic coding technique. The links between this technique and the works of J. Rissanen in the 80's, in particular the BIC informati... | arxiv | @article{coq2007information,
title={Information Criteria and Arithmetic Codings : An Illustration on Raw
Images},
author={Guilhem Coq (1), Olivier Alata (2), Marc Arnaudon (1), Christian
Olivier (2) ((1) Laboratoire de Math'ematiques et Applications Poitiers
France, (2) Laboratoire Signal Image et Communi... | coq2007information |
arxiv-539 | 0706.1716 | Modeling and analysis using hybrid Petri nets | <|reference_start|>Modeling and analysis using hybrid Petri nets: This paper is devoted to the use of hybrid Petri nets (PNs) for modeling and control of hybrid dynamic systems (HDS). Modeling, analysis and control of HDS attract ever more of researchers' attention and several works have been devoted to these topics. W... | arxiv | @article{ghomri2007modeling,
title={Modeling and analysis using hybrid Petri nets},
author={Lat'efa Ghomri (GIPSA-lab), Hassane Alla (GIPSA-lab)},
journal={Nonlinear Analysis: Hybrid Systems Volume 1, Issue 2 (01/06/2007)
Pages 141-153},
year={2007},
archivePrefix={arXiv},
eprint={0706.1716},
... | ghomri2007modeling |
arxiv-540 | 0706.1751 | MacWilliams Identity for Codes with the Rank Metric | <|reference_start|>MacWilliams Identity for Codes with the Rank Metric: The MacWilliams identity, which relates the weight distribution of a code to the weight distribution of its dual code, is useful in determining the weight distribution of codes. In this paper, we derive the MacWilliams identity for linear codes wit... | arxiv | @article{gadouleau2007macwilliams,
title={MacWilliams Identity for Codes with the Rank Metric},
author={Maximilien Gadouleau and Zhiyuan Yan},
journal={arXiv preprint arXiv:0706.1751},
year={2007},
archivePrefix={arXiv},
eprint={0706.1751},
primaryClass={cs.IT math.IT}
} | gadouleau2007macwilliams |
arxiv-541 | 0706.1755 | FreeBSD Mandatory Access Control Usage for Implementing Enterprise Security Policies | <|reference_start|>FreeBSD Mandatory Access Control Usage for Implementing Enterprise Security Policies: FreeBSD was one of the first widely deployed free operating systems to provide mandatory access control. It supports a number of classic MAC models. This tutorial paper addresses exploiting this implementation to en... | arxiv | @article{bolshakov2007freebsd,
title={FreeBSD Mandatory Access Control Usage for Implementing Enterprise
Security Policies},
author={Kirill Bolshakov (1), Elena Reshetova (1) ((1) Saint-Petersburg State
University of Aerospace Instrumentation)},
journal={arXiv preprint arXiv:0706.1755},
year={2007},... | bolshakov2007freebsd |
arxiv-542 | 0706.1780 | Le travail collaboratif dans le cadre d'un projet architectural | <|reference_start|>Le travail collaboratif dans le cadre d'un projet architectural: The analysis of the practices and the tendencies of the users at the time of the search for information on Internet makes it possible to highlight several points. The search for information becomes powerful after knowledge of the typolo... | arxiv | @article{ango-obiang2007le,
title={Le travail collaboratif dans le cadre d'un projet architectural},
author={Marie-France Ango-Obiang (SITE, Loria)},
journal={Dans Innovation et tradition de l'association internationale
Management Strat\'egique (2007)},
year={2007},
archivePrefix={arXiv},
epri... | ango-obiang2007le |
arxiv-543 | 0706.1790 | How to measure efficiency? | <|reference_start|>How to measure efficiency?: In the context of applied game theory in networking environments, a number of concepts have been proposed to measure both efficiency and optimality of resource allocations, the most famous certainly being the price of anarchy and the Jain index. Yet, very few have tried to... | arxiv | @article{legrand2007how,
title={How to measure efficiency?},
author={Arnaud Legrand (INRIA Rh^one-Alpes / ID-IMAG), Corinne Touati (INRIA
Rh^one-Alpes / ID-IMAG)},
journal={arXiv preprint arXiv:0706.1790},
year={2007},
archivePrefix={arXiv},
eprint={0706.1790},
primaryClass={cs.GT}
} | legrand2007how |
arxiv-544 | 0706.1860 | FIPA-based Interoperable Agent Mobility Proposal | <|reference_start|>FIPA-based Interoperable Agent Mobility Proposal: This paper presents a proposal for a flexible agent mobility architecture based on IEEE-FIPA standards and intended to be one of them. This proposal is a first step towards interoperable mobility mechanisms, which are needed for future agent migration... | arxiv | @article{cucurull2007fipa-based,
title={FIPA-based Interoperable Agent Mobility Proposal},
author={Jordi Cucurull, Ramon Marti, Sergi Robles, Joan Borrell, Guillermo
Navarro},
journal={arXiv preprint arXiv:0706.1860},
year={2007},
archivePrefix={arXiv},
eprint={0706.1860},
primaryClass={cs... | cucurull2007fipa-based |
arxiv-545 | 0706.1926 | Towards understanding and modelling office daily life | <|reference_start|>Towards understanding and modelling office daily life: Measuring and modeling human behavior is a very complex task. In this paper we present our initial thoughts on modeling and automatic recognition of some human activities in an office. We argue that to successfully model human activities, we need... | arxiv | @article{bezzi2007towards,
title={Towards understanding and modelling office daily life},
author={Michele Bezzi, Robin Groenevelt},
journal={arXiv preprint arXiv:0706.1926},
year={2007},
archivePrefix={arXiv},
eprint={0706.1926},
primaryClass={cs.CV cs.CY}
} | bezzi2007towards |
arxiv-546 | 0706.2010 | Information-theoretic security without an honest majority | <|reference_start|>Information-theoretic security without an honest majority: We present six multiparty protocols with information-theoretic security that tolerate an arbitrary number of corrupt participants. All protocols assume pairwise authentic private channels and a broadcast channel (in a single case, we require ... | arxiv | @article{broadbent2007information-theoretic,
title={Information-theoretic security without an honest majority},
author={Anne Broadbent and Alain Tapp},
journal={Proceedings of ASIACRYPT 2007 pp. 410-426},
year={2007},
doi={10.1007/978-3-540-76900-2_25},
archivePrefix={arXiv},
eprint={0706.20... | broadbent2007information-theoretic |
arxiv-547 | 0706.2025 | On the Performance Evaluation of Encounter-based Worm Interactions Based on Node Characteristics | <|reference_start|>On the Performance Evaluation of Encounter-based Worm Interactions Based on Node Characteristics: An encounter-based network is a frequently disconnected wireless ad-hoc network requiring nearby neighbors to store and forward data utilizing mobility and encounters over time. Using traditional approac... | arxiv | @article{tanachaiwiwat2007on,
title={On the Performance Evaluation of Encounter-based Worm Interactions Based
on Node Characteristics},
author={Sapon Tanachaiwiwat, Ahmed Helmy},
journal={arXiv preprint arXiv:0706.2025},
year={2007},
archivePrefix={arXiv},
eprint={0706.2025},
primaryClass=... | tanachaiwiwat2007on |
arxiv-548 | 0706.2033 | Power Allocation for Discrete-Input Delay-Limited Fading Channels | <|reference_start|>Power Allocation for Discrete-Input Delay-Limited Fading Channels: We consider power allocation algorithms for fixed-rate transmission over Nakagami-m non-ergodic block-fading channels with perfect transmitter and receiver channel state information and discrete input signal constellations, under both... | arxiv | @article{nguyen2007power,
title={Power Allocation for Discrete-Input Delay-Limited Fading Channels},
author={Khoa D. Nguyen, Albert Guillen i Fabregas and Lars K. Rasmussen},
journal={arXiv preprint arXiv:0706.2033},
year={2007},
archivePrefix={arXiv},
eprint={0706.2033},
primaryClass={cs.IT... | nguyen2007power |
arxiv-549 | 0706.2035 | Critique of Feinstein's Proof that P is not Equal to NP | <|reference_start|>Critique of Feinstein's Proof that P is not Equal to NP: We examine a proof by Craig Alan Feinstein that P is not equal to NP. We present counterexamples to claims made in his paper and expose a flaw in the methodology he uses to make his assertions. The fault in his argument is the incorrect use of ... | arxiv | @article{sabo2007critique,
title={Critique of Feinstein's Proof that P is not Equal to NP},
author={Kyle Sabo, Ryan Schmitt, Michael Silverman},
journal={arXiv preprint arXiv:0706.2035},
year={2007},
archivePrefix={arXiv},
eprint={0706.2035},
primaryClass={cs.CC}
} | sabo2007critique |
arxiv-550 | 0706.2040 | Getting started in probabilistic graphical models | <|reference_start|>Getting started in probabilistic graphical models: Probabilistic graphical models (PGMs) have become a popular tool for computational analysis of biological data in a variety of domains. But, what exactly are they and how do they work? How can we use PGMs to discover patterns that are biologically re... | arxiv | @article{airoldi2007getting,
title={Getting started in probabilistic graphical models},
author={Edoardo M Airoldi},
journal={Airoldi EM (2007) Getting started in probabilistic graphical
models. PLoS Comput Biol 3(12): e252},
year={2007},
doi={10.1371/journal.pcbi.0030252},
archivePrefix={arXiv... | airoldi2007getting |
arxiv-551 | 0706.2069 | Building Portable Thread Schedulers for Hierarchical Multiprocessors: the BubbleSched Framework | <|reference_start|>Building Portable Thread Schedulers for Hierarchical Multiprocessors: the BubbleSched Framework: Exploiting full computational power of current more and more hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-uniform architecture. Un... | arxiv | @article{thibault2007building,
title={Building Portable Thread Schedulers for Hierarchical Multiprocessors:
the BubbleSched Framework},
author={Samuel Thibault (INRIA Futurs), Raymond Namyst (INRIA Futurs),
Pierre-Andr'e Wacrenier (INRIA Futurs)},
journal={Dans EuroPar (2007)},
year={2007},
arch... | thibault2007building |
arxiv-552 | 0706.2073 | An Efficient OpenMP Runtime System for Hierarchical Arch | <|reference_start|>An Efficient OpenMP Runtime System for Hierarchical Arch: Exploiting the full computational power of always deeper hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-uniform architecture. The emergence of multi-core chips and NUMA ma... | arxiv | @article{thibault2007an,
title={An Efficient OpenMP Runtime System for Hierarchical Arch},
author={Samuel Thibault (INRIA Futurs), Franc{c}ois Broquedis (INRIA Futurs),
Brice Goglin (INRIA Futurs), Raymond Namyst (INRIA Futurs), Pierre-Andr'e
Wacrenier (INRIA Futurs)},
journal={Dans International Worksh... | thibault2007an |
arxiv-553 | 0706.2076 | A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of<br> Automata | <|reference_start|>A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of<br> Automata: Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Build... | arxiv | @article{aehlig2007a,
title={A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of<br>
Automata},
author={Klaus Aehlig},
journal={Logical Methods in Computer Science, Volume 3, Issue 3 (July 4,
2007) lmcs:1232},
year={2007},
doi={10.2168/LMCS-3(3:1)2007},
archivePrefix={arXiv}... | aehlig2007a |
arxiv-554 | 0706.2146 | Efficient Multidimensional Data Redistribution for Resizable Parallel Computations | <|reference_start|>Efficient Multidimensional Data Redistribution for Resizable Parallel Computations: Traditional parallel schedulers running on cluster supercomputers support only static scheduling, where the number of processors allocated to an application remains fixed throughout the execution of the job. This resu... | arxiv | @article{sudarsan2007efficient,
title={Efficient Multidimensional Data Redistribution for Resizable Parallel
Computations},
author={Rajesh Sudarsan and Calvin J. Ribbens},
journal={arXiv preprint arXiv:0706.2146},
year={2007},
archivePrefix={arXiv},
eprint={0706.2146},
primaryClass={cs.DC}... | sudarsan2007efficient |
arxiv-555 | 0706.2153 | Stability of boundary measures | <|reference_start|>Stability of boundary measures: We introduce the boundary measure at scale r of a compact subset of the n-dimensional Euclidean space. We show how it can be computed for point clouds and suggest these measures can be used for feature detection. The main contribution of this work is the proof a quanti... | arxiv | @article{chazal2007stability,
title={Stability of boundary measures},
author={Fr'ed'eric Chazal (INRIA Sophia Antipolis), David Cohen-Steiner
(INRIA Sophia Antipolis), Quentin M'erigot (INRIA Sophia Antipolis)},
journal={Boundary measures for geometric inference, Found. Comput. Math.,
10 (2), pp. 221-24... | chazal2007stability |
arxiv-556 | 0706.2155 | Dualheap Selection Algorithm: Efficient, Inherently Parallel and Somewhat Mysterious | <|reference_start|>Dualheap Selection Algorithm: Efficient, Inherently Parallel and Somewhat Mysterious: An inherently parallel algorithm is proposed that efficiently performs selection: finding the K-th largest member of a set of N members. Selection is a common component of many more complex algorithms and therefore ... | arxiv | @article{sepesi2007dualheap,
title={Dualheap Selection Algorithm: Efficient, Inherently Parallel and
Somewhat Mysterious},
author={Greg Sepesi},
journal={arXiv preprint arXiv:0706.2155},
year={2007},
archivePrefix={arXiv},
eprint={0706.2155},
primaryClass={cs.DS cs.CC cs.DC}
} | sepesi2007dualheap |
arxiv-557 | 0706.2293 | Resource control of object-oriented programs | <|reference_start|>Resource control of object-oriented programs: A sup-interpretation is a tool which provides an upper bound on the size of a value computed by some symbol of a program. Sup-interpretations have shown their interest to deal with the complexity of first order functional programs. For instance, they allo... | arxiv | @article{marion2007resource,
title={Resource control of object-oriented programs},
author={Jean-Yves Marion and Romain Pechoux},
journal={arXiv preprint arXiv:0706.2293},
year={2007},
archivePrefix={arXiv},
eprint={0706.2293},
primaryClass={cs.PL cs.LO}
} | marion2007resource |
arxiv-558 | 0706.2310 | Space-time coding techniques with bit-interleaved coded modulations for MIMO block-fading channels | <|reference_start|>Space-time coding techniques with bit-interleaved coded modulations for MIMO block-fading channels: The space-time bit-interleaved coded modulation (ST-BICM) is an efficient technique to obtain high diversity and coding gain on a block-fading MIMO channel. Its maximum-likelihood (ML) performance is c... | arxiv | @article{gresset2007space-time,
title={Space-time coding techniques with bit-interleaved coded modulations for
MIMO block-fading channels},
author={Nicolas Gresset, Loic Brunel, Joseph Boutros},
journal={arXiv preprint arXiv:0706.2310},
year={2007},
doi={10.1109/TIT.2008.920240},
archivePrefix... | gresset2007space-time |
arxiv-559 | 0706.2331 | Pricing American Options for Jump Diffusions by Iterating Optimal Stopping Problems for Diffusions | <|reference_start|>Pricing American Options for Jump Diffusions by Iterating Optimal Stopping Problems for Diffusions: We approximate the price of the American put for jump diffusions by a sequence of functions, which are computed iteratively. This sequence converges to the price function uniformly and exponentially fa... | arxiv | @article{bayraktar2007pricing,
title={Pricing American Options for Jump Diffusions by Iterating Optimal
Stopping Problems for Diffusions},
author={Erhan Bayraktar, Hao Xing},
journal={arXiv preprint arXiv:0706.2331},
year={2007},
archivePrefix={arXiv},
eprint={0706.2331},
primaryClass={cs.... | bayraktar2007pricing |
arxiv-560 | 0706.2434 | Interference and Outage in Clustered Wireless Ad Hoc Networks | <|reference_start|>Interference and Outage in Clustered Wireless Ad Hoc Networks: In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, the node locations are assumed to form a Poisson clustered proc... | arxiv | @article{ganti2007interference,
title={Interference and Outage in Clustered Wireless Ad Hoc Networks},
author={RadhaKrishna Ganti and Martin Haenggi},
journal={arXiv preprint arXiv:0706.2434},
year={2007},
doi={10.1109/TIT.2009.2025543},
archivePrefix={arXiv},
eprint={0706.2434},
primary... | ganti2007interference |
arxiv-561 | 0706.2479 | Progresses in the Analysis of Stochastic 2D Cellular Automata: a Study of Asynchronous 2D Minority | <|reference_start|>Progresses in the Analysis of Stochastic 2D Cellular Automata: a Study of Asynchronous 2D Minority: Cellular automata are often used to model systems in physics, social sciences, biology that are inherently asynchronous. Over the past 20 years, studies have demonstrated that the behavior of cellular ... | arxiv | @article{regnault2007progresses,
title={Progresses in the Analysis of Stochastic 2D Cellular Automata: a Study
of Asynchronous 2D Minority},
author={Damien Regnault and Nicolas Schabanel and 'Eric Thierry},
journal={arXiv preprint arXiv:0706.2479},
year={2007},
archivePrefix={arXiv},
eprint={0... | regnault2007progresses |
arxiv-562 | 0706.2520 | Analysis of Inter-Domain Traffic Correlations: Random Matrix Theory Approach | <|reference_start|>Analysis of Inter-Domain Traffic Correlations: Random Matrix Theory Approach: The traffic behavior of University of Louisville network with the interconnected backbone routers and the number of Virtual Local Area Network (VLAN) subnets is investigated using the Random Matrix Theory (RMT) approach. We... | arxiv | @article{rojkova2007analysis,
title={Analysis of Inter-Domain Traffic Correlations: Random Matrix Theory
Approach},
author={Viktoria Rojkova, Mehmed Kantardzic},
journal={arXiv preprint arXiv:0706.2520},
year={2007},
archivePrefix={arXiv},
eprint={0706.2520},
primaryClass={cs.NI}
} | rojkova2007analysis |
arxiv-563 | 0706.2544 | Abstract machines for dialogue games | <|reference_start|>Abstract machines for dialogue games: The notion of abstract Boehm tree has arisen as an operationally-oriented distillation of works on game semantics, and has been investigated in two papers. This paper revisits the notion, providing more syntactic support and more examples (like call-by-value eval... | arxiv | @article{curien2007abstract,
title={Abstract machines for dialogue games},
author={Pierre-Louis Curien (PPS), Hugo Herbelin (INRIA Futurs)},
journal={arXiv preprint arXiv:0706.2544},
year={2007},
archivePrefix={arXiv},
eprint={0706.2544},
primaryClass={cs.LO}
} | curien2007abstract |
arxiv-564 | 0706.2575 | A new lower bound on the independence number of a graph | <|reference_start|>A new lower bound on the independence number of a graph: For a given connected graph G on n vertices and m edges, we prove that its independence number is at least (2m+n+2-sqrt(sqr(2m+n+2)-16sqr(n)))/8.<|reference_end|> | arxiv | @article{kettani2007a,
title={A new lower bound on the independence number of a graph},
author={O.Kettani},
journal={arXiv preprint arXiv:0706.2575},
year={2007},
archivePrefix={arXiv},
eprint={0706.2575},
primaryClass={cs.DM}
} | kettani2007a |
arxiv-565 | 0706.2585 | Decisive Markov Chains | <|reference_start|>Decisive Markov Chains: We consider qualitative and quantitative verification problems for infinite-state Markov chains. We call a Markov chain decisive w.r.t. a given set of target states F if it almost certainly eventually reaches either F or a state from which F can no longer be reached. While all... | arxiv | @article{abdulla2007decisive,
title={Decisive Markov Chains},
author={Parosh Aziz Abdulla, Noomene Ben Henda, Richard Mayr},
journal={Logical Methods in Computer Science, Volume 3, Issue 4 (November
8, 2007) lmcs:867},
year={2007},
doi={10.2168/LMCS-3(4:7)2007},
archivePrefix={arXiv},
epri... | abdulla2007decisive |
arxiv-566 | 0706.2606 | Randomness Extraction via Delta-Biased Masking in the Presence of a Quantum Attacker | <|reference_start|>Randomness Extraction via Delta-Biased Masking in the Presence of a Quantum Attacker: Randomness extraction is of fundamental importance for information-theoretic cryptography. It allows to transform a raw key about which an attacker has some limited knowledge into a fully secure random key, on which... | arxiv | @article{fehr2007randomness,
title={Randomness Extraction via Delta-Biased Masking in the Presence of a
Quantum Attacker},
author={Serge Fehr, Christian Schaffner},
journal={arXiv preprint arXiv:0706.2606},
year={2007},
archivePrefix={arXiv},
eprint={0706.2606},
primaryClass={quant-ph cs.C... | fehr2007randomness |
arxiv-567 | 0706.2619 | Algorithms for Omega-Regular Games with Imperfect Information | <|reference_start|>Algorithms for Omega-Regular Games with Imperfect Information: We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about the history of a play, namely, on the past sequence of obse... | arxiv | @article{chatterjee2007algorithms,
title={Algorithms for Omega-Regular Games with Imperfect Information},
author={Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger,<br>
Jean-Francois Raskin},
journal={Logical Methods in Computer Science, Volume 3, Issue 3 (July 27,
2007) lmcs:1094},
year={20... | chatterjee2007algorithms |
arxiv-568 | 0706.2725 | The Complexity of Determining Existence a Hamiltonian Cycle is $O(n^3)$ | <|reference_start|>The Complexity of Determining Existence a Hamiltonian Cycle is $O(n^3)$: The Hamiltonian cycle problem in digraph is mapped into a matching cover bipartite graph. Based on this mapping, it is proved that determining existence a Hamiltonian cycle in graph is $O(n^3)$.<|reference_end|> | arxiv | @article{zhu2007the,
title={The Complexity of Determining Existence a Hamiltonian Cycle is $O(n^3)$},
author={Guohun Zhu},
journal={arXiv preprint arXiv:0706.2725},
year={2007},
archivePrefix={arXiv},
eprint={0706.2725},
primaryClass={cs.DS cs.CC cs.DM}
} | zhu2007the |
arxiv-569 | 0706.2732 | A Design Methodology for Space-Time Adapter | <|reference_start|>A Design Methodology for Space-Time Adapter: This paper presents a solution to efficiently explore the design space of communication adapters. In most digital signal processing (DSP) applications, the overall architecture of the system is significantly affected by communication architecture, so the d... | arxiv | @article{chavet2007a,
title={A Design Methodology for Space-Time Adapter},
author={Cyrille Chavet (LESTER), Philippe Coussy (LESTER), Pascal Urard (STM),
Eric Martin (LESTER)},
journal={Proceedings of the 2007 ACM Great Lakes Symposium on VLSI
(12/03/2007) 347},
year={2007},
archivePrefix={arXiv... | chavet2007a |
arxiv-570 | 0706.2746 | Abstract Storage Devices | <|reference_start|>Abstract Storage Devices: A quantum storage device differs radically from a conventional physical storage device. Its state can be set to any value in a certain (infinite) state space, but in general every possible read operation yields only partial information about the stored state. The purpose o... | arxiv | @article{koenig2007abstract,
title={Abstract Storage Devices},
author={Robert Koenig, Ueli Maurer, Stefano Tessaro},
journal={arXiv preprint arXiv:0706.2746},
year={2007},
archivePrefix={arXiv},
eprint={0706.2746},
primaryClass={cs.DM cs.CC cs.IT math.IT}
} | koenig2007abstract |
arxiv-571 | 0706.2748 | A Survey of Unix Init Schemes | <|reference_start|>A Survey of Unix Init Schemes: In most modern operating systems, init (as in "initialization") is the program launched by the kernel at boot time. It runs as a daemon and typically has PID 1. Init is responsible for spawning all other processes and scavenging zombies. It is also responsible for reboo... | arxiv | @article{royon2007a,
title={A Survey of Unix Init Schemes},
author={Yvan Royon (INRIA Rh^one-Alpes), St'ephane Fr'enot (INRIA
Rh^one-Alpes)},
journal={arXiv preprint arXiv:0706.2748},
year={2007},
archivePrefix={arXiv},
eprint={0706.2748},
primaryClass={cs.OS}
} | royon2007a |
arxiv-572 | 0706.2795 | Dirty-paper Coding without Channel Information at the Transmitter and Imperfect Estimation at the Receiver | <|reference_start|>Dirty-paper Coding without Channel Information at the Transmitter and Imperfect Estimation at the Receiver: In this paper, we examine the effects of imperfect channel estimation at the receiver and no channel knowledge at the transmitter on the capacity of the fading Costa's channel with channel stat... | arxiv | @article{piantanida2007dirty-paper,
title={Dirty-paper Coding without Channel Information at the Transmitter and
Imperfect Estimation at the Receiver},
author={Pablo Piantanida and Pierre Duhamel},
journal={Proc. of IEEE International Conference on Communications (ICC),
Glasgow, Scotland, 2007},
yea... | piantanida2007dirty-paper |
arxiv-573 | 0706.2797 | Extraction d'entit\'es dans des collections \'evolutives | <|reference_start|>Extraction d'entit\'es dans des collections \'evolutives: The goal of our work is to use a set of reports and extract named entities, in our case the names of Industrial or Academic partners. Starting with an initial list of entities, we use a first set of documents to identify syntactic patterns tha... | arxiv | @article{despeyroux2007extraction,
title={Extraction d'entit\'es dans des collections \'evolutives},
author={Thierry Despeyroux (INRIA Rocquencourt / INRIA Sophia Antipolis),
Eduardo Fraschini (INRIA Rocquencourt / INRIA Sophia Antipolis), Anne-Marie
Vercoustre (INRIA Rocquencourt / INRIA Sophia Antipolis)}... | despeyroux2007extraction |
arxiv-574 | 0706.2809 | On the Outage Capacity of a Practical Decoder Using Channel Estimation Accuracy | <|reference_start|>On the Outage Capacity of a Practical Decoder Using Channel Estimation Accuracy: The optimal decoder achieving the outage capacity under imperfect channel estimation is investigated. First, by searching into the family of nearest neighbor decoders, which can be easily implemented on most practical co... | arxiv | @article{piantanida2007on,
title={On the Outage Capacity of a Practical Decoder Using Channel Estimation
Accuracy},
author={Pablo Piantanida, Sajad Sadough and Pierre Duhamel},
journal={Proc. of IEEE International Symposium on Information Theory
(ISIT), Nice, France, 2007},
year={2007},
doi={10.... | piantanida2007on |
arxiv-575 | 0706.2824 | M\'ethodologie de mod\'elisation et d'impl\'ementation d'adaptateurs spatio-temporels | <|reference_start|>M\'ethodologie de mod\'elisation et d'impl\'ementation d'adaptateurs spatio-temporels: The re-use of pre-designed blocks is a well-known concept of the software development. This technique has been applied to System-on-Chip (SoC) design whose complexity and heterogeneity are growing. The re-use is ma... | arxiv | @article{chavet2007m\'ethodologie,
title={M\'ethodologie de mod\'elisation et d'impl\'ementation d'adaptateurs
spatio-temporels},
author={Cyrille Chavet (LESTER, STM), Philippe Coussy (LESTER), Pascal Urard
(STM), Eric Martin (LESTER)},
journal={Actes de la conference MajecSTIC 2005 (16/11/2005) 151},
... | chavet2007m\'ethodologie |
arxiv-576 | 0706.2839 | Cache Analysis of Non-uniform Distribution Sorting Algorithms | <|reference_start|>Cache Analysis of Non-uniform Distribution Sorting Algorithms: We analyse the average-case cache performance of distribution sorting algorithms in the case when keys are independently but not necessarily uniformly distributed. The analysis is for both `in-place' and `out-of-place' distribution sortin... | arxiv | @article{rahman2007cache,
title={Cache Analysis of Non-uniform Distribution Sorting Algorithms},
author={Naila Rahman and Rajeev Raman},
journal={arXiv preprint arXiv:0706.2839},
year={2007},
archivePrefix={arXiv},
eprint={0706.2839},
primaryClass={cs.DS cs.PF}
} | rahman2007cache |
arxiv-577 | 0706.2888 | Variations on Kak's Three Stage Quantum Cryptography Protocol | <|reference_start|>Variations on Kak's Three Stage Quantum Cryptography Protocol: This paper introduces a variation on Kak's three-stage quanutm key distribution protocol which allows for defence against the man in the middle attack. In addition, we introduce a new protocol, which also offers similar resiliance against... | arxiv | @article{thomas2007variations,
title={Variations on Kak's Three Stage Quantum Cryptography Protocol},
author={James Harold Thomas},
journal={arXiv preprint arXiv:0706.2888},
year={2007},
archivePrefix={arXiv},
eprint={0706.2888},
primaryClass={cs.CR}
} | thomas2007variations |
arxiv-578 | 0706.2893 | Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort | <|reference_start|>Dualheap Sort Algorithm: An Inherently Parallel Generalization of Heapsort: A generalization of the heapsort algorithm is proposed. At the expense of about 50% more comparison and move operations for typical cases, the dualheap sort algorithm offers several advantages over heapsort: improved cache pe... | arxiv | @article{sepesi2007dualheap,
title={Dualheap Sort Algorithm: An Inherently Parallel Generalization of
Heapsort},
author={Greg Sepesi},
journal={arXiv preprint arXiv:0706.2893},
year={2007},
archivePrefix={arXiv},
eprint={0706.2893},
primaryClass={cs.DS cs.CC cs.DC}
} | sepesi2007dualheap |
arxiv-579 | 0706.2906 | Capacity Scaling for MIMO Two-Way Relaying | <|reference_start|>Capacity Scaling for MIMO Two-Way Relaying: A multiple input multiple output (MIMO) two-way relay channel is considered, where two sources want to exchange messages with each other using multiple relay nodes, and both the sources and relay nodes are equipped with multiple antennas. Both the sources a... | arxiv | @article{vaze2007capacity,
title={Capacity Scaling for MIMO Two-Way Relaying},
author={Rahul Vaze and Robert W. Heath Jr},
journal={arXiv preprint arXiv:0706.2906},
year={2007},
archivePrefix={arXiv},
eprint={0706.2906},
primaryClass={cs.IT math.IT}
} | vaze2007capacity |
arxiv-580 | 0706.2926 | Reducing the Error Floor | <|reference_start|>Reducing the Error Floor: We discuss how the loop calculus approach of [Chertkov, Chernyak '06], enhanced by the pseudo-codeword search algorithm of [Chertkov, Stepanov '06] and the facet-guessing idea from [Dimakis, Wainwright '06], improves decoding of graph based codes in the error-floor domain. T... | arxiv | @article{chertkov2007reducing,
title={Reducing the Error Floor},
author={Michael Chertkov (Los Alamos)},
journal={arXiv preprint arXiv:0706.2926},
year={2007},
number={LA-UR-07-4047},
archivePrefix={arXiv},
eprint={0706.2926},
primaryClass={cs.IT math.IT}
} | chertkov2007reducing |
arxiv-581 | 0706.2963 | Outage Behavior of Discrete Memoryless Channels Under Channel Estimation Errors | <|reference_start|>Outage Behavior of Discrete Memoryless Channels Under Channel Estimation Errors: Classically, communication systems are designed assuming perfect channel state information at the receiver and/or transmitter. However, in many practical situations, only an estimate of the channel is available that diff... | arxiv | @article{piantanida2007outage,
title={Outage Behavior of Discrete Memoryless Channels Under Channel Estimation
Errors},
author={Pablo Piantanida, Gerald Matz and Pierre Duhamel},
journal={Proc. of International Symposium on Information Theory and its
Applications (ISITA), Seoul, Korea, 2006, pp. 417-422... | piantanida2007outage |
arxiv-582 | 0706.2974 | Remote laboratories: new technology and standard based architecture | <|reference_start|>Remote laboratories: new technology and standard based architecture: E-Laboratories are important components of e- learning environments, especially in scientific and technical disciplines. First widespread E-Labs consisted in proposing simulations of real systems (virtual labs), as building remote l... | arxiv | @article{benmohamed2007remote,
title={Remote laboratories: new technology and standard based architecture},
author={Hcene Benmohamed (LIESP), Arnaud Leleve (LIESP), Patrick Pr'evot
(LIESP)},
journal={Proceedings of 2004 International Conference on Information and
Communication Technologies: From Theory ... | benmohamed2007remote |
arxiv-583 | 0706.3008 | A Generic Deployment Framework for Grid Computing and Distributed Applications | <|reference_start|>A Generic Deployment Framework for Grid Computing and Distributed Applications: Deployment of distributed applications on large systems, and especially on grid infrastructures, becomes a more and more complex task. Grid users spend a lot of time to prepare, install and configure middleware and applic... | arxiv | @article{flissi2007a,
title={A Generic Deployment Framework for Grid Computing and Distributed
Applications},
author={Areski Flissi (LIFL), Philippe Merle (INRIA Futurs)},
journal={OTM 2006, LNCS 4276 (2006) 1402-1411},
year={2007},
doi={10.1007/11914952_26},
archivePrefix={arXiv},
eprint=... | flissi2007a |
arxiv-584 | 0706.3009 | Application of a design space exploration tool to enhance interleaver generation | <|reference_start|>Application of a design space exploration tool to enhance interleaver generation: This paper presents a methodology to efficiently explore the design space of communication adapters. In most digital signal processing (DSP) applications, the overall performance of the system is significantly affected ... | arxiv | @article{chavet2007application,
title={Application of a design space exploration tool to enhance interleaver
generation},
author={Cyrille Chavet (LESTER, STM), Philippe Coussy (LESTER), Pascal Urard
(STM), Eric Martin (LESTER)},
journal={Proceedings of the European Signal Processing Conference
(EUSIPC... | chavet2007application |
arxiv-585 | 0706.3060 | N-Body Simulations on GPUs | <|reference_start|>N-Body Simulations on GPUs: Commercial graphics processors (GPUs) have high compute capacity at very low cost, which makes them attractive for general purpose scientific computing. In this paper we show how graphics processors can be used for N-body simulations to obtain improvements in performance o... | arxiv | @article{elsen2007n-body,
title={N-Body Simulations on GPUs},
author={Erich Elsen, V. Vishal, Mike Houston, Vijay Pande, Pat Hanrahan, Eric
Darve},
journal={arXiv preprint arXiv:0706.3060},
year={2007},
archivePrefix={arXiv},
eprint={0706.3060},
primaryClass={cs.CE cs.DC}
} | elsen2007n-body |
arxiv-586 | 0706.3076 | On the Performance of Joint Fingerprint Embedding and Decryption Scheme | <|reference_start|>On the Performance of Joint Fingerprint Embedding and Decryption Scheme: Till now, few work has been done to analyze the performances of joint fingerprint embedding and decryption schemes. In this paper, the security of the joint fingerprint embedding and decryption scheme proposed by Kundur et al. i... | arxiv | @article{lian2007on,
title={On the Performance of Joint Fingerprint Embedding and Decryption Scheme},
author={Shiguo Lian, Zhongxuan Liu, Zhen Ren, Haila Wang},
journal={arXiv preprint arXiv:0706.3076},
year={2007},
archivePrefix={arXiv},
eprint={0706.3076},
primaryClass={cs.MM cs.CR}
} | lian2007on |
arxiv-587 | 0706.3104 | Group Testing with Random Pools: optimal two-stage algorithms | <|reference_start|>Group Testing with Random Pools: optimal two-stage algorithms: We study Probabilistic Group Testing of a set of N items each of which is defective with probability p. We focus on the double limit of small defect probability, p<<1, and large number of variables, N>>1, taking either p->0 after $N\to\in... | arxiv | @article{mezard2007group,
title={Group Testing with Random Pools: optimal two-stage algorithms},
author={Marc Mezard, Cristina Toninelli},
journal={arXiv preprint arXiv:0706.3104},
year={2007},
archivePrefix={arXiv},
eprint={0706.3104},
primaryClass={cs.DS cond-mat.dis-nn cond-mat.stat-mech ... | mezard2007group |
arxiv-588 | 0706.3129 | Closed-Form Density of States and Localization Length for a Non-Hermitian Disordered System | <|reference_start|>Closed-Form Density of States and Localization Length for a Non-Hermitian Disordered System: We calculate the Lyapunov exponent for the non-Hermitian Zakharov-Shabat eigenvalue problem corresponding to the attractive non-linear Schroedinger equation with a Gaussian random pulse as initial value funct... | arxiv | @article{kazakopoulos2007closed-form,
title={Closed-Form Density of States and Localization Length for a
Non-Hermitian Disordered System},
author={Pavlos Kazakopoulos and Aris L. Moustakas},
journal={arXiv preprint arXiv:0706.3129},
year={2007},
doi={10.1103/PhysRevE.78.016603},
archivePrefix=... | kazakopoulos2007closed-form |
arxiv-589 | 0706.3132 | EasyVoice: Integrating voice synthesis with Skype | <|reference_start|>EasyVoice: Integrating voice synthesis with Skype: This paper presents EasyVoice, a system that integrates voice synthesis with Skype. EasyVoice allows a person with voice disabilities to talk with another person located anywhere in the world, removing an important obstacle that affect these people d... | arxiv | @article{condado2007easyvoice:,
title={EasyVoice: Integrating voice synthesis with Skype},
author={Paulo A. Condado and Fernando G. Lobo},
journal={arXiv preprint arXiv:0706.3132},
year={2007},
archivePrefix={arXiv},
eprint={0706.3132},
primaryClass={cs.CY cs.HC}
} | condado2007easyvoice: |
arxiv-590 | 0706.3146 | WiFi Epidemiology: Can Your Neighbors' Router Make Yours Sick? | <|reference_start|>WiFi Epidemiology: Can Your Neighbors' Router Make Yours Sick?: In densely populated urban areas WiFi routers form a tightly interconnected proximity network that can be exploited as a substrate for the spreading of malware able to launch massive fraudulent attack and affect entire urban areas WiFi n... | arxiv | @article{hu2007wifi,
title={WiFi Epidemiology: Can Your Neighbors' Router Make Yours Sick?},
author={Hao Hu, Steven Myers, Vittoria Colizza, Alessandro Vespignani},
journal={Proceedings of the National Academy of Sciences, vol. 106, no. 5,
1318-1323 (2009)},
year={2007},
doi={10.1073/pnas.08119731... | hu2007wifi |
arxiv-591 | 0706.3159 | Une s\'emantique observationnelle du mod\`ele des bo\^ites pour la r\'esolution de programmes logiques (version \'etendue) | <|reference_start|>Une s\'emantique observationnelle du mod\`ele des bo\^ites pour la r\'esolution de programmes logiques (version \'etendue): This report specifies an observational semantics and gives an original presentation of the Byrd's box model. The approach accounts for the semantics of Prolog tracers independen... | arxiv | @article{deransart2007une,
title={Une s\'emantique observationnelle du mod\`ele des bo\^ites pour la
r\'esolution de programmes logiques (version \'etendue)},
author={Pierre Deransart (INRIA Rocquencourt), Mireille Ducass'e (IRISA),
G'erard Ferrand (LIFO)},
journal={arXiv preprint arXiv:0706.3159},
... | deransart2007une |
arxiv-592 | 0706.3165 | A solution for actors' viewpoints representation with collaborative product development | <|reference_start|>A solution for actors' viewpoints representation with collaborative product development: As product complexity and marketing competition increase, a collaborative product development is necessary for companies which develop high quality products in short lead-times. To support product actors from dif... | arxiv | @article{geryville2007a,
title={A solution for actors' viewpoints representation with collaborative
product development},
author={Hichem Geryville (LIESP), Abdelaziz Bouras (LIESP), Yacine Ouzrout
(LIESP), Nikolaos Sapidis},
journal={Research in Interactive Design (2007) 39-40},
year={2007},
doi... | geryville2007a |
arxiv-593 | 0706.3170 | Asymptotic Analysis of General Multiuser Detectors in MIMO DS-CDMA Channels | <|reference_start|>Asymptotic Analysis of General Multiuser Detectors in MIMO DS-CDMA Channels: We analyze a MIMO DS-CDMA channel with a general multiuser detector including a nonlinear multiuser detector, using the replica method. In the many-user, limit the MIMO DS-CDMA channel with the multiuser detector is decouple... | arxiv | @article{takeuchi2007asymptotic,
title={Asymptotic Analysis of General Multiuser Detectors in MIMO DS-CDMA
Channels},
author={Keigo Takeuchi, Toshiyuki Tanaka, and Toru Yano},
journal={arXiv preprint arXiv:0706.3170},
year={2007},
doi={10.1109/JSAC.2008.080407},
archivePrefix={arXiv},
epri... | takeuchi2007asymptotic |
arxiv-594 | 0706.3188 | A tutorial on conformal prediction | <|reference_start|>A tutorial on conformal prediction: Conformal prediction uses past experience to determine precise levels of confidence in new predictions. Given an error probability $\epsilon$, together with a method that makes a prediction $\hat{y}$ of a label $y$, it produces a set of labels, typically containing... | arxiv | @article{shafer2007a,
title={A tutorial on conformal prediction},
author={Glenn Shafer and Vladimir Vovk},
journal={Journal of Machine Learning Research 9 (2008) 371-421.
http://www.jmlr.org/papers/v9/shafer08a.html},
year={2007},
archivePrefix={arXiv},
eprint={0706.3188},
primaryClass={cs... | shafer2007a |
arxiv-595 | 0706.3295 | Lower bounds on the minimum average distance of binary codes | <|reference_start|>Lower bounds on the minimum average distance of binary codes: New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.<|reference_end|> | arxiv | @article{mounits2007lower,
title={Lower bounds on the minimum average distance of binary codes},
author={Beniamin Mounits},
journal={arXiv preprint arXiv:0706.3295},
year={2007},
archivePrefix={arXiv},
eprint={0706.3295},
primaryClass={cs.IT math.CO math.IT}
} | mounits2007lower |
arxiv-596 | 0706.3305 | A simple generalization of the ElGamal cryptosystem to non-abelian groups II | <|reference_start|>A simple generalization of the ElGamal cryptosystem to non-abelian groups II: This is a study of the MOR cryptosystem using the special linear group over finite fields. The automorphism group of the special linear group is analyzed for this purpose. At our current state of knowledge, I show that the ... | arxiv | @article{mahalanobis2007a,
title={A simple generalization of the ElGamal cryptosystem to non-abelian
groups II},
author={Ayan Mahalanobis},
journal={arXiv preprint arXiv:0706.3305},
year={2007},
archivePrefix={arXiv},
eprint={0706.3305},
primaryClass={cs.CR math.GR}
} | mahalanobis2007a |
arxiv-597 | 0706.3341 | A Sequent Calculus for Modelling Interferences | <|reference_start|>A Sequent Calculus for Modelling Interferences: A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in proof search. The calculus includes two new connectives to deal with multise... | arxiv | @article{fouqueré2007a,
title={A Sequent Calculus for Modelling Interferences},
author={Christophe Fouquer'e (LIPN)},
journal={arXiv preprint arXiv:0706.3341},
year={2007},
archivePrefix={arXiv},
eprint={0706.3341},
primaryClass={cs.LO}
} | fouqueré2007a |
arxiv-598 | 0706.3350 | Optimal Replica Placement in Tree Networks with QoS and Bandwidth Constraints and the Closest Allocation Policy | <|reference_start|>Optimal Replica Placement in Tree Networks with QoS and Bandwidth Constraints and the Closest Allocation Policy: This paper deals with the replica placement problem on fully homogeneous tree networks known as the Replica Placement optimization problem. The client requests are known beforehand, while ... | arxiv | @article{rehn-sonigo2007optimal,
title={Optimal Replica Placement in Tree Networks with QoS and Bandwidth
Constraints and the Closest Allocation Policy},
author={Veronika Rehn-Sonigo (INRIA Rh^one-Alpes, LIP)},
journal={arXiv preprint arXiv:0706.3350},
year={2007},
archivePrefix={arXiv},
eprin... | rehn-sonigo2007optimal |
arxiv-599 | 0706.3412 | On Canonical Forms of Complete Problems via First-order Projections | <|reference_start|>On Canonical Forms of Complete Problems via First-order Projections: The class of problems complete for NP via first-order reductions is known to be characterized by existential second-order sentences of a fixed form. All such sentences are built around the so-called generalized IS-form of the senten... | arxiv | @article{borges2007on,
title={On Canonical Forms of Complete Problems via First-order Projections},
author={Nerio Borges, Blai Bonet},
journal={arXiv preprint arXiv:0706.3412},
year={2007},
archivePrefix={arXiv},
eprint={0706.3412},
primaryClass={cs.CC}
} | borges2007on |
arxiv-600 | 0706.3430 | The Impact of Channel Feedback on Opportunistic Relay Selection for Hybrid-ARQ in Wireless Networks | <|reference_start|>The Impact of Channel Feedback on Opportunistic Relay Selection for Hybrid-ARQ in Wireless Networks: This paper presents a decentralized relay selection protocol for a dense wireless network and describes channel feedback strategies that improve its performance. The proposed selection protocol suppor... | arxiv | @article{lo2007the,
title={The Impact of Channel Feedback on Opportunistic Relay Selection for
Hybrid-ARQ in Wireless Networks},
author={Caleb K. Lo, Robert W. Heath Jr. and Sriram Vishwanath},
journal={arXiv preprint arXiv:0706.3430},
year={2007},
doi={10.1109/TVT.2008.928896},
archivePrefix=... | lo2007the |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.