output
20072026
most citedOpen data from the third observing run of LIGO, Virgo, KAGRA and GEO

331 citations

Showing 2011Show all

9 papers · 1 filter

cs.DC2011★ 1 cited

Relativistic causality and clockless circuits

Philippe Matherat, Marc-Thierry Jaekel

Time plays a crucial role in the performance of computing systems. The accurate modelling of logical devices, and of their physical implementations, requires an appropriate represe…

cs.AI2011★ 4 cited

Unbiased Statistics of a CSP - A Controlled-Bias Generator

Denis Berthier

We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two as…

cs.CC2011★ 1 cited

Maximum Bounded Rooted-Tree Packing Problem

Herve Kerivin, Jimmy Leblet, Gwendal Simon +1

Given a graph and a root, the Maximum Bounded Rooted-Tree Packing (MBRTP) problem aims at finding K rooted-trees that span the largest subset of vertices, when each vertex has a li…

cs.NI2011

Achieving Small World Properties using Bio-Inspired Techniques in Wireless Networks

Rachit Agarwal, Abhik Banerjee, Vincent Gauthier +3

It is highly desirable and challenging for a wireless ad hoc network to have self-organization properties in order to achieve network wide characteristics. Studies have shown that…

cs.NI2011★ 3 cited

Tensor-Based Link Prediction in Intermittently Connected Wireless Networks

Mohamed-Haykel Zayani, Vincent Gauthier, Ines Slama +1

Through several studies, it has been highlighted that mobility patterns in mobile networks are driven by human behaviors. This effect has been particularly observed in intermittent…

cs.DB2011★ 1 cited

Determining Relevance of Accesses at Runtime (Extended Version)

Michael Benedikt, Georg Gottlob, Pierre Senellart

Consider the situation where a query is to be answered using Web sources that restrict the accesses that can be made on backend relational data by requiring some attributes to be g…