Results 1  10
of
102,118
Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh
, 2003
"... In recent years, overlay networks have become an effective alternative to IP multicast for efficient point to multipoint communication across the Internet. Typically, nodes selforganize with the goal of forming an efficient overlay tree, one that meets performance targets without placing undue burd ..."
Abstract

Cited by 424 (22 self)
 Add to MetaCart
should be distributed in a disjoint manner to strategic points in the network. Individual Bullet receivers are then responsible for locating and retrieving the data from multiple points in parallel. Key contributions of this work include: i) an algorithm that sends data to di#erent points in the overlay
SSCH: Slotted Seeded Channel Hopping for Capacity Improvement in IEEE 802.11 AdHoc Wireless Networks
 in IEEE 802.11 AdHoc Wireless Networks,” in ACM Mobicom
, 2004
"... Capacity improvement is one of the principal challenges in wireless networking. We present a linklayer protocol called Slotted Seeded Channel Hopping, or SSCH, that increases the capacity of an IEEE 802.11 network by utilizing frequency diversity. SSCH can be implemented in software over an IEEE 80 ..."
Abstract

Cited by 347 (3 self)
 Add to MetaCart
802.11compliant wireless card. Each node using SSCH switches across channels in such a manner that nodes desiring to communicate overlap, while disjoint communications mostly do not overlap, and hence do not interfere with each other. To achieve this, SSCH uses a novel scheme for distributed
Understanding FaultTolerant Distributed Systems
 COMMUNICATIONS OF THE ACM
, 1993
"... We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design ..."
Abstract

Cited by 374 (23 self)
 Add to MetaCart
We propose a small number of basic concepts that can be used to explain the architecture of faulttolerant distributed systems and we discuss a list of architectural issues that we find useful to consider when designing or examining such systems. For each issue we present known solutions and design alternatives, we discuss their relative merits and we give examples of systems which adopt one approach or the other. The aim is to introduce some order in the complex discipline of designing and understanding faulttolerant distributed systems.
Be bound or be disjoint
 In Proceedings of the 38th Meeting of the North East Linguistics Society (NELS38
, 2007
"... We begin our paper with two observations. The first is that sets of highlyparallel utterances are plausibly analyzed as providing partial answers to a common QUESTIONUNDER ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We begin our paper with two observations. The first is that sets of highlyparallel utterances are plausibly analyzed as providing partial answers to a common QUESTIONUNDER
Disjoint systems
 Random Structures Algorithms
, 1995
"... An intersecting system of type (∃, ∀, k, n) is a collection F = {F1,...,Fm} pf pairwise disjoint families of k–subsets of an n–element set satisfying the following condition. For every ordered pair Fi and Fj of distinct members of F there exists an A ∈ Fi that intersects every B ∈ Fj. Let In(∃, ∀, k ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
An intersecting system of type (∃, ∀, k, n) is a collection F = {F1,...,Fm} pf pairwise disjoint families of k–subsets of an n–element set satisfying the following condition. For every ordered pair Fi and Fj of distinct members of F there exists an A ∈ Fi that intersects every B ∈ Fj. Let In
Nearoptimal hardness results and approximation algorithms for edgedisjoint paths and related problems
 Journal of Computer and System Sciences
, 1999
"... We study the approximability of edgedisjoint paths and related problems. In the edgedisjoint paths problem (EDP), we are given a network G with sourcesink pairs (si, ti), 1 ≤ i ≤ k, and the goal is to find a largest subset of sourcesink pairs that can be simultaneously connected in an edgedisjo ..."
Abstract

Cited by 108 (12 self)
 Add to MetaCart
We study the approximability of edgedisjoint paths and related problems. In the edgedisjoint paths problem (EDP), we are given a network G with sourcesink pairs (si, ti), 1 ≤ i ≤ k, and the goal is to find a largest subset of sourcesink pairs that can be simultaneously connected in an edgedisjoint
Automated Consistency Checking of Requirements Specifications
, 1996
"... This paper describes a formal analysis technique, called consistency checking, for automatic detection of errors, such as type errors, nondeterminism, missing cases, and circular definitions, in requirements specifications. The technique is designed to analyze requirements specifications expressed i ..."
Abstract

Cited by 268 (33 self)
 Add to MetaCart
This paper describes a formal analysis technique, called consistency checking, for automatic detection of errors, such as type errors, nondeterminism, missing cases, and circular definitions, in requirements specifications. The technique is designed to analyze requirements specifications expressed in the SCR (Software Cost Reduction) tabular notation. As background, the SCR approach to specifying requirements is reviewed. To provide a formal semantics for the SCR notation and a foundation for consistency checking, a formal requirements model is introduced; the model represents a software system as a finite state automaton, which produces externally visible outputs in response to changes in monitored environmental quantities. Results are presented of two experiments which evaluated the utility and sealability of our technique for consistency checking in a realworld avionics application. The role of consistency checking during the requirements phase of software development is discussed.
Disjoint NPPairs
, 2003
"... We study the question of whether the class DisNP of disjoint pairs (A, B) of NPsets contains a complete pair. The question relates to the question of whether optimal proof systems exist, and we relate it to the previously studied question of whether there exists a disjoint pair of NPsets that is N ..."
Abstract

Cited by 23 (8 self)
 Add to MetaCart
We study the question of whether the class DisNP of disjoint pairs (A, B) of NPsets contains a complete pair. The question relates to the question of whether optimal proof systems exist, and we relate it to the previously studied question of whether there exists a disjoint pair of NP
Approximability of packing disjoint cycles
 IN: PROCEEDINGS OF 18TH INTERNATIONAL SYMPOSIUM ON ALGORITHMS AND COMPUTATION
, 2007
"... Given a graph G, the edgedisjoint cycle packing problem is to nd the largest set of cycles of which no two share an edge. For undirected graphs, the best known approximation algorithm has ratio O( p log n) where n = jV (G)j and is due to Krivelevich et al [14, 15]. In fact, they proved the same upp ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Given a graph G, the edgedisjoint cycle packing problem is to nd the largest set of cycles of which no two share an edge. For undirected graphs, the best known approximation algorithm has ratio O( p log n) where n = jV (G)j and is due to Krivelevich et al [14, 15]. In fact, they proved the same
The Disjoint Cliques Problem
 Operations Research
, 1997
"... Given a graph G = (V; E), we consider the problem of nding a set of D pairwise disjoint cliques in the graph with maximum overall number of vertices. We determine the computational complexity of this problem restricted to a variety of dierent graph classes. We give polynomial time algorithms for th ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Given a graph G = (V; E), we consider the problem of nding a set of D pairwise disjoint cliques in the graph with maximum overall number of vertices. We determine the computational complexity of this problem restricted to a variety of dierent graph classes. We give polynomial time algorithms
Results 1  10
of
102,118