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-701 | 0707.0978 | When Network Coding and Dirty Paper Coding meet in a Cooperative Ad Hoc Network | <|reference_start|>When Network Coding and Dirty Paper Coding meet in a Cooperative Ad Hoc Network: We develop and analyze new cooperative strategies for ad hoc networks that are more spectrally efficient than classical DF cooperative protocols. Using analog network coding, our strategies preserve the practical half-du... | arxiv | @article{fawaz2007when,
title={When Network Coding and Dirty Paper Coding meet in a Cooperative Ad Hoc
Network},
author={Nadia Fawaz (1), David Gesbert (1), Merouane Debbah (2) ((1) Eurecom
Institute, (2) Supelec)},
journal={arXiv preprint arXiv:0707.0978},
year={2007},
archivePrefix={arXiv},
... | fawaz2007when |
arxiv-702 | 0707.1008 | On Cognitive Interference Networks | <|reference_start|>On Cognitive Interference Networks: We study the high-power asymptotic behavior of the sum-rate capacity of multi-user interference networks with an equal number of transmitters and receivers. We assume that each transmitter is cognizant of the message it wishes to convey to its corresponding receive... | arxiv | @article{lapidoth2007on,
title={On Cognitive Interference Networks},
author={Amos Lapidoth, Shlomo Shamai (Shitz), Michele A. Wigger},
journal={arXiv preprint arXiv:0707.1008},
year={2007},
doi={10.1109/ITW.2007.4313095},
archivePrefix={arXiv},
eprint={0707.1008},
primaryClass={cs.IT mat... | lapidoth2007on |
arxiv-703 | 0707.1025 | The star trellis decoding of Reed-Solomon codes | <|reference_start|>The star trellis decoding of Reed-Solomon codes: The new method for Reed-Solomon codes decoding is introduced. The method is based on the star trellis decoding of the binary image of Reed-Solomon codes.<|reference_end|> | arxiv | @article{fedorenko2007the,
title={The star trellis decoding of Reed-Solomon codes},
author={Sergei Fedorenko},
journal={arXiv preprint arXiv:0707.1025},
year={2007},
archivePrefix={arXiv},
eprint={0707.1025},
primaryClass={cs.IT math.IT}
} | fedorenko2007the |
arxiv-704 | 0707.1051 | Noisy Sorting Without Resampling | <|reference_start|>Noisy Sorting Without Resampling: In this paper we study noisy sorting without re-sampling. In this problem there is an unknown order $a_{\pi(1)} < ... < a_{\pi(n)}$ where $\pi$ is a permutation on $n$ elements. The input is the status of $n \choose 2$ queries of the form $q(a_i,x_j)$, where $q(a_i,a... | arxiv | @article{braverman2007noisy,
title={Noisy Sorting Without Resampling},
author={Mark Braverman, Elchanan Mossel},
journal={arXiv preprint arXiv:0707.1051},
year={2007},
archivePrefix={arXiv},
eprint={0707.1051},
primaryClass={cs.DS}
} | braverman2007noisy |
arxiv-705 | 0707.1053 | Exploration via design and the cost of uncertainty in keyword auctions | <|reference_start|>Exploration via design and the cost of uncertainty in keyword auctions: We present a deterministic exploration mechanism for sponsored search auctions, which enables the auctioneer to learn the relevance scores of advertisers, and allows advertisers to estimate the true value of clicks generated at t... | arxiv | @article{singh2007exploration,
title={Exploration via design and the cost of uncertainty in keyword auctions},
author={Sudhir Kumar Singh, Vwani P. Roychowdhury, Milan Bradonji'c, Behnam
A. Rezaei},
journal={arXiv preprint arXiv:0707.1053},
year={2007},
archivePrefix={arXiv},
eprint={0707.1053... | singh2007exploration |
arxiv-706 | 0707.1057 | For-profit mediators in sponsored search advertising | <|reference_start|>For-profit mediators in sponsored search advertising: A mediator is a well-known construct in game theory, and is an entity that plays on behalf of some of the agents who choose to use its services, while the rest of the agents participate in the game directly. We initiate a game theoretic study of s... | arxiv | @article{singh2007for-profit,
title={For-profit mediators in sponsored search advertising},
author={Sudhir Kumar Singh, Vwani P. Roychowdhury, Himawan Gunadhi, Behnam A.
Rezaei},
journal={arXiv preprint arXiv:0707.1057},
year={2007},
archivePrefix={arXiv},
eprint={0707.1057},
primaryClass=... | singh2007for-profit |
arxiv-707 | 0707.1059 | Projection semantics for rigid loops | <|reference_start|>Projection semantics for rigid loops: A rigid loop is a for-loop with a counter not accessible to the loop body or any other part of a program. Special instructions for rigid loops are introduced on top of the syntax of the program algebra PGA. Two different semantic projections are provided and prov... | arxiv | @article{bergstra2007projection,
title={Projection semantics for rigid loops},
author={Jan A. Bergstra and Alban Ponse},
journal={arXiv preprint arXiv:0707.1059},
year={2007},
number={PRG0604},
archivePrefix={arXiv},
eprint={0707.1059},
primaryClass={cs.PL}
} | bergstra2007projection |
arxiv-708 | 0707.1063 | High-resolution distributed sampling of bandlimited fields with low-precision sensors | <|reference_start|>High-resolution distributed sampling of bandlimited fields with low-precision sensors: The problem of sampling a discrete-time sequence of spatially bandlimited fields with a bounded dynamic range, in a distributed, communication-constrained, processing environment is addressed. A central unit, havin... | arxiv | @article{kumar2007high-resolution,
title={High-resolution distributed sampling of bandlimited fields with
low-precision sensors},
author={Animesh Kumar, Prakash Ishwar, and Kannan Ramchandran},
journal={arXiv preprint arXiv:0707.1063},
year={2007},
doi={10.1109/TIT.2010.2090194},
archivePrefix... | kumar2007high-resolution |
arxiv-709 | 0707.1064 | The Effect of Noise Correlation in AF Relay Networks | <|reference_start|>The Effect of Noise Correlation in AF Relay Networks: In wireless relay networks, noise at the relays can be correlated possibly due to common interference or noise propagation from preceding hops. In this work we consider a parallel relay network with noise correlation. For the relay strategy of amp... | arxiv | @article{gomadam2007the,
title={The Effect of Noise Correlation in AF Relay Networks},
author={Krishna S. Gomadam and Syed A. Jafar},
journal={arXiv preprint arXiv:0707.1064},
year={2007},
archivePrefix={arXiv},
eprint={0707.1064},
primaryClass={cs.IT math.IT}
} | gomadam2007the |
arxiv-710 | 0707.1083 | Delayed Correlations in Inter-Domain Network Traffic | <|reference_start|>Delayed Correlations in Inter-Domain Network Traffic: To observe the evolution of network traffic correlations we analyze the eigenvalue spectra and eigenvectors statistics of delayed correlation matrices of network traffic counts time series. Delayed correlation matrix D is composed of the correlati... | arxiv | @article{rojkova2007delayed,
title={Delayed Correlations in Inter-Domain Network Traffic},
author={Viktoria Rojkova, Mehmed Kantardzic},
journal={arXiv preprint arXiv:0707.1083},
year={2007},
archivePrefix={arXiv},
eprint={0707.1083},
primaryClass={cs.NI cs.IR}
} | rojkova2007delayed |
arxiv-711 | 0707.1095 | Better Algorithms and Bounds for Directed Maximum Leaf Problems | <|reference_start|>Better Algorithms and Bounds for Directed Maximum Leaf Problems: The {\sc Directed Maximum Leaf Out-Branching} problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this paper, we improve known parameterized algorithms and ... | arxiv | @article{alon2007better,
title={Better Algorithms and Bounds for Directed Maximum Leaf Problems},
author={Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket
Saurabh},
journal={arXiv preprint arXiv:0707.1095},
year={2007},
archivePrefix={arXiv},
eprint={0707.1095},
primary... | alon2007better |
arxiv-712 | 0707.1099 | Worst-Case Interactive Communication and Enhancing Sensor Network Lifetime | <|reference_start|>Worst-Case Interactive Communication and Enhancing Sensor Network Lifetime: We are concerned with the problem of maximizing the worst-case lifetime of a data-gathering wireless sensor network consisting of a set of sensor nodes directly communicating with a base-station.We propose to solve this probl... | arxiv | @article{agnihotri2007worst-case,
title={Worst-Case Interactive Communication and Enhancing Sensor Network
Lifetime},
author={Samar Agnihotri and Pavan Nuggehalli},
journal={arXiv preprint arXiv:0707.1099},
year={2007},
archivePrefix={arXiv},
eprint={0707.1099},
primaryClass={cs.IT math.IT... | agnihotri2007worst-case |
arxiv-713 | 0707.1151 | Logic, Design & Organization of PTVD-SHAM; A Parallel Time Varying & Data Super-helical Access Memory | <|reference_start|>Logic, Design & Organization of PTVD-SHAM; A Parallel Time Varying & Data Super-helical Access Memory: This paper encompasses a super helical memory system's design, 'Boolean logic & image-logic' as a theoretical concept of an invention-model to 'store time-data' in terms of anticipating the best mem... | arxiv | @article{alipour2007logic,,
title={Logic, Design & Organization of PTVD-SHAM; A Parallel Time Varying &
Data Super-helical Access Memory},
author={P. B. Alipour},
journal={arXiv preprint arXiv:0707.1151},
year={2007},
archivePrefix={arXiv},
eprint={0707.1151},
primaryClass={cs.AR}
} | alipour2007logic, |
arxiv-714 | 0707.1176 | Expressing an NP-Complete Problem as the Solvability of a Polynomial Equation | <|reference_start|>Expressing an NP-Complete Problem as the Solvability of a Polynomial Equation: We demonstrate a polynomial approach to express the decision version of the directed Hamiltonian Cycle Problem (HCP), which is NP-Complete, as the Solvability of a Polynomial Equation with a constant number of variables, w... | arxiv | @article{chermakani2007expressing,
title={Expressing an NP-Complete Problem as the Solvability of a Polynomial
Equation},
author={Deepak Chermakani},
journal={arXiv preprint arXiv:0707.1176},
year={2007},
archivePrefix={arXiv},
eprint={0707.1176},
primaryClass={cs.CC cs.DM}
} | chermakani2007expressing |
arxiv-715 | 0707.1193 | Singular curves and cusp points in the joint space of 3-RPR parallel manipulators | <|reference_start|>Singular curves and cusp points in the joint space of 3-RPR parallel manipulators: This paper investigates the singular curves in two-dimensional slices of the joint space of a family of planar parallel manipulators. It focuses on special points, referred to as cusp points, which may appear on these ... | arxiv | @article{zein2007singular,
title={Singular curves and cusp points in the joint space of 3-RPR parallel
manipulators},
author={Mazen Zein (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={International Conference On Robotics And Automation (2006) 1-6},
year={2007},
archivePrefi... | zein2007singular |
arxiv-716 | 0707.1241 | Graph-Based Decoding in the Presence of ISI | <|reference_start|>Graph-Based Decoding in the Presence of ISI: We propose an approximation of maximum-likelihood detection in ISI channels based on linear programming or message passing. We convert the detection problem into a binary decoding problem, which can be easily combined with LDPC decoding. We show that, for ... | arxiv | @article{taghavi2007graph-based,
title={Graph-Based Decoding in the Presence of ISI},
author={Mohammad H. Taghavi, Paul H. Siegel},
journal={arXiv preprint arXiv:0707.1241},
year={2007},
doi={10.1109/TIT.2011.2110070},
archivePrefix={arXiv},
eprint={0707.1241},
primaryClass={cs.IT math.I... | taghavi2007graph-based |
arxiv-717 | 0707.1266 | Building Decision Procedures in the Calculus of Inductive Constructions | <|reference_start|>Building Decision Procedures in the Calculus of Inductive Constructions: It is commonly agreed that the success of future proof assistants will rely on their ability to incorporate computations within deduction in order to mimic the mathematician when replacing the proof of a proposition P by the pro... | arxiv | @article{blanqui2007building,
title={Building Decision Procedures in the Calculus of Inductive Constructions},
author={Fr'ed'eric Blanqui (INRIA Lorraine - LORIA), Jean-Pierre Jouannaud
(INRIA Futurs), Pierre-Yves Strub (INRIA Futurs)},
journal={Dans 16th EACSL Annual Conference on Computer Science and Lo... | blanqui2007building |
arxiv-718 | 0707.1288 | Espaces de repr\'esentation multidimensionnels d\'edi\'es \`a la visualisation | <|reference_start|>Espaces de repr\'esentation multidimensionnels d\'edi\'es \`a la visualisation: In decision-support systems, the visual component is important for On Line Analysis Processing (OLAP). In this paper, we propose a new approach that faces the visualization problem due to data sparsity. We use the results... | arxiv | @article{messaoud2007espaces,
title={Espaces de repr\'esentation multidimensionnels d\'edi\'es \`a la
visualisation},
author={Riadh Ben Messaoud and Kamel Aouiche and C'ecile Favre},
journal={arXiv preprint arXiv:0707.1288},
year={2007},
archivePrefix={arXiv},
eprint={0707.1288},
primaryCl... | messaoud2007espaces |
arxiv-719 | 0707.1295 | Efficient supervised learning in networks with binary synapses | <|reference_start|>Efficient supervised learning in networks with binary synapses: Recent experimental studies indicate that synaptic changes induced by neuronal activity are discrete jumps between a small number of stable states. Learning in systems with discrete synapses is known to be a computationally hard problem.... | arxiv | @article{baldassi2007efficient,
title={Efficient supervised learning in networks with binary synapses},
author={Carlo Baldassi, Alfredo Braunstein, Nicolas Brunel, Riccardo Zecchina},
journal={PNAS 104, 11079-11084 (2007)},
year={2007},
doi={10.1073/pnas.0700324104},
archivePrefix={arXiv},
e... | baldassi2007efficient |
arxiv-720 | 0707.1304 | Un index de jointure pour les entrep\^ots de donn\'ees XML | <|reference_start|>Un index de jointure pour les entrep\^ots de donn\'ees XML: XML data warehouses form an interesting basis for decision-support applications that exploit heterogeneous data from multiple sources. However, XML-native database systems currently bear limited performances and it is necessary to research w... | arxiv | @article{mahboubi2007un,
title={Un index de jointure pour les entrep\^ots de donn\'ees XML},
author={Hadj Mahboubi and Kamel Aouiche and J'er^ome Darmont},
journal={arXiv preprint arXiv:0707.1304},
year={2007},
archivePrefix={arXiv},
eprint={0707.1304},
primaryClass={cs.DB}
} | mahboubi2007un |
arxiv-721 | 0707.1306 | S\'election simultan\'ee d'index et de vues mat\'erialis\'ees | <|reference_start|>S\'election simultan\'ee d'index et de vues mat\'erialis\'ees: Indices and materialized views are physical structures that accelerate data access in data warehouses. However, these data structures generate some maintenance overhead. They also share the same storage space. The existing studies about i... | arxiv | @article{maiz2007s\'election,
title={S\'election simultan\'ee d'index et de vues mat\'erialis\'ees},
author={Nora Maiz and Kamel Aouiche and J'er^ome Darmont},
journal={arXiv preprint arXiv:0707.1306},
year={2007},
archivePrefix={arXiv},
eprint={0707.1306},
primaryClass={cs.DB}
} | maiz2007s\'election |
arxiv-722 | 0707.1364 | Report on Generic Case Complexity | <|reference_start|>Report on Generic Case Complexity: This article is a short introduction to generic case complexity, which is a recently developed way of measuring the difficulty of a computational problem while ignoring atypical behavior on a small set of inputs. Generic case complexity applies to both recursively s... | arxiv | @article{gilman2007report,
title={Report on Generic Case Complexity},
author={Robert Gilman, Alexei G. Miasnikov, Alexey D. Myasnikov, Alexander
Ushakov},
journal={arXiv preprint arXiv:0707.1364},
year={2007},
archivePrefix={arXiv},
eprint={0707.1364},
primaryClass={cs.CC}
} | gilman2007report |
arxiv-723 | 0707.1372 | Computability Closure: Ten Years Later | <|reference_start|>Computability Closure: Ten Years Later: The notion of computability closure has been introduced for proving the termination of higher-order rewriting with first-order matching by Jean-Pierre Jouannaud and Mitsuhiro Okada in a 1997 draft which later served as a basis for the author's PhD. In this pape... | arxiv | @article{blanqui2007computability,
title={Computability Closure: Ten Years Later},
author={Fr'ed'eric Blanqui (INRIA Lorraine - LORIA)},
journal={Dans Colloquium in honor of Jean-Pierre Jouannaud, 4600 (2007)},
year={2007},
archivePrefix={arXiv},
eprint={0707.1372},
primaryClass={cs.LO}
} | blanqui2007computability |
arxiv-724 | 0707.1432 | Sequential products in effect categories | <|reference_start|>Sequential products in effect categories: A new categorical framework is provided for dealing with multiple arguments in a programming language with effects, for example in a language with imperative features. Like related frameworks (Monads, Arrows, Freyd categories), we distinguish two kinds of fun... | arxiv | @article{dumas2007sequential,
title={Sequential products in effect categories},
author={Jean-Guillaume Dumas (LJK), Dominique Duval (LJK), Jean-Claude Reynaud
(RC)},
journal={arXiv preprint arXiv:0707.1432},
year={2007},
archivePrefix={arXiv},
eprint={0707.1432},
primaryClass={math.CT cs.P... | dumas2007sequential |
arxiv-725 | 0707.1452 | Clusters, Graphs, and Networks for Analysing Internet-Web-Supported Communication within a Virtual Community | <|reference_start|>Clusters, Graphs, and Networks for Analysing Internet-Web-Supported Communication within a Virtual Community: The proposal is to use clusters, graphs and networks as models in order to analyse the Web structure. Clusters, graphs and networks provide knowledge representation and organization. Clusters... | arxiv | @article{polanco2007clusters,,
title={Clusters, Graphs, and Networks for Analysing Internet-Web-Supported
Communication within a Virtual Community},
author={Xavier Polanco (INIST)},
journal={Advances in Knowledge Organization (2002) 364-371},
year={2007},
archivePrefix={arXiv},
eprint={0707.14... | polanco2007clusters, |
arxiv-726 | 0707.1470 | Secrecy Capacity Region of Fading Broadcast Channels | <|reference_start|>Secrecy Capacity Region of Fading Broadcast Channels: The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential inform... | arxiv | @article{liang2007secrecy,
title={Secrecy Capacity Region of Fading Broadcast Channels},
author={Yingbin Liang, H. Vincent Poor and Shlomo Shamai (Shitz)},
journal={arXiv preprint arXiv:0707.1470},
year={2007},
doi={10.1109/ISIT.2007.4557401},
archivePrefix={arXiv},
eprint={0707.1470},
p... | liang2007secrecy |
arxiv-727 | 0707.1480 | IRVO: an Interaction Model for designing Collaborative Mixed Reality systems | <|reference_start|>IRVO: an Interaction Model for designing Collaborative Mixed Reality systems: This paper presents an interaction model adapted to mixed reality environments known as IRVO (Interacting with Real and Virtual Objects). IRVO aims at modeling the interaction between one or more users and the Mixed Reality... | arxiv | @article{chalon2007irvo:,
title={IRVO: an Interaction Model for designing Collaborative Mixed Reality
systems},
author={Ren'e Chalon (ICTT), Bertrand T. David (ICTT)},
journal={Human Computer International 2005, U.S. CD (11/08/2005) 1-10},
year={2007},
archivePrefix={arXiv},
eprint={0707.1480}... | chalon2007irvo: |
arxiv-728 | 0707.1490 | Fast computing of velocity field for flows in industrial burners and pumps | <|reference_start|>Fast computing of velocity field for flows in industrial burners and pumps: In this work we present a technique of fast numerical computation for solutions of Navier-Stokes equations in the case of flows of industrial interest. At first the partial differential equations are translated into a set of ... | arxiv | @article{argentini2007fast,
title={Fast computing of velocity field for flows in industrial burners and
pumps},
author={Gianluca Argentini},
journal={arXiv preprint arXiv:0707.1490},
year={2007},
archivePrefix={arXiv},
eprint={0707.1490},
primaryClass={math.NA cs.MS}
} | argentini2007fast |
arxiv-729 | 0707.1501 | Random subgroups and analysis of the length-based and quotient attacks | <|reference_start|>Random subgroups and analysis of the length-based and quotient attacks: In this paper we discuss generic properties of "random subgroups" of a given group G. It turns out that in many groups G (even in most exotic of them) the random subgroups have a simple algebraic structure and they "sit" inside G... | arxiv | @article{myasnikov2007random,
title={Random subgroups and analysis of the length-based and quotient attacks},
author={Alexei G. Myasnikov, Alexander Ushakov},
journal={arXiv preprint arXiv:0707.1501},
year={2007},
archivePrefix={arXiv},
eprint={0707.1501},
primaryClass={math.GR cs.CR}
} | myasnikov2007random |
arxiv-730 | 0707.1515 | Properties of polynomial bases used in a line-surface intersection algorithm | <|reference_start|>Properties of polynomial bases used in a line-surface intersection algorithm: In [5], Srijuntongsiri and Vavasis propose the "Kantorovich-Test Subdivision algorithm", or KTS, which is an algorithm for finding all zeros of a polynomial system in a bounded region of the plane. This algorithm can be use... | arxiv | @article{srijuntongsiri2007properties,
title={Properties of polynomial bases used in a line-surface intersection
algorithm},
author={Gun Srijuntongsiri, Stephen A. Vavasis},
journal={arXiv preprint arXiv:0707.1515},
year={2007},
archivePrefix={arXiv},
eprint={0707.1515},
primaryClass={cs.N... | srijuntongsiri2007properties |
arxiv-731 | 0707.1527 | Programming Telepathy: Implementing Quantum Non-Locality Games | <|reference_start|>Programming Telepathy: Implementing Quantum Non-Locality Games: Quantum pseudo-telepathy is an intriguing phenomenon which results from the application of quantum information theory to communication complexity. To demonstrate this phenomenon researchers in the field of quantum communication complexit... | arxiv | @article{tafliovich2007programming,
title={Programming Telepathy: Implementing Quantum Non-Locality Games},
author={Anya Tafliovich, Eric C.R. Hehner},
journal={arXiv preprint arXiv:0707.1527},
year={2007},
archivePrefix={arXiv},
eprint={0707.1527},
primaryClass={quant-ph cs.PL}
} | tafliovich2007programming |
arxiv-732 | 0707.1532 | Sorting and Selection in Posets | <|reference_start|>Sorting and Selection in Posets: Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs of objects are incomparable. This generalization is relevant in applications related to ... | arxiv | @article{daskalakis2007sorting,
title={Sorting and Selection in Posets},
author={Constantinos Daskalakis (1), Richard M. Karp (1), Elchanan Mossel (1),
Samantha Riesenfeld (1), Elad Verbin (2) ((1) U.C. Berkeley, (2) Tel Aviv
University)},
journal={arXiv preprint arXiv:0707.1532},
year={2007},
a... | daskalakis2007sorting |
arxiv-733 | 0707.1534 | An Architecture Framework for Complex Data Warehouses | <|reference_start|>An Architecture Framework for Complex Data Warehouses: Nowadays, many decision support applications need to exploit data that are not only numerical or symbolic, but also multimedia, multistructure, multisource, multimodal, and/or multiversion. We term such data complex data. Managing and analyzing c... | arxiv | @article{darmont2007an,
title={An Architecture Framework for Complex Data Warehouses},
author={J'er^ome Darmont, Omar Boussaid, Jean-Christian Ralaivao and Kamel
Aouiche},
journal={arXiv preprint arXiv:0707.1534},
year={2007},
archivePrefix={arXiv},
eprint={0707.1534},
primaryClass={cs.DB}... | darmont2007an |
arxiv-734 | 0707.1548 | Data Mining-based Materialized View and Index Selection in Data Warehouses | <|reference_start|>Data Mining-based Materialized View and Index Selection in Data Warehouses: Materialized views and indexes are physical structures for accelerating data access that are casually used in data warehouses. However, these data structures generate some maintenance overhead. They also share the same storag... | arxiv | @article{aouiche2007data,
title={Data Mining-based Materialized View and Index Selection in Data
Warehouses},
author={Kamel Aouiche and J'er^ome Darmont},
journal={arXiv preprint arXiv:0707.1548},
year={2007},
archivePrefix={arXiv},
eprint={0707.1548},
primaryClass={cs.DB}
} | aouiche2007data |
arxiv-735 | 0707.1558 | Autonomy with regard to an Attribute | <|reference_start|>Autonomy with regard to an Attribute: This paper presents a model of autonomy called autonomy with regard to an attribute applicable to cognitive and not cognitive artificial agents. Three criteria (global / partial, social / nonsocial, absolute / relative) are defined and used to describe the main c... | arxiv | @article{sanchis2007autonomy,
title={Autonomy with regard to an Attribute},
author={Eric Sanchis (LGC)},
journal={arXiv preprint arXiv:0707.1558},
year={2007},
archivePrefix={arXiv},
eprint={0707.1558},
primaryClass={cs.MA}
} | sanchis2007autonomy |
arxiv-736 | 0707.1588 | A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels | <|reference_start|>A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels: In this correspondence, we propose a tight lower bound to the outage probability of discrete-input Nakagami-m block-fading channels. The approach permits an efficient method for numerical evaluation of the bound, p... | arxiv | @article{nguyen2007a,
title={A Tight Lower Bound to the Outage Probability of Discrete-Input
Block-Fading Channels},
author={Khoa D. Nguyen, Albert Guillen i Fabregas, Lars K. Rasmussen},
journal={arXiv preprint arXiv:0707.1588},
year={2007},
doi={10.1109/TIT.2007.907520},
archivePrefix={arXiv... | nguyen2007a |
arxiv-737 | 0707.1607 | Cactus Framework: Black Holes to Gamma Ray Bursts | <|reference_start|>Cactus Framework: Black Holes to Gamma Ray Bursts: Gamma Ray Bursts (GRBs) are intense narrowly-beamed flashes of gamma-rays of cosmological origin. They are among the most scientifically interesting astrophysical systems, and the riddle concerning their central engines and emission mechanisms is one... | arxiv | @article{schnetter2007cactus,
title={Cactus Framework: Black Holes to Gamma Ray Bursts},
author={Erik Schnetter, Christian D. Ott, Gabrielle Allen, Peter Diener, Tom
Goodale, Thomas Radke, Edward Seidel, John Shalf},
journal={arXiv preprint arXiv:0707.1607},
year={2007},
archivePrefix={arXiv},
... | schnetter2007cactus |
arxiv-738 | 0707.1618 | The Trade-offs with Space Time Cube Representation of Spatiotemporal Patterns | <|reference_start|>The Trade-offs with Space Time Cube Representation of Spatiotemporal Patterns: Space time cube representation is an information visualization technique where spatiotemporal data points are mapped into a cube. Fast and correct analysis of such information is important in for instance geospatial and so... | arxiv | @article{kristensson2007the,
title={The Trade-offs with Space Time Cube Representation of Spatiotemporal
Patterns},
author={Per Ola Kristensson, Nils Dahlback, Daniel Anundi, Marius Bjornstad,
Hanna Gillberg, Jonas Haraldsson, Ingrid Martensson, Matttias Nordvall,
Josefin Stahl},
journal={arXiv prepri... | kristensson2007the |
arxiv-739 | 0707.1639 | Interface groups and financial transfer architectures | <|reference_start|>Interface groups and financial transfer architectures: Analytic execution architectures have been proposed by the same authors as a means to conceptualize the cooperation between heterogeneous collectives of components such as programs, threads, states and services. Interface groups have been propose... | arxiv | @article{bergstra2007interface,
title={Interface groups and financial transfer architectures},
author={Jan A. Bergstra and Alban Ponse},
journal={arXiv preprint arXiv:0707.1639},
year={2007},
number={PRG0702},
archivePrefix={arXiv},
eprint={0707.1639},
primaryClass={cs.SE}
} | bergstra2007interface |
arxiv-740 | 0707.1644 | Fast and Simple Relational Processing of Uncertain Data | <|reference_start|>Fast and Simple Relational Processing of Uncertain Data: This paper introduces U-relations, a succinct and purely relational representation system for uncertain databases. U-relations support attribute-level uncertainty using vertical partitioning. If we consider positive relational algebra extended ... | arxiv | @article{antova2007fast,
title={Fast and Simple Relational Processing of Uncertain Data},
author={Lyublena Antova, Thomas Jansen, Christoph Koch, Dan Olteanu},
journal={arXiv preprint arXiv:0707.1644},
year={2007},
archivePrefix={arXiv},
eprint={0707.1644},
primaryClass={cs.DB cs.PF}
} | antova2007fast |
arxiv-741 | 0707.1714 | Sampling Algorithms and Coresets for Lp Regression | <|reference_start|>Sampling Algorithms and Coresets for Lp Regression: The Lp regression problem takes as input a matrix $A \in \Real^{n \times d}$, a vector $b \in \Real^n$, and a number $p \in [1,\infty)$, and it returns as output a number ${\cal Z}$ and a vector $x_{opt} \in \Real^d$ such that ${\cal Z} = \min_{x \i... | arxiv | @article{dasgupta2007sampling,
title={Sampling Algorithms and Coresets for Lp Regression},
author={Anirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, and Michael
W. Mahoney},
journal={arXiv preprint arXiv:0707.1714},
year={2007},
archivePrefix={arXiv},
eprint={0707.1714},
primaryCl... | dasgupta2007sampling |
arxiv-742 | 0707.1715 | Sources of Superlinearity in Davenport-Schinzel Sequences | <|reference_start|>Sources of Superlinearity in Davenport-Schinzel Sequences: A generalized Davenport-Schinzel sequence is one over a finite alphabet that contains no subsequences isomorphic to a fixed forbidden subsequence. One of the fundamental problems in this area is bounding (asymptotically) the maximum length of... | arxiv | @article{pettie2007sources,
title={Sources of Superlinearity in Davenport-Schinzel Sequences},
author={Seth Pettie},
journal={arXiv preprint arXiv:0707.1715},
year={2007},
archivePrefix={arXiv},
eprint={0707.1715},
primaryClass={cs.DM}
} | pettie2007sources |
arxiv-743 | 0707.1716 | Numerical Calculation With Arbitrary Precision | <|reference_start|>Numerical Calculation With Arbitrary Precision: The vast use of computers on scientific numerical computation makes the awareness of the limited precision that these machines are able to provide us an essential matter. A limited and insufficient precision allied to the truncation and rounding errors ... | arxiv | @article{rodrigues2007numerical,
title={Numerical Calculation With Arbitrary Precision},
author={B.O.Rodrigues, L.A.C.P.da Mota and L.G.S.Duarte},
journal={arXiv preprint arXiv:0707.1716},
year={2007},
doi={10.1142/S0218301307009014},
archivePrefix={arXiv},
eprint={0707.1716},
primaryCla... | rodrigues2007numerical |
arxiv-744 | 0707.1739 | On slow-fading non-separable correlation MIMO systems | <|reference_start|>On slow-fading non-separable correlation MIMO systems: In a frequency selective slow-fading channel in a MIMO system, the channel matrix is of the form of a block matrix. We propose a method to calculate the limit of the eigenvalue distribution of block matrices if the size of the blocks tends to inf... | arxiv | @article{far2007on,
title={On slow-fading non-separable correlation MIMO systems},
author={Reza Rashidi Far, Tamer Oraby, Wlodzimierz Bryc and Roland Speicher},
journal={IEEE Trans. Information Theory, Vol. 54, No. 2, pp.544-553, Feb.
2008},
year={2007},
archivePrefix={arXiv},
eprint={0707.173... | far2007on |
arxiv-745 | 0707.1812 | A numerical study of heat island flows in an open domain: Stationary solutions | <|reference_start|>A numerical study of heat island flows in an open domain: Stationary solutions: We present two dimensional numerical simulations of a natural convection problem in an unbounded domain. A thermal stratification is applied in the vertical direction and the flow circulation is induced by a heat island l... | arxiv | @article{dubois2007a,
title={A numerical study of heat island flows in an open domain: Stationary
solutions},
author={Thierry Dubois, Rachid Touzani},
journal={arXiv preprint arXiv:0707.1812},
year={2007},
archivePrefix={arXiv},
eprint={0707.1812},
primaryClass={math.NA cs.NA physics.class... | dubois2007a |
arxiv-746 | 0707.1820 | Understanding the Properties of the BitTorrent Overlay | <|reference_start|>Understanding the Properties of the BitTorrent Overlay: In this paper, we conduct extensive simulations to understand the properties of the overlay generated by BitTorrent. We start by analyzing how the overlay properties impact the efficiency of BitTorrent. We focus on the average peer set size (i.e... | arxiv | @article{hamra2007understanding,
title={Understanding the Properties of the BitTorrent Overlay},
author={Anwar Al Hamra (INRIA Sophia Antipolis / INRIA Rh^one-Alpes), Arnaud
Legout (INRIA Sophia Antipolis / INRIA Rh^one-Alpes), Chadi Barakat (INRIA
Sophia Antipolis / INRIA Rh^one-Alpes)},
journal={arXiv... | hamra2007understanding |
arxiv-747 | 0707.1824 | The Kinematics of Manipulators Built From Closed Planar Mechanisms | <|reference_start|>The Kinematics of Manipulators Built From Closed Planar Mechanisms: The paper discusses the kinematics of manipulators builts of planar closed kinematic chains. A special kinematic scheme is extracted from the array of these mechanisms that looks the most promising for the creation of different types... | arxiv | @article{slutski2007the,
title={The Kinematics of Manipulators Built From Closed Planar Mechanisms},
author={Leonid Slutski (CIM), Damien Chablat (IRCCyN), Jorge Angeles (CIM)},
journal={Proceedings of the IEEE/ASME International Conference on Advanced
Intelligent Mechatronics (19/08/1999) 531-536},
y... | slutski2007the |
arxiv-748 | 0707.1859 | On the Degrees of Freedom in Cognitive Radio Channels | <|reference_start|>On the Degrees of Freedom in Cognitive Radio Channels: After receiving useful peer comments, we would like to withdraw this paper.<|reference_end|> | arxiv | @article{devroye2007on,
title={On the Degrees of Freedom in Cognitive Radio Channels},
author={Natasha Devroye, Vahid Tarokh},
journal={arXiv preprint arXiv:0707.1859},
year={2007},
archivePrefix={arXiv},
eprint={0707.1859},
primaryClass={cs.IT math.IT}
} | devroye2007on |
arxiv-749 | 0707.1904 | Generalized Solution Concepts in Games with Possibly Unaware Players | <|reference_start|>Generalized Solution Concepts in Games with Possibly Unaware Players: Most work in game theory assumes that players are perfect reasoners and have common knowledge of all significant aspects of the game. In earlier work, we proposed a framework for representing and analyzing games with possibly unawa... | arxiv | @article{rego2007generalized,
title={Generalized Solution Concepts in Games with Possibly Unaware Players},
author={Leandro C. Rego and Joseph Y. Halpern},
journal={arXiv preprint arXiv:0707.1904},
year={2007},
archivePrefix={arXiv},
eprint={0707.1904},
primaryClass={cs.GT}
} | rego2007generalized |
arxiv-750 | 0707.1912 | Throughput Scaling Laws for Wireless Networks with Fading Channels | <|reference_start|>Throughput Scaling Laws for Wireless Networks with Fading Channels: A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. It is assumed... | arxiv | @article{ebrahimi2007throughput,
title={Throughput Scaling Laws for Wireless Networks with Fading Channels},
author={Masoud Ebrahimi, Mohammad A. Maddah-Ali, and Amir K. Khandani},
journal={arXiv preprint arXiv:0707.1912},
year={2007},
doi={10.1109/TIT.2007.907518},
number={University of Waterlo... | ebrahimi2007throughput |
arxiv-751 | 0707.1913 | Removing Manually-Generated Boilerplate from Electronic Texts: Experiments with Project Gutenberg e-Books | <|reference_start|>Removing Manually-Generated Boilerplate from Electronic Texts: Experiments with Project Gutenberg e-Books: Collaborative work on unstructured or semi-structured documents, such as in literature corpora or source code, often involves agreed upon templates containing metadata. These templates are not c... | arxiv | @article{kaser2007removing,
title={Removing Manually-Generated Boilerplate from Electronic Texts:
Experiments with Project Gutenberg e-Books},
author={Owen Kaser, Daniel Lemire},
journal={arXiv preprint arXiv:0707.1913},
year={2007},
number={Department of CSAS, UNBSJ Technical Report TR-07-001},
... | kaser2007removing |
arxiv-752 | 0707.1925 | A note on minimal matching covered graphs | <|reference_start|>A note on minimal matching covered graphs: A graph is called matching covered if for its every edge there is a maximum matching containing it. It is shown that minimal matching covered graphs contain a perfect matching.<|reference_end|> | arxiv | @article{mkrtchyan2007a,
title={A note on minimal matching covered graphs},
author={V. V. Mkrtchyan},
journal={Discrete Mathematics 306, (2006), pp. 452-455},
year={2007},
doi={10.1016/j.disc.2005.12.006},
archivePrefix={arXiv},
eprint={0707.1925},
primaryClass={cs.DM}
} | mkrtchyan2007a |
arxiv-753 | 0707.1926 | On trees with a maximum proper partial 0-1 coloring containing a maximum matching | <|reference_start|>On trees with a maximum proper partial 0-1 coloring containing a maximum matching: I prove that in a tree in which the distance between any two endpoints is even, there is a maximum proper partial 0-1 coloring such that the edges colored by 0 form a maximum matching.<|reference_end|> | arxiv | @article{mkrtchyan2007on,
title={On trees with a maximum proper partial 0-1 coloring containing a maximum
matching},
author={V. V. Mkrtchyan},
journal={Discrete Mathematics 306, (2006), pp. 456-459},
year={2007},
doi={10.1016/j.disc.2005.12.019},
archivePrefix={arXiv},
eprint={0707.1926},
... | mkrtchyan2007on |
arxiv-754 | 0707.1954 | Bandlimited Field Reconstruction for Wireless Sensor Networks | <|reference_start|>Bandlimited Field Reconstruction for Wireless Sensor Networks: Wireless sensor networks are often used for environmental monitoring applications. In this context sampling and reconstruction of a physical field is one of the most important problems to solve. We focus on a bandlimited field and find un... | arxiv | @article{nordio2007bandlimited,
title={Bandlimited Field Reconstruction for Wireless Sensor Networks},
author={A. Nordio, C.-F. Chiasserini, E. Viterbo},
journal={arXiv preprint arXiv:0707.1954},
year={2007},
archivePrefix={arXiv},
eprint={0707.1954},
primaryClass={cs.OH}
} | nordio2007bandlimited |
arxiv-755 | 0707.1957 | Moveability and Collision Analysis for Fully-Parallel Manipulators | <|reference_start|>Moveability and Collision Analysis for Fully-Parallel Manipulators: The aim of this paper is to characterize the moveability of fully-parallel manipulators in the presence of obstacles. Fully parallel manipulators are used in applications where accuracy, stiffness or high speeds and accelerations are... | arxiv | @article{chablat2007moveability,
title={Moveability and Collision Analysis for Fully-Parallel Manipulators},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN)},
journal={12th CISM-IFTOMM Symposium (07/1998) 1-8},
year={2007},
archivePrefix={arXiv},
eprint={0707.1957},
primaryClass={c... | chablat2007moveability |
arxiv-756 | 0707.1981 | A Normalizing Intuitionistic Set Theory with Inaccessible Sets | <|reference_start|>A Normalizing Intuitionistic Set Theory with Inaccessible Sets: We propose a set theory strong enough to interpret powerful type theories underlying proof assistants such as LEGO and also possibly Coq, which at the same time enables program extraction from its constructive proofs. For this purpose, w... | arxiv | @article{moczydlowski2007a,
title={A Normalizing Intuitionistic Set Theory with Inaccessible Sets},
author={Wojciech Moczydlowski},
journal={Logical Methods in Computer Science, Volume 3, Issue 3 (August 16,
2007) lmcs:837},
year={2007},
doi={10.2168/LMCS-3(3:6)2007},
archivePrefix={arXiv},
... | moczydlowski2007a |
arxiv-757 | 0707.2006 | Working Modes and Aspects in Fully-Parallel Manipulator | <|reference_start|>Working Modes and Aspects in Fully-Parallel Manipulator: The aim of this paper is to characterize the notion of aspect in the workspace and in the joint space for parallel manipulators. In opposite to the serial manipulators, the parallel manipulators can admit not only multiple inverse kinematic sol... | arxiv | @article{chablat2007working,
title={Working Modes and Aspects in Fully-Parallel Manipulator},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN)},
journal={Proceeding IEEE International Conference on Robotics and
Automation (05/1998) 1964-1969},
year={2007},
archivePrefix={arXiv},
eprin... | chablat2007working |
arxiv-758 | 0707.2014 | On the error exponent of variable-length block-coding schemes over finite-state Markov channels with feedback | <|reference_start|>On the error exponent of variable-length block-coding schemes over finite-state Markov channels with feedback: The error exponent of Markov channels with feedback is studied in the variable-length block-coding setting. Burnashev's classic result is extended and a single letter characterization for th... | arxiv | @article{como2007on,
title={On the error exponent of variable-length block-coding schemes over
finite-state Markov channels with feedback},
author={Giacomo Como, Serdar Yuksel, Sekhar Tatikonda},
journal={arXiv preprint arXiv:0707.2014},
year={2007},
archivePrefix={arXiv},
eprint={0707.2014},
... | como2007on |
arxiv-759 | 0707.2017 | The Isoconditioning Loci of A Class of Closed-Chain Manipulators | <|reference_start|>The Isoconditioning Loci of A Class of Closed-Chain Manipulators: The subject of this paper is a special class of closed-chain manipulators. First, we analyze a family of two-degree-of-freedom (dof) five-bar planar linkages. Two Jacobian matrices appear in the kinematic relations between the joint-ra... | arxiv | @article{chablat2007the,
title={The Isoconditioning Loci of A Class of Closed-Chain Manipulators},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN), Jorge Angeles (CIM)},
journal={Proceeding IEEE International Conference on Robotics and
Automation (05/1998) 1970-1976},
year={2007},
archiv... | chablat2007the |
arxiv-760 | 0707.2027 | Workspace and Assembly modes in Fully-Parallel Manipulators : A Descriptive Study | <|reference_start|>Workspace and Assembly modes in Fully-Parallel Manipulators : A Descriptive Study: The goal of this paper is to explain, using a typical example, the distribution of the different assembly modes in the workspace and their effective role in the execution of trajectories. The singular and non-singular ... | arxiv | @article{wenger2007workspace,
title={Workspace and Assembly modes in Fully-Parallel Manipulators : A
Descriptive Study},
author={Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={Advances in Robot Kinematics and Computational Geometry (1998)
117-126},
year={2007},
archivePrefix={arXiv... | wenger2007workspace |
arxiv-761 | 0707.2034 | Conception Isotropique D'Une Morphologie Parall\`Ele : Application \`a L'Usinage | <|reference_start|>Conception Isotropique D'Une Morphologie Parall\`Ele : Application \`a L'Usinage: The aim of this paper is the isotropic design of a hybrid morphology dedicated to 3-axis machining applications. It is necessary to ensure the feasibility of continuous, singularity-free trajectories, as well as a good ... | arxiv | @article{chablat2007conception,
title={Conception Isotropique D'Une Morphologie Parall\`Ele : Application \`a
L'Usinage},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN), Jorge Angeles (CIM)},
journal={3rd International Conference On Integrated Design and
Manufacturing in Mechanical Engineerin... | chablat2007conception |
arxiv-762 | 0707.2042 | A distributed Approach for Access and Visibility Task under Ergonomic Constraints with a Manikin in a Virtual Reality Environment | <|reference_start|>A distributed Approach for Access and Visibility Task under Ergonomic Constraints with a Manikin in a Virtual Reality Environment: This paper presents a new method, based on a multi-agent system and on digital mock-up technology, to assess an efficient path planner for a manikin for access and visibi... | arxiv | @article{bidault2007a,
title={A distributed Approach for Access and Visibility Task under Ergonomic
Constraints with a Manikin in a Virtual Reality Environment},
author={Florence Bidault (IRCCyN), Damien Chablat (IRCCyN), Patrick Chedmail
(IRCCyN), Laurent Pino (IRCCyN)},
journal={Proceeding of the 10th... | bidault2007a |
arxiv-763 | 0707.2090 | A Training based Distributed Non-Coherent Space-Time Coding Strategy | <|reference_start|>A Training based Distributed Non-Coherent Space-Time Coding Strategy: Unitary space-time modulation is known to be an efficient means to communicate over non-coherent Multiple Input Multiple Output (MIMO) channels. In this letter, differential unitary space-time coding and non-coherent space-time cod... | arxiv | @article{rajan2007a,
title={A Training based Distributed Non-Coherent Space-Time Coding Strategy},
author={G. Susinder Rajan and B. Sundar Rajan},
journal={arXiv preprint arXiv:0707.2090},
year={2007},
archivePrefix={arXiv},
eprint={0707.2090},
primaryClass={cs.IT math.IT}
} | rajan2007a |
arxiv-764 | 0707.2126 | On complexity of special maximum matchings constructing | <|reference_start|>On complexity of special maximum matchings constructing: For bipartite graphs the NP-completeness is proved for the problem of existence of maximum matching which removal leads to a graph with given lower(upper)bound for the cardinality of its maximum matching.<|reference_end|> | arxiv | @article{kamalian2007on,
title={On complexity of special maximum matchings constructing},
author={R.R. Kamalian, V. V. Mkrtchyan},
journal={Discrete Mathematics, 2008, Vol 308/10 pp 1792-1800},
year={2007},
doi={10.1016/j.disc.2007.04.029},
archivePrefix={arXiv},
eprint={0707.2126},
prim... | kamalian2007on |
arxiv-765 | 0707.2160 | Splay Trees, Davenport-Schinzel Sequences, and the Deque Conjecture | <|reference_start|>Splay Trees, Davenport-Schinzel Sequences, and the Deque Conjecture: We introduce a new technique to bound the asymptotic performance of splay trees. The basic idea is to transcribe, in an indirect fashion, the rotations performed by the splay tree as a Davenport-Schinzel sequence S, none of whose su... | arxiv | @article{pettie2007splay,
title={Splay Trees, Davenport-Schinzel Sequences, and the Deque Conjecture},
author={Seth Pettie},
journal={arXiv preprint arXiv:0707.2160},
year={2007},
archivePrefix={arXiv},
eprint={0707.2160},
primaryClass={cs.DS}
} | pettie2007splay |
arxiv-766 | 0707.2176 | Benefit of Delay on the Diversity-Multiplexing Tradeoffs of MIMO Channels with Partial CSI | <|reference_start|>Benefit of Delay on the Diversity-Multiplexing Tradeoffs of MIMO Channels with Partial CSI: This paper re-examines the well-known fundamental tradeoffs between rate and reliability for the multi-antenna, block Rayleigh fading channel in the high signal to noise ratio (SNR) regime when (i) the transmi... | arxiv | @article{sharif2007benefit,
title={Benefit of Delay on the Diversity-Multiplexing Tradeoffs of MIMO
Channels with Partial CSI},
author={Masoud Sharif and Prakash Ishwar},
journal={arXiv preprint arXiv:0707.2176},
year={2007},
archivePrefix={arXiv},
eprint={0707.2176},
primaryClass={cs.IT m... | sharif2007benefit |
arxiv-767 | 0707.2182 | Design of Multistage Decimation Filters Using Cyclotomic Polynomials: Optimization and Design Issues | <|reference_start|>Design of Multistage Decimation Filters Using Cyclotomic Polynomials: Optimization and Design Issues: This paper focuses on the design of multiplier-less decimation filters suitable for oversampled digital signals. The aim is twofold. On one hand, it proposes an optimization framework for the design ... | arxiv | @article{laddomada2007design,
title={Design of Multistage Decimation Filters Using Cyclotomic Polynomials:
Optimization and Design Issues},
author={Massimiliano Laddomada},
journal={arXiv preprint arXiv:0707.2182},
year={2007},
archivePrefix={arXiv},
eprint={0707.2182},
primaryClass={cs.OH... | laddomada2007design |
arxiv-768 | 0707.2185 | Mod\'elisation Dynamique d'un Robot Parall\`ele \`a 3-DDL : l'Orthoglide | <|reference_start|>Mod\'elisation Dynamique d'un Robot Parall\`ele \`a 3-DDL : l'Orthoglide: In this article, we propose a method for calculation of the inverse and direct dynamic models of the Orthoglide, a parallel robot with threedegrees of freedom in translation. These models are calculated starting from the elemen... | arxiv | @article{guegan2007mod\'elisation,
title={Mod\'elisation Dynamique d'un Robot Parall\`ele \`a 3-DDL : l'Orthoglide},
author={Sylvain Guegan (IRCCyN), Wisama Khalil (IRCCyN), Damien Chablat
(IRCCyN), Philippe Wenger (IRCCyN)},
journal={Conf\'erence Internationale Francophone d'Automatique (07/2002)
1-6},... | guegan2007mod\'elisation |
arxiv-769 | 0707.2191 | Word statistics in Blogs and RSS feeds: Towards empirical universal evidence | <|reference_start|>Word statistics in Blogs and RSS feeds: Towards empirical universal evidence: We focus on the statistics of word occurrences and of the waiting times between such occurrences in Blogs. Due to the heterogeneity of words' frequencies, the empirical analysis is performed by studying classes of "frequent... | arxiv | @article{lambiotte2007word,
title={Word statistics in Blogs and RSS feeds: Towards empirical universal
evidence},
author={R. Lambiotte, M. Ausloos and M. Thelwall},
journal={J. Informetrics 1 (2007) 277-286},
year={2007},
archivePrefix={arXiv},
eprint={0707.2191},
primaryClass={cs.IT math.... | lambiotte2007word |
arxiv-770 | 0707.2227 | Degeneracy study of the forward kinematics of planar 3-RPR parallel manipulators | <|reference_start|>Degeneracy study of the forward kinematics of planar 3-RPR parallel manipulators: This paper investigates two situations in which the forward kinematics of planar 3-RPR parallel manipulators degenerates. These situations have not been addressed before. The first degeneracy arises when the three input... | arxiv | @article{wenger2007degeneracy,
title={Degeneracy study of the forward kinematics of planar 3-RPR parallel
manipulators},
author={Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN), Mazen Zein (IRCCyN)},
journal={Journal of Mechanical Design 129, 12 (12/2007) 1-6},
year={2007},
archivePrefix={arXiv}... | wenger2007degeneracy |
arxiv-771 | 0707.2228 | Kinematic Analysis of a Family of 3R Manipulators | <|reference_start|>Kinematic Analysis of a Family of 3R Manipulators: The workspace topologies of a family of 3-revolute (3R) positioning manipulators are enumerated. The workspace is characterized in a half-cross section by the singular curves. The workspace topology is defined by the number of cusps that appear on th... | arxiv | @article{baili2007kinematic,
title={Kinematic Analysis of a Family of 3R Manipulators},
author={Maher Baili (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat
(IRCCyN)},
journal={Problems of Mechanics 15, 2 (07/2004) 27-32},
year={2007},
archivePrefix={arXiv},
eprint={0707.2228},
primaryCl... | baili2007kinematic |
arxiv-772 | 0707.2229 | The Computation of All 4R Serial Spherical Wrists With an Isotropic Architecture | <|reference_start|>The Computation of All 4R Serial Spherical Wrists With an Isotropic Architecture: A spherical wrist of the serial type with n revolute (R) joints is said to be isotropic if it can attain a posture whereby the singular values of its Jacobian matrix are all equal to sqrt(n/3). What isotropy brings abou... | arxiv | @article{chablat2007the,
title={The Computation of All 4R Serial Spherical Wrists With an Isotropic
Architecture},
author={Damien Chablat (IRCCyN), Jorge Angeles (CIM)},
journal={Journal of Mechanical Design 125, 2 (06/2003) 275-280},
year={2007},
archivePrefix={arXiv},
eprint={0707.2229},
... | chablat2007the |
arxiv-773 | 0707.2238 | A design oriented study for 3R Orthogonal Manipulators With Geometric Simplifications | <|reference_start|>A design oriented study for 3R Orthogonal Manipulators With Geometric Simplifications: This paper proposes a method to calculate the largest Regular Dextrous Workspace (RDW) of some types of three-revolute orthogonal manipulators that have at least one of their DH parameters equal to zero. Then a new... | arxiv | @article{zein2007a,
title={A design oriented study for 3R Orthogonal Manipulators With Geometric
Simplifications},
author={Mazen Zein (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat (IRCCyN)},
journal={Congr\`es international Conception et Mod\'elisation des
Syst\`emes M\'ecaniques (03/2007) 1-8},
... | zein2007a |
arxiv-774 | 0707.2265 | Separable convex optimization problems with linear ascending constraints | <|reference_start|>Separable convex optimization problems with linear ascending constraints: Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. Under an ordering condition on the slopes of the functions at the origin, an algorithm that determine... | arxiv | @article{padakandla2007separable,
title={Separable convex optimization problems with linear ascending constraints},
author={Arun Padakandla and Rajesh Sundaresan},
journal={SIAM J. on Optim., vol. 20, no. 3, pp. 1185-1204, online version
19 August 2009},
year={2007},
doi={10.1137/07069729X},
a... | padakandla2007separable |
arxiv-775 | 0707.2270 | Design of a Spherical Wrist with Parallel Architecture: Application to Vertebrae of an Eel Robot | <|reference_start|>Design of a Spherical Wrist with Parallel Architecture: Application to Vertebrae of an Eel Robot: The design of a spherical wrist with parallel architecture is the object of this article. This study is part of a larger project, which aims to design and to build an eel robot for inspection of immersed... | arxiv | @article{chablat2007design,
title={Design of a Spherical Wrist with Parallel Architecture: Application to
Vertebrae of an Eel Robot},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN)},
journal={Proc. IEEE Int. Conf. Rob. and Automation (04/2005) 1-6},
year={2007},
archivePrefix={arXiv},
... | chablat2007design |
arxiv-776 | 0707.2275 | Passive Control Architecture for Virtual Humans | <|reference_start|>Passive Control Architecture for Virtual Humans: In the present paper, we introduce a new control architecture aimed at driving virtual humans in interaction with virtual environments, by motion capture. It brings decoupling of functionalities, and also of stability thanks to passivity. We show proje... | arxiv | @article{rennuit2007passive,
title={Passive Control Architecture for Virtual Humans},
author={Antoine Rennuit (IRCCyN), Alain Micaelli (CEA/LIST), Xavier Merlhiot
(CEA/LIST), Claude Andriot (CEA/LIST), Franc{c}ois Guillaume, Nicolas
Chevassus, Damien Chablat (IRCCyN), Patrick Chedmail (IRCCyN)},
journal... | rennuit2007passive |
arxiv-777 | 0707.2291 | An Integrated Crosscutting Concern Migration Strategy and its Application to JHotDraw | <|reference_start|>An Integrated Crosscutting Concern Migration Strategy and its Application to JHotDraw: In this paper we propose a systematic strategy for migrating crosscutting concerns in existing object-oriented systems to aspect-based solutions. The proposed strategy consists of four steps: mining, exploration, d... | arxiv | @article{marin2007an,
title={An Integrated Crosscutting Concern Migration Strategy and its
Application to JHotDraw},
author={Marius Marin, Leon Moonen, Arie van Deursen},
journal={arXiv preprint arXiv:0707.2291},
year={2007},
number={TUD-SERG-2007-019},
archivePrefix={arXiv},
eprint={0707.... | marin2007an |
arxiv-778 | 0707.2293 | Worm Epidemics in Wireless Adhoc Networks | <|reference_start|>Worm Epidemics in Wireless Adhoc Networks: A dramatic increase in the number of computing devices with wireless communication capability has resulted in the emergence of a new class of computer worms which specifically target such devices. The most striking feature of these worms is that they do not ... | arxiv | @article{nekovee2007worm,
title={Worm Epidemics in Wireless Adhoc Networks},
author={Maziar Nekovee},
journal={Published in New J. Phys. 9 189, 2007},
year={2007},
doi={10.1088/1367-2630/9/6/189},
archivePrefix={arXiv},
eprint={0707.2293},
primaryClass={cs.NI cond-mat.stat-mech cs.CR phy... | nekovee2007worm |
arxiv-779 | 0707.2295 | Two polynomial algorithms for special maximum matching constructing in trees | <|reference_start|>Two polynomial algorithms for special maximum matching constructing in trees: For an arbitrary tree we investigate the problems of constructing a maximum matching which minimizes or maximizes the cardinality of a maximum matching of the graph obtained from original one by its removal and present corr... | arxiv | @article{kamalian2007two,
title={Two polynomial algorithms for special maximum matching constructing in
trees},
author={R.R. Kamalian, V. V. Mkrtchyan},
journal={arXiv preprint arXiv:0707.2295},
year={2007},
archivePrefix={arXiv},
eprint={0707.2295},
primaryClass={cs.DM}
} | kamalian2007two |
arxiv-780 | 0707.2341 | A Cultural Market Model | <|reference_start|>A Cultural Market Model: Social interactions and personal tastes shape our consumption behavior of cultural products. In this study, we present a computational model of a cultural market and we aim to analyze the behavior of the consumer population as an emergent phenomena. Our results suggest that t... | arxiv | @article{herdagdelen2007a,
title={A Cultural Market Model},
author={Amac Herdagdelen, Haluk Bingol},
journal={International Journal of Modern Physics C Vol. 19, No. 2, 271-282
(2008)},
year={2007},
doi={10.1142/S012918310801208X},
archivePrefix={arXiv},
eprint={0707.2341},
primaryClass... | herdagdelen2007a |
arxiv-781 | 0707.2347 | Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm | <|reference_start|>Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm: We propose several new schedules for Strassen-Winograd's matrix multiplication algorithm, they reduce the extra memory allocation requirements by three different means: by introducing a few pre-additions, by overwriti... | arxiv | @article{boyer2007memory,
title={Memory efficient scheduling of Strassen-Winograd's matrix multiplication
algorithm},
author={Brice Boyer (LJK), Jean-Guillaume Dumas (LJK), Cl'ement Pernet (INRIA
Rh^one-Alpes / LIG Laboratoire d'Informatique de Grenoble), Wei Zhou
(Symbolic Computation Group)},
journa... | boyer2007memory |
arxiv-782 | 0707.2376 | Tripartitions do not always discriminate phylogenetic networks | <|reference_start|>Tripartitions do not always discriminate phylogenetic networks: Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of non-treelike evolutionary events, like recombination, hybridization, or lateral gene transfer. In a recent series of papers devoted to ... | arxiv | @article{cardona2007tripartitions,
title={Tripartitions do not always discriminate phylogenetic networks},
author={Gabriel Cardona, Francesc Rossello, Gabriel Valiente},
journal={arXiv preprint arXiv:0707.2376},
year={2007},
archivePrefix={arXiv},
eprint={0707.2376},
primaryClass={q-bio.PE c... | cardona2007tripartitions |
arxiv-783 | 0707.2432 | Pricing Asian Options for Jump Diffusions | <|reference_start|>Pricing Asian Options for Jump Diffusions: We construct a sequence of functions that uniformly converge (on compact sets) to the price of Asian option, which is written on a stock whose dynamics follows a jump diffusion, exponentially fast. Each of the element in this sequence solves a parabolic part... | arxiv | @article{bayraktar2007pricing,
title={Pricing Asian Options for Jump Diffusions},
author={Erhan Bayraktar, Hao Xing},
journal={arXiv preprint arXiv:0707.2432},
year={2007},
archivePrefix={arXiv},
eprint={0707.2432},
primaryClass={cs.CE}
} | bayraktar2007pricing |
arxiv-784 | 0707.2436 | On the Polyphase Decomposition for Design of Generalized Comb Decimation Filters | <|reference_start|>On the Polyphase Decomposition for Design of Generalized Comb Decimation Filters: Generalized comb filters (GCFs) are efficient anti-aliasing decimation filters with improved selectivity and quantization noise (QN) rejection performance around the so called folding bands with respect to classical com... | arxiv | @article{laddomada2007on,
title={On the Polyphase Decomposition for Design of Generalized Comb Decimation
Filters},
author={Massimiliano Laddomada},
journal={arXiv preprint arXiv:0707.2436},
year={2007},
doi={10.1109/TCSI.2008.920136},
archivePrefix={arXiv},
eprint={0707.2436},
primary... | laddomada2007on |
arxiv-785 | 0707.2482 | Multiple-Description Lattice Vector Quantization | <|reference_start|>Multiple-Description Lattice Vector Quantization: In this thesis, we construct and analyze multiple-description codes based on lattice vector quantization.<|reference_end|> | arxiv | @article{ostergaard2007multiple-description,
title={Multiple-Description Lattice Vector Quantization},
author={Jan Ostergaard},
journal={Ph.D. Thesis, Delft University of Technology, ISBN
978-90-9021979-0, pp. 250, Gildeprint, June 2007},
year={2007},
archivePrefix={arXiv},
eprint={0707.2482},... | ostergaard2007multiple-description |
arxiv-786 | 0707.2506 | Mixed Integer Linear Programming For Exact Finite-Horizon Planning In Decentralized Pomdps | <|reference_start|>Mixed Integer Linear Programming For Exact Finite-Horizon Planning In Decentralized Pomdps: We consider the problem of finding an n-agent joint-policy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity (NEXP-hard in n >= 2). In this ... | arxiv | @article{aras2007mixed,
title={Mixed Integer Linear Programming For Exact Finite-Horizon Planning In
Decentralized Pomdps},
author={Raghav Aras (INRIA Lorraine - LORIA), Alain Dutech (INRIA Lorraine -
LORIA), Franc{c}ois Charpillet (INRIA Lorraine - LORIA)},
journal={Dans The International Conference on... | aras2007mixed |
arxiv-787 | 0707.2527 | Rate and Power Allocation for Discrete-Rate Link Adaptation | <|reference_start|>Rate and Power Allocation for Discrete-Rate Link Adaptation: Link adaptation, in particular adaptive coded modulation (ACM), is a promising tool for bandwidth-efficient transmission in a fading environment. The main motivation behind employing ACM schemes is to improve the spectral efficiency of wire... | arxiv | @article{gjendemsjø2007rate,
title={Rate and Power Allocation for Discrete-Rate Link Adaptation},
author={Anders Gjendemsj{o}, Geir E. {O}ien, Henrik Holm, Mohamed-Slim
Alouini, David Gesbert, Kjell J. Hole and P{aa}l Orten},
journal={arXiv preprint arXiv:0707.2527},
year={2007},
archivePrefix={ar... | gjendemsjø2007rate |
arxiv-788 | 0707.2562 | A Characterisation of First-Order Constraint Satisfaction Problems | <|reference_start|>A Characterisation of First-Order Constraint Satisfaction Problems: We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction... | arxiv | @article{larose2007a,
title={A Characterisation of First-Order Constraint Satisfaction Problems},
author={Benoit Larose, Cynthia Loten, Claude Tardif},
journal={Logical Methods in Computer Science, Volume 3, Issue 4 (November
6, 2007) lmcs:1097},
year={2007},
doi={10.2168/LMCS-3(4:6)2007},
arc... | larose2007a |
arxiv-789 | 0707.2630 | Multi-physics Extension of OpenFMO Framework | <|reference_start|>Multi-physics Extension of OpenFMO Framework: OpenFMO framework, an open-source software (OSS) platform for Fragment Molecular Orbital (FMO) method, is extended to multi-physics simulations (MPS). After reviewing the several FMO implementations on distributed computer environments, the subsequent dev... | arxiv | @article{takami2007multi-physics,
title={Multi-physics Extension of OpenFMO Framework},
author={Toshiya Takami, Jun Maki, Jun'ichi Ooba, Yuuichi Inadomi, Hiroaki
Honda, Ryutaro Susukita, Koji Inoue, Taizo Kobayashi, Rie Nogita, and Mutsumi
Aoyagi},
journal={AIP Conf. Proc. 963, 122-125 (2007)},
year... | takami2007multi-physics |
arxiv-790 | 0707.2701 | A fixed point iteration for computing the matrix logarithm | <|reference_start|>A fixed point iteration for computing the matrix logarithm: In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical metho... | arxiv | @article{schaller2007a,
title={A fixed point iteration for computing the matrix logarithm},
author={Gernot Schaller},
journal={arXiv preprint arXiv:0707.2701},
year={2007},
archivePrefix={arXiv},
eprint={0707.2701},
primaryClass={cs.NA cs.DS}
} | schaller2007a |
arxiv-791 | 0707.2718 | Animation of virtual mannequins, robot-like simulation or motion captures | <|reference_start|>Animation of virtual mannequins, robot-like simulation or motion captures: In order to optimize the costs and time of design of the new products while improving their quality, concurrent engineering is based on the digital model of these products, the numerical model. However, in order to be able to ... | arxiv | @article{chablat2007animation,
title={Animation of virtual mannequins, robot-like simulation or motion
captures},
author={Damien Chablat (IRCCyN)},
journal={3D Modelling Conferences - 3D Human (06/2006) 1-12},
year={2007},
archivePrefix={arXiv},
eprint={0707.2718},
primaryClass={cs.RO}
} | chablat2007animation |
arxiv-792 | 0707.2721 | A Framework to Illustrate Kinematic Behavior of Mechanisms by Haptic Feedback | <|reference_start|>A Framework to Illustrate Kinematic Behavior of Mechanisms by Haptic Feedback: The kinematic properties of mechanisms are well known by the researchers and teachers. The theory based on the study of Jacobian matrices allows us to explain, for example, the singular configuration. However, in many case... | arxiv | @article{zhang2007a,
title={A Framework to Illustrate Kinematic Behavior of Mechanisms by Haptic
Feedback},
author={Qinqin Zhang (IRCCyN, DIE), Damien Chablat (IRCCyN), Fouad Bennis
(IRCCyN), Wei Zhang (DIE)},
journal={Proceedings of Virtual Concept (25/11/2006) 1-6},
year={2007},
archivePrefix=... | zhang2007a |
arxiv-793 | 0707.2780 | On the ergodic sum-rate performance of CDD in multi-user systems | <|reference_start|>On the ergodic sum-rate performance of CDD in multi-user systems: The main focus of space-time coding design and analysis for MIMO systems has been so far focused on single-user systems. For single-user systems, transmit diversity schemes suffer a loss in spectral efficiency if the receiver is equipp... | arxiv | @article{sezgin2007on,
title={On the ergodic sum-rate performance of CDD in multi-user systems},
author={Aydin Sezgin, Mohamad Charafeddine, Arogyaswami Paulraj},
journal={arXiv preprint arXiv:0707.2780},
year={2007},
doi={10.1109/ITW.2007.4313052},
archivePrefix={arXiv},
eprint={0707.2780},... | sezgin2007on |
arxiv-794 | 0707.2792 | Distributed Compression and Multiparty Squashed Entanglement | <|reference_start|>Distributed Compression and Multiparty Squashed Entanglement: We study a protocol in which many parties use quantum communication to transfer a shared state to a receiver without communicating with each other. This protocol is a multiparty version of the fully quantum Slepian-Wolf protocol for two se... | arxiv | @article{avis2007distributed,
title={Distributed Compression and Multiparty Squashed Entanglement},
author={David Avis, Patrick Hayden, Ivan Savov},
journal={J. Phys. A 41 (2008) 115301},
year={2007},
doi={10.1088/1751-8113/41/11/115301},
archivePrefix={arXiv},
eprint={0707.2792},
primar... | avis2007distributed |
arxiv-795 | 0707.2833 | A Comparative Study between Two Three-DOF Parallel Kinematic Machines using Kinetostatic Criteria and Interval Analysis | <|reference_start|>A Comparative Study between Two Three-DOF Parallel Kinematic Machines using Kinetostatic Criteria and Interval Analysis: This paper addresses the workspace analysis of two 3-DOF translational parallel mechanisms designed for machining applications. The two machines features three fixed linear joints.... | arxiv | @article{chablat2007a,
title={A Comparative Study between Two Three-DOF Parallel Kinematic Machines
using Kinetostatic Criteria and Interval Analysis},
author={Damien Chablat (IRCCyN), Philippe Wenger (IRCCyN), Jean-Pierre Merlet
(INRIA Sophia Antipolis)},
journal={11th World Congress in Mechanism and M... | chablat2007a |
arxiv-796 | 0707.2836 | Multimedia Capacity Analysis of the IEEE 80211e Contention-based Infrastructure Basic Service Set | <|reference_start|>Multimedia Capacity Analysis of the IEEE 80211e Contention-based Infrastructure Basic Service Set: We first propose a simple mathematical analysis framework for the Enhanced Distributed Channel Access (EDCA) function of the recently ratified IEEE 802.11e standard. Our analysis considers the fact that... | arxiv | @article{inan2007multimedia,
title={Multimedia Capacity Analysis of the IEEE 802.11e Contention-based
Infrastructure Basic Service Set},
author={Inanc Inan, Feyza Keceli, Ender Ayanoglu},
journal={arXiv preprint arXiv:0707.2836},
year={2007},
archivePrefix={arXiv},
eprint={0707.2836},
prim... | inan2007multimedia |
arxiv-797 | 0707.2841 | The Virtual Manufacturing concept: Scope, Socio-Economic Aspects and Future Trends | <|reference_start|>The Virtual Manufacturing concept: Scope, Socio-Economic Aspects and Future Trends: The research area "Virtual Manufacturing (VM)'' is the use of information technology and computer simulation to model real world manufacturing processes for the purpose of analysing and understanding them. As automati... | arxiv | @article{chablat2007the,
title={The Virtual Manufacturing concept: Scope, Socio-Economic Aspects and
Future Trends},
author={Damien Chablat (IRCCyN), Philippe D'epinc'e, Eric No"el,
Peer-Oliver Woelk (IFW)},
journal={Design Engineering Technical Conferences (09/2004) 1-6},
year={2007},
archivePr... | chablat2007the |
arxiv-798 | 0707.2842 | A Classification of 3R Orthogonal Manipulators by the Topology of their Workspace | <|reference_start|>A Classification of 3R Orthogonal Manipulators by the Topology of their Workspace: A classification of a family of 3-revolute (3R) positining manipulators is established. This classification is based on the topology of their workspace. The workspace is characterized in a half-cross section by the sin... | arxiv | @article{baili2007a,
title={A Classification of 3R Orthogonal Manipulators by the Topology of their
Workspace},
author={Maher Baili (IRCCyN), Philippe Wenger (IRCCyN), Damien Chablat
(IRCCyN)},
journal={Proc. IEEE Int. Conf. Rob. and Automation (04/2004) 1-6},
year={2007},
archivePrefix={arXiv},... | baili2007a |
arxiv-799 | 0707.2886 | OA@MPS - a colourful view | <|reference_start|>OA@MPS - a colourful view: The open access agenda of the Max Planck Society, initiator of the Berlin Declaration, envisions the support of both the green way and the golden way to open access. For the implementation of the green way the Max Planck Society through its newly established unit (Max Planc... | arxiv | @article{romary2007oa@mps,
title={OA@MPS - a colourful view},
author={Laurent Romary (MPDL)},
journal={Zeitschrift f\"ur Bibliothekswesen und Bibliographie (15/08/2007)
7 pages},
year={2007},
archivePrefix={arXiv},
eprint={0707.2886},
primaryClass={cs.DL}
} | romary2007oa@mps |
arxiv-800 | 0707.2921 | Covering a line segment with variable radius discs | <|reference_start|>Covering a line segment with variable radius discs: The paper addresses the problem of locating sensors with a circular field of view so that a given line segment is under full surveillance, which is termed as the Disc Covering Problem on a Line. The cost of each sensor includes a fixed component, an... | arxiv | @article{agnetis2007covering,
title={Covering a line segment with variable radius discs},
author={Alessandro Agnetis, Enrico Grande, Pitu B. Mirchandani, Andrea
Pacifici},
journal={arXiv preprint arXiv:0707.2921},
year={2007},
archivePrefix={arXiv},
eprint={0707.2921},
primaryClass={cs.DM ... | agnetis2007covering |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.