Sciweavers

37 search results - page 2 / 8
» What is the furthest graph from a hereditary property
Sort
View
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 3 months ago
Adding a referee to an interconnection network: What can(not) be computed in one round
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
Florent Becker, Martín Matamala, Nicolas Ni...
COMSWARE
2007
IEEE
13 years 11 months ago
Analysis of Dynamic Sensor Networks: Power Law Then What?
— Recent studies on wireless sensor networks (WSN) have shown that the duration of contacts and inter-contacts are power law distributed. While this is a strong property of these...
Eric Fleury, Jean-Loup Guillaume, Céline Ro...
AGP
1994
IEEE
13 years 9 months ago
What the Event Calculus actually does, and how to do it efficiently
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
Iliano Cervesato, Luca Chittaro, Angelo Montanari
FOCS
2002
IEEE
13 years 9 months ago
Global Information from Local Observation
We observe a certain random process on a graph ”locally”, i.e., in the neighborhood of a node, and would like to derive information about ”global” properties of the graph....
Itai Benjamini, László Lovász
COLT
2007
Springer
13 years 11 months ago
Property Testing: A Learning Theory Perspective
Property testing deals with tasks where the goal is to distinguish between the case that an object (e.g., function or graph) has a prespecified property (e.g., the function is li...
Dana Ron